/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-scaling/fermat1-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 08:57:34,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 08:57:34,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 08:57:34,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 08:57:34,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 08:57:34,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 08:57:34,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 08:57:34,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 08:57:34,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 08:57:34,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 08:57:34,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 08:57:34,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 08:57:34,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 08:57:34,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 08:57:34,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 08:57:34,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 08:57:34,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 08:57:34,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 08:57:34,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 08:57:34,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 08:57:34,821 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 08:57:34,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 08:57:34,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 08:57:34,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 08:57:34,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 08:57:34,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 08:57:34,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 08:57:34,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 08:57:34,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 08:57:34,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 08:57:34,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 08:57:34,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 08:57:34,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 08:57:34,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 08:57:34,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 08:57:34,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 08:57:34,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 08:57:34,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 08:57:34,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 08:57:34,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 08:57:34,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 08:57:34,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 08:57:34,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 08:57:34,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 08:57:34,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 08:57:34,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 08:57:34,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 08:57:34,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 08:57:34,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 08:57:34,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 08:57:34,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 08:57:34,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 08:57:34,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 08:57:34,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:57:34,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 08:57:34,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 08:57:34,859 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 08:57:34,859 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 08:57:34,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 08:57:34,859 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 08:57:34,859 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 08:57:35,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 08:57:35,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 08:57:35,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 08:57:35,077 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 08:57:35,078 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 08:57:35,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-15 08:57:35,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3d8f7f2/bdc27dcd742d4003bd994027a5dd2c22/FLAGb16ea2752 [2022-04-15 08:57:35,436 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 08:57:35,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-15 08:57:35,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3d8f7f2/bdc27dcd742d4003bd994027a5dd2c22/FLAGb16ea2752 [2022-04-15 08:57:35,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3d8f7f2/bdc27dcd742d4003bd994027a5dd2c22 [2022-04-15 08:57:35,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 08:57:35,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 08:57:35,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 08:57:35,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 08:57:35,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 08:57:35,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:57:35" (1/1) ... [2022-04-15 08:57:35,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e36466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:35, skipping insertion in model container [2022-04-15 08:57:35,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 08:57:35" (1/1) ... [2022-04-15 08:57:35,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 08:57:35,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 08:57:36,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2022-04-15 08:57:36,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:57:36,073 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 08:57:36,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c[535,548] [2022-04-15 08:57:36,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 08:57:36,108 INFO L208 MainTranslator]: Completed translation [2022-04-15 08:57:36,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36 WrapperNode [2022-04-15 08:57:36,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 08:57:36,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 08:57:36,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 08:57:36,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 08:57:36,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 08:57:36,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 08:57:36,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 08:57:36,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 08:57:36,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (1/1) ... [2022-04-15 08:57:36,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 08:57:36,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:57:36,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 08:57:36,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 08:57:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 08:57:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 08:57:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 08:57:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 08:57:36,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 08:57:36,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 08:57:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 08:57:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 08:57:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 08:57:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 08:57:36,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 08:57:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 08:57:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 08:57:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 08:57:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 08:57:36,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 08:57:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 08:57:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 08:57:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 08:57:36,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 08:57:36,231 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 08:57:36,232 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 08:57:36,346 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 08:57:36,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 08:57:36,351 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 08:57:36,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:57:36 BoogieIcfgContainer [2022-04-15 08:57:36,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 08:57:36,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 08:57:36,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 08:57:36,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 08:57:36,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 08:57:35" (1/3) ... [2022-04-15 08:57:36,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c47d1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:57:36, skipping insertion in model container [2022-04-15 08:57:36,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 08:57:36" (2/3) ... [2022-04-15 08:57:36,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c47d1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 08:57:36, skipping insertion in model container [2022-04-15 08:57:36,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 08:57:36" (3/3) ... [2022-04-15 08:57:36,359 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2022-04-15 08:57:36,362 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 08:57:36,362 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 08:57:36,388 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 08:57:36,403 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 08:57:36,403 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 08:57:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:57:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 08:57:36,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:57:36,432 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:57:36,432 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:57:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:57:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 08:57:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:57:36,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [603388956] [2022-04-15 08:57:36,456 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:57:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 08:57:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:57:36,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149122774] [2022-04-15 08:57:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:57:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:57:36,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:57:36,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323763275] [2022-04-15 08:57:36,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:57:36,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:57:36,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:57:36,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:57:36,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 08:57:36,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:57:36,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:57:36,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 08:57:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:57:36,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:57:36,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 08:57:36,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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);~counter~0 := 0; {40#true} is VALID [2022-04-15 08:57:36,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:57:36,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 08:57:36,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 08:57:36,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-15 08:57:36,706 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-15 08:57:36,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:57:36,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 08:57:36,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 08:57:36,706 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 08:57:36,707 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#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)); {40#true} is VALID [2022-04-15 08:57:36,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 08:57:36,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 08:57:36,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 08:57:36,708 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 08:57:36,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-15 08:57:36,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 08:57:36,708 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#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)); {41#false} is VALID [2022-04-15 08:57:36,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 08:57:36,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 08:57:36,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 08:57:36,709 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-15 08:57:36,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:57:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:57:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149122774] [2022-04-15 08:57:36,710 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:57:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323763275] [2022-04-15 08:57:36,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323763275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:57:36,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:57:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 08:57:36,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:57:36,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [603388956] [2022-04-15 08:57:36,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [603388956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:57:36,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:57:36,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 08:57:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824897097] [2022-04-15 08:57:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:57:36,720 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-15 08:57:36,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:57:36,723 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-15 08:57:36,744 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-15 08:57:36,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 08:57:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:57:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 08:57:36,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 08:57:36,772 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-15 08:57:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:36,856 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 08:57:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 08:57:36,856 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-15 08:57:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:57:36,857 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-15 08:57:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 08:57:36,862 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-15 08:57:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 08:57:36,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 08:57:36,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:57:36,970 INFO L225 Difference]: With dead ends: 67 [2022-04-15 08:57:36,971 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 08:57:36,973 INFO L912 BasicCegarLoop]: 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-15 08:57:36,976 INFO L913 BasicCegarLoop]: 46 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, 46 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-15 08:57:36,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:57:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 08:57:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 08:57:36,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:57:36,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:36,998 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:36,999 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:37,002 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 08:57:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:57:37,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:57:37,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:57:37,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 08:57:37,005 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 08:57:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:37,010 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 08:57:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:57:37,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:57:37,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:57:37,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:57:37,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:57:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 08:57:37,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 08:57:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:57:37,014 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 08:57:37,014 INFO L479 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-15 08:57:37,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 08:57:37,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:57:37,048 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 08:57:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:57:37,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:57:37,049 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:57:37,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 08:57:37,282 WARN L460 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-15 08:57:37,283 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:57:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:57:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 08:57:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:57:37,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540701811] [2022-04-15 08:57:37,285 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:57:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 08:57:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:57:37,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141361046] [2022-04-15 08:57:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:57:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:57:37,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:57:37,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445956183] [2022-04-15 08:57:37,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:57:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:57:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:57:37,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:57:37,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 08:57:37,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:57:37,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:57:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 08:57:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:57:37,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:57:37,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 08:57:37,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#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);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} 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; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,565 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} 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)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 08:57:37,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-15 08:57:37,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {370#false} is VALID [2022-04-15 08:57:37,568 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#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)); {370#false} is VALID [2022-04-15 08:57:37,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 08:57:37,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 08:57:37,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 08:57:37,569 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-15 08:57:37,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:57:37,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:57:37,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141361046] [2022-04-15 08:57:37,569 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:57:37,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445956183] [2022-04-15 08:57:37,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445956183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:57:37,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:57:37,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:57:37,570 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:57:37,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540701811] [2022-04-15 08:57:37,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540701811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:57:37,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:57:37,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:57:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674551465] [2022-04-15 08:57:37,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:57:37,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 08:57:37,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:57:37,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:57:37,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:57:37,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:57:37,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:57:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:57:37,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:57:37,587 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:57:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:37,651 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 08:57:37,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:57:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 08:57:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:57:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:57:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 08:57:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:57:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 08:57:37,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 08:57:37,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:57:37,689 INFO L225 Difference]: With dead ends: 41 [2022-04-15 08:57:37,689 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 08:57:37,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:57:37,690 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:57:37,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:57:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 08:57:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 08:57:37,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:57:37,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:37,700 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:37,701 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:37,702 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 08:57:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:57:37,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:57:37,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:57:37,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 08:57:37,704 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 08:57:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:37,705 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 08:57:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:57:37,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:57:37,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:57:37,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:57:37,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:57:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:57:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 08:57:37,708 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 08:57:37,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:57:37,708 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 08:57:37,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 08:57:37,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 08:57:37,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:57:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 08:57:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 08:57:37,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:57:37,747 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:57:37,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 08:57:37,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 08:57:37,963 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:57:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:57:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 08:57:37,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:57:37,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638077951] [2022-04-15 08:57:37,964 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:57:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 08:57:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:57:37,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532763204] [2022-04-15 08:57:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:57:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:57:37,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:57:37,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947305377] [2022-04-15 08:57:37,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:57:37,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:57:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:57:38,005 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-15 08:57:38,005 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-15 08:57:38,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 08:57:38,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:57:38,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:57:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:57:38,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:57:39,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 08:57:39,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#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);~counter~0 := 0; {659#true} is VALID [2022-04-15 08:57:39,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:57:39,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 08:57:39,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 08:57:39,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#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; {659#true} is VALID [2022-04-15 08:57:39,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-15 08:57:39,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 08:57:39,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 08:57:39,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:57:39,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 08:57:39,591 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#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)); {659#true} is VALID [2022-04-15 08:57:39,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 08:57:39,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 08:57:39,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 08:57:39,592 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 08:57:41,595 WARN L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(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 UNKNOWN [2022-04-15 08:57:41,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(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-15 08:57:41,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(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 !!(#t~post6 < 10);havoc #t~post6; {712#(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-15 08:57:42,221 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(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)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:57:42,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:57:42,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 08:57:42,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 08:57:42,223 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-15 08:57:42,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:57:42,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:57:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532763204] [2022-04-15 08:57:42,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:57:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947305377] [2022-04-15 08:57:42,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947305377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:57:42,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:57:42,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:57:42,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:57:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638077951] [2022-04-15 08:57:42,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638077951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:57:42,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:57:42,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:57:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960120599] [2022-04-15 08:57:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:57:42,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 08:57:42,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:57:42,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:57:44,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:57:44,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:57:44,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:57:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:57:44,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:57:44,467 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:57:56,229 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-15 08:57:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:57:56,268 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 08:57:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:57:56,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 08:57:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:57:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:57:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 08:57:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:57:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 08:57:56,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 08:58:00,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:00,113 INFO L225 Difference]: With dead ends: 53 [2022-04-15 08:58:00,113 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 08:58:00,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 08:58:00,114 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:00,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 08:58:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 08:58:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 08:58:00,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:00,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 08:58:00,133 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 08:58:00,133 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 08:58:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:00,135 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 08:58:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 08:58:00,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:00,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:00,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 08:58:00,136 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 08:58:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:00,138 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 08:58:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 08:58:00,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:00,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:00,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:00,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 08:58:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 08:58:00,140 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 08:58:00,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:00,141 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 08:58:00,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 08:58:00,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 08:58:05,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 66 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 08:58:05,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 08:58:05,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:05,168 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-15 08:58:05,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:05,369 WARN L460 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-15 08:58:05,369 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 08:58:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:05,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248480791] [2022-04-15 08:58:05,370 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 08:58:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:05,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207391245] [2022-04-15 08:58:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:05,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:05,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888471411] [2022-04-15 08:58:05,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:05,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:05,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 08:58:05,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:05,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:05,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 08:58:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:05,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:05,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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);~counter~0 := 0; {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#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; {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 08:58:05,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:58:05,570 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 08:58:05,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 08:58:05,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 08:58:05,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 10);havoc #t~post6; {1042#true} is VALID [2022-04-15 08:58:05,571 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 08:58:05,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:58:05,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:58:05,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:58:05,573 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* 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-15 08:58:05,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* 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); {1122#(= (+ (* 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-15 08:58:05,575 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* 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)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:58:05,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:58:05,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 08:58:05,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 08:58:05,576 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-15 08:58:05,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:05,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 08:58:05,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 08:58:05,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 08:58:05,910 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* 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)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 08:58:05,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(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); {1122#(= (+ (* 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-15 08:58:05,911 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(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-15 08:58:05,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:58:05,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 08:58:05,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 08:58:05,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 08:58:05,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 10);havoc #t~post6; {1042#true} is VALID [2022-04-15 08:58:05,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 08:58:05,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 08:58:05,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 08:58:05,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 08:58:05,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#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; {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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);~counter~0 := 0; {1042#true} is VALID [2022-04-15 08:58:05,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 08:58:05,915 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-15 08:58:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207391245] [2022-04-15 08:58:05,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888471411] [2022-04-15 08:58:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888471411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:05,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:05,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 08:58:05,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248480791] [2022-04-15 08:58:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248480791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:58:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358151418] [2022-04-15 08:58:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 29 [2022-04-15 08:58:05,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:05,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-15 08:58:05,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:05,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:58:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:58:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:58:05,935 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-15 08:58:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:06,256 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 08:58:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:58:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 29 [2022-04-15 08:58:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-15 08:58:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 08:58:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-15 08:58:06,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 08:58:06,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 08:58:06,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:06,298 INFO L225 Difference]: With dead ends: 57 [2022-04-15 08:58:06,298 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 08:58:06,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:58:06,299 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:06,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 08:58:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-15 08:58:06,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:06,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:58:06,315 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:58:06,315 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:58:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:06,316 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 08:58:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 08:58:06,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:06,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:06,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-15 08:58:06,317 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-15 08:58:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:06,319 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 08:58:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 08:58:06,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:06,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:06,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:06,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 08:58:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-15 08:58:06,321 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-15 08:58:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:06,321 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-15 08:58:06,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-15 08:58:06,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-15 08:58:08,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 08:58:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 08:58:08,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:08,364 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:08,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:08,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:08,564 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 08:58:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:08,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921231441] [2022-04-15 08:58:08,565 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 08:58:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:08,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122301463] [2022-04-15 08:58:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:08,576 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:08,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634874982] [2022-04-15 08:58:08,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:08,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:08,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:08,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 08:58:08,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:08,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:08,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 08:58:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:08,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:08,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 08:58:08,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#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);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~counter~0 0)} 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; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,926 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~counter~0 0)} 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)); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:08,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,929 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~counter~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)); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,931 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,931 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1522#false} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 10);havoc #t~post8; {1522#false} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 10);havoc #t~post6; {1522#false} is VALID [2022-04-15 08:58:08,932 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#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)); {1522#false} is VALID [2022-04-15 08:58:08,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-15 08:58:08,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-15 08:58:08,933 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 08:58:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:08,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:58:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122301463] [2022-04-15 08:58:08,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634874982] [2022-04-15 08:58:08,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634874982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:08,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:08,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:58:08,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:08,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921231441] [2022-04-15 08:58:08,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921231441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:08,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:08,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 08:58:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707373032] [2022-04-15 08:58:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:08,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 08:58:08,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:08,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:58:08,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:08,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 08:58:08,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 08:58:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:58:08,957 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:58:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:09,059 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 08:58:09,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:58:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 08:58:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:09,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:58:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 08:58:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:58:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 08:58:09,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 08:58:09,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:09,114 INFO L225 Difference]: With dead ends: 65 [2022-04-15 08:58:09,114 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 08:58:09,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:58:09,114 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:09,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 08:58:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 08:58:09,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:09,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:58:09,138 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:58:09,138 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:58:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:09,140 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 08:58:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 08:58:09,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:09,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:09,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 08:58:09,140 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 08:58:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:09,141 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 08:58:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 08:58:09,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:09,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:09,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:09,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 08:58:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-15 08:58:09,143 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-15 08:58:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:09,143 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-15 08:58:09,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 08:58:09,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-15 08:58:10,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 08:58:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 08:58:10,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:10,489 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:10,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 08:58:10,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:10,690 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 08:58:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:10,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492856950] [2022-04-15 08:58:10,690 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 08:58:10,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:10,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138281339] [2022-04-15 08:58:10,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:10,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:10,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:10,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1954179687] [2022-04-15 08:58:10,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:10,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:10,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:10,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:10,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 08:58:10,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:10,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:10,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:58:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:10,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:10,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-15 08:58:10,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#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);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~counter~0 0)} 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; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,940 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,942 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~counter~0 0)} 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)); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,943 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:10,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,945 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~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)); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,946 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:10,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,948 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~counter~0 2)} 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)); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,949 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 10);havoc #t~post8; {1937#false} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 10);havoc #t~post6; {1937#false} is VALID [2022-04-15 08:58:10,950 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#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)); {1937#false} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-15 08:58:10,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-15 08:58:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:10,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:11,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-15 08:58:11,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-15 08:58:11,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-15 08:58:11,157 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#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)); {1937#false} is VALID [2022-04-15 08:58:11,158 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 10);havoc #t~post6; {1937#false} is VALID [2022-04-15 08:58:11,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-15 08:58:11,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {1937#false} is VALID [2022-04-15 08:58:11,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 10)} is VALID [2022-04-15 08:58:11,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 10)} assume !(~r~0 > 0); {2087#(< ~counter~0 10)} is VALID [2022-04-15 08:58:11,159 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 10)} #96#return; {2087#(< ~counter~0 10)} is VALID [2022-04-15 08:58:11,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:58:11,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:58:11,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:58:11,159 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~counter~0 10)} 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)); {1936#true} is VALID [2022-04-15 08:58:11,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {2087#(< ~counter~0 10)} is VALID [2022-04-15 08:58:11,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 10)} is VALID [2022-04-15 08:58:11,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 9)} assume !!(0 != ~r~0); {2112#(< ~counter~0 9)} is VALID [2022-04-15 08:58:11,161 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 9)} #94#return; {2112#(< ~counter~0 9)} is VALID [2022-04-15 08:58:11,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:58:11,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:58:11,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:58:11,161 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~counter~0 9)} 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)); {1936#true} is VALID [2022-04-15 08:58:11,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2112#(< ~counter~0 9)} is VALID [2022-04-15 08:58:11,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {2137#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 9)} is VALID [2022-04-15 08:58:11,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {2137#(< ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,163 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 8)} #92#return; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:58:11,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:58:11,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:58:11,163 INFO L272 TraceCheckUtils]: 11: Hoare triple {2137#(< ~counter~0 8)} 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)); {1936#true} is VALID [2022-04-15 08:58:11,164 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 8)} #90#return; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 08:58:11,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 08:58:11,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 08:58:11,164 INFO L272 TraceCheckUtils]: 6: Hoare triple {2137#(< ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1936#true} is VALID [2022-04-15 08:58:11,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(< ~counter~0 8)} 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; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 8)} call #t~ret9 := main(); {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 8)} {1936#true} #102#return; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 8)} assume true; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#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);~counter~0 := 0; {2137#(< ~counter~0 8)} is VALID [2022-04-15 08:58:11,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-15 08:58:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 08:58:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138281339] [2022-04-15 08:58:11,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:11,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954179687] [2022-04-15 08:58:11,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954179687] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 08:58:11,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 08:58:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-15 08:58:11,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:11,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1492856950] [2022-04-15 08:58:11,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1492856950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:11,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:11,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:58:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115937817] [2022-04-15 08:58:11,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 08:58:11,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:11,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:11,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:11,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:58:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:58:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:58:11,193 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:11,342 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-15 08:58:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 08:58:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 08:58:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 08:58:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 08:58:11,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 08:58:11,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:11,402 INFO L225 Difference]: With dead ends: 74 [2022-04-15 08:58:11,402 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 08:58:11,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:58:11,403 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:11,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 08:58:11,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 08:58:11,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:11,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:11,443 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:11,443 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:11,444 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 08:58:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 08:58:11,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:11,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:11,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 08:58:11,445 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 08:58:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:11,446 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 08:58:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 08:58:11,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:11,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:11,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:11,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-15 08:58:11,448 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-15 08:58:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:11,448 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-15 08:58:11,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:11,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-15 08:58:13,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-15 08:58:13,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 08:58:13,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:13,512 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:13,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 08:58:13,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:13,712 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 08:58:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:13,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730833693] [2022-04-15 08:58:13,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 08:58:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:13,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435269858] [2022-04-15 08:58:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:13,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:13,722 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:13,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098315452] [2022-04-15 08:58:13,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:13,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:13,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:13,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:13,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 08:58:13,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:13,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:13,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 08:58:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:13,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:13,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-15 08:58:13,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#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);~counter~0 := 0; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(<= ~counter~0 0)} 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; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {2557#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,959 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,960 INFO L272 TraceCheckUtils]: 11: Hoare triple {2557#(<= ~counter~0 0)} 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)); {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,961 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2557#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:13,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {2606#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,963 INFO L272 TraceCheckUtils]: 19: Hoare triple {2606#(<= ~counter~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)); {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,964 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:13,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {2606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {2631#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,966 INFO L272 TraceCheckUtils]: 27: Hoare triple {2631#(<= ~counter~0 2)} 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)); {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,968 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {2631#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2631#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:13,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {2631#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2656#(<= |main_#t~post7| 2)} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 10);havoc #t~post8; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 10);havoc #t~post6; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#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)); {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-15 08:58:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:13,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:14,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L272 TraceCheckUtils]: 39: Hoare triple {2550#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)); {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 10);havoc #t~post6; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 10);havoc #t~post8; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-15 08:58:14,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {2550#false} is VALID [2022-04-15 08:58:14,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {2712#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2708#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:58:14,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {2712#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2712#(< ~counter~0 10)} is VALID [2022-04-15 08:58:14,190 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 10)} #96#return; {2712#(< ~counter~0 10)} is VALID [2022-04-15 08:58:14,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-15 08:58:14,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-15 08:58:14,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-15 08:58:14,190 INFO L272 TraceCheckUtils]: 27: Hoare triple {2712#(< ~counter~0 10)} 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)); {2549#true} is VALID [2022-04-15 08:58:14,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {2712#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {2712#(< ~counter~0 10)} is VALID [2022-04-15 08:58:14,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {2737#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2712#(< ~counter~0 10)} is VALID [2022-04-15 08:58:14,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 9)} assume !!(0 != ~r~0); {2737#(< ~counter~0 9)} is VALID [2022-04-15 08:58:14,192 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 9)} #94#return; {2737#(< ~counter~0 9)} is VALID [2022-04-15 08:58:14,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-15 08:58:14,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-15 08:58:14,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-15 08:58:14,192 INFO L272 TraceCheckUtils]: 19: Hoare triple {2737#(< ~counter~0 9)} 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)); {2549#true} is VALID [2022-04-15 08:58:14,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {2737#(< ~counter~0 9)} is VALID [2022-04-15 08:58:14,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {2762#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2737#(< ~counter~0 9)} is VALID [2022-04-15 08:58:14,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(< ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,194 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 8)} #92#return; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-15 08:58:14,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-15 08:58:14,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-15 08:58:14,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {2762#(< ~counter~0 8)} 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)); {2549#true} is VALID [2022-04-15 08:58:14,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 8)} #90#return; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-15 08:58:14,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-15 08:58:14,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-15 08:58:14,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {2762#(< ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2549#true} is VALID [2022-04-15 08:58:14,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {2762#(< ~counter~0 8)} 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; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 8)} call #t~ret9 := main(); {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 8)} {2549#true} #102#return; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 8)} assume true; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#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);~counter~0 := 0; {2762#(< ~counter~0 8)} is VALID [2022-04-15 08:58:14,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-15 08:58:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 08:58:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435269858] [2022-04-15 08:58:14,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098315452] [2022-04-15 08:58:14,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098315452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:14,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:14,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 08:58:14,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730833693] [2022-04-15 08:58:14,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730833693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:14,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:14,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 08:58:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438129727] [2022-04-15 08:58:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-15 08:58:14,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:14,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:14,226 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-15 08:58:14,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 08:58:14,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 08:58:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 08:58:14,226 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:14,396 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-15 08:58:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 08:58:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-15 08:58:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 08:58:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 08:58:14,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 08:58:14,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:14,455 INFO L225 Difference]: With dead ends: 75 [2022-04-15 08:58:14,456 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 08:58:14,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 08:58:14,456 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:14,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 08:58:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 08:58:14,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:14,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:14,500 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:14,500 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:14,501 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 08:58:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 08:58:14,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:14,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:14,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 08:58:14,502 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 08:58:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:14,503 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 08:58:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 08:58:14,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:14,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:14,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:14,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 08:58:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-15 08:58:14,505 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-15 08:58:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:14,505 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-15 08:58:14,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 08:58:14,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-15 08:58:16,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 08:58:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 08:58:16,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:16,590 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:16,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 08:58:16,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:16,791 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 08:58:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:16,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727104959] [2022-04-15 08:58:16,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 08:58:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:16,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402146355] [2022-04-15 08:58:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:16,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:16,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263323942] [2022-04-15 08:58:16,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:16,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:16,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:16,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:16,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 08:58:16,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:16,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:16,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 08:58:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:16,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:17,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {3184#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);~counter~0 := 0; {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {3184#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; {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {3184#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3184#true} is VALID [2022-04-15 08:58:17,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L272 TraceCheckUtils]: 11: Hoare triple {3184#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)); {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {3184#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 10);havoc #t~post6; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {3184#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)); {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-15 08:58:17,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 08:58:17,003 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-15 08:58:17,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-15 08:58:17,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {3261#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-15 08:58:17,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {3261#(not (= main_~r~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3261#(not (= main_~r~0 0))} is VALID [2022-04-15 08:58:17,004 INFO L272 TraceCheckUtils]: 27: Hoare triple {3261#(not (= main_~r~0 0))} 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)); {3184#true} is VALID [2022-04-15 08:58:17,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-15 08:58:17,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-15 08:58:17,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 08:58:17,005 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3184#true} {3261#(not (= main_~r~0 0))} #96#return; {3261#(not (= main_~r~0 0))} is VALID [2022-04-15 08:58:17,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {3261#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 08:58:17,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 08:58:17,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 10);havoc #t~post8; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 08:58:17,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} 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)); {3184#true} is VALID [2022-04-15 08:58:17,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-15 08:58:17,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-15 08:58:17,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-15 08:58:17,011 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3184#true} {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 08:58:17,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {3286#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3185#false} is VALID [2022-04-15 08:58:17,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-15 08:58:17,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 10);havoc #t~post6; {3185#false} is VALID [2022-04-15 08:58:17,012 INFO L272 TraceCheckUtils]: 43: Hoare triple {3185#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)); {3185#false} is VALID [2022-04-15 08:58:17,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-15 08:58:17,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-15 08:58:17,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-15 08:58:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 08:58:17,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:58:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:17,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402146355] [2022-04-15 08:58:17,013 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:17,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263323942] [2022-04-15 08:58:17,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263323942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:17,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:17,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:58:17,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:17,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727104959] [2022-04-15 08:58:17,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727104959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:17,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:17,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:58:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278674174] [2022-04-15 08:58:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 08:58:17,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:17,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 08:58:17,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:17,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:58:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:58:17,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:58:17,043 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 08:58:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:17,182 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-15 08:58:17,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:58:17,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 08:58:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 08:58:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 08:58:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 08:58:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 08:58:17,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 08:58:17,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:17,281 INFO L225 Difference]: With dead ends: 101 [2022-04-15 08:58:17,281 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 08:58:17,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:58:17,282 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:17,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 08:58:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-15 08:58:17,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:17,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 08:58:17,356 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 08:58:17,357 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 08:58:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:17,365 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 08:58:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 08:58:17,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:17,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:17,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-15 08:58:17,365 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-15 08:58:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:17,371 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 08:58:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 08:58:17,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:17,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:17,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:17,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 08:58:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-15 08:58:17,379 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-15 08:58:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:17,379 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-15 08:58:17,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 08:58:17,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-15 08:58:17,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-15 08:58:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 08:58:17,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:17,895 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:17,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:18,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 08:58:18,111 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 08:58:18,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:18,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690648035] [2022-04-15 08:58:18,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 08:58:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892688309] [2022-04-15 08:58:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:18,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287458635] [2022-04-15 08:58:18,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:18,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:18,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:18,128 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:18,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 08:58:18,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:18,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:18,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:58:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:18,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:18,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-15 08:58:18,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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);~counter~0 := 0; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#(<= ~counter~0 0)} 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; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {3838#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {3838#(<= ~counter~0 0)} 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)); {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,408 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {3838#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3838#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:18,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {3838#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,409 INFO L272 TraceCheckUtils]: 19: Hoare triple {3887#(<= ~counter~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)); {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,410 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:18,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {3887#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {3912#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,412 INFO L272 TraceCheckUtils]: 27: Hoare triple {3912#(<= ~counter~0 2)} 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)); {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,413 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:18,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {3912#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {3937#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,415 INFO L272 TraceCheckUtils]: 35: Hoare triple {3937#(<= ~counter~0 3)} 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)); {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,416 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {3937#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3937#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {3937#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3962#(<= |main_#t~post8| 3)} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 10);havoc #t~post8; {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 10);havoc #t~post6; {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#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)); {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-15 08:58:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:18,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:18,630 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L272 TraceCheckUtils]: 45: Hoare triple {3831#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)); {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 10);havoc #t~post6; {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {3831#false} is VALID [2022-04-15 08:58:18,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {4006#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4002#(< |main_#t~post8| 10)} is VALID [2022-04-15 08:58:18,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {4006#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4006#(< ~counter~0 10)} is VALID [2022-04-15 08:58:18,636 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 10)} #98#return; {4006#(< ~counter~0 10)} is VALID [2022-04-15 08:58:18,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 08:58:18,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 08:58:18,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 08:58:18,637 INFO L272 TraceCheckUtils]: 35: Hoare triple {4006#(< ~counter~0 10)} 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)); {3830#true} is VALID [2022-04-15 08:58:18,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {4006#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {4006#(< ~counter~0 10)} is VALID [2022-04-15 08:58:18,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {4031#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4006#(< ~counter~0 10)} is VALID [2022-04-15 08:58:18,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 9)} assume !(~r~0 > 0); {4031#(< ~counter~0 9)} is VALID [2022-04-15 08:58:18,638 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 9)} #96#return; {4031#(< ~counter~0 9)} is VALID [2022-04-15 08:58:18,638 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 08:58:18,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 08:58:18,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 08:58:18,638 INFO L272 TraceCheckUtils]: 27: Hoare triple {4031#(< ~counter~0 9)} 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)); {3830#true} is VALID [2022-04-15 08:58:18,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {4031#(< ~counter~0 9)} is VALID [2022-04-15 08:58:18,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {4056#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4031#(< ~counter~0 9)} is VALID [2022-04-15 08:58:18,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 8)} assume !!(0 != ~r~0); {4056#(< ~counter~0 8)} is VALID [2022-04-15 08:58:18,640 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 8)} #94#return; {4056#(< ~counter~0 8)} is VALID [2022-04-15 08:58:18,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 08:58:18,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 08:58:18,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 08:58:18,640 INFO L272 TraceCheckUtils]: 19: Hoare triple {4056#(< ~counter~0 8)} 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)); {3830#true} is VALID [2022-04-15 08:58:18,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {4056#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4056#(< ~counter~0 8)} is VALID [2022-04-15 08:58:18,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {4081#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4056#(< ~counter~0 8)} is VALID [2022-04-15 08:58:18,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {4081#(< ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,641 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 7)} #92#return; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L272 TraceCheckUtils]: 11: Hoare triple {4081#(< ~counter~0 7)} 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)); {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 7)} #90#return; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-15 08:58:18,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {4081#(< ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-15 08:58:18,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {4081#(< ~counter~0 7)} 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; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 7)} call #t~ret9 := main(); {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 7)} {3830#true} #102#return; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 7)} assume true; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#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);~counter~0 := 0; {4081#(< ~counter~0 7)} is VALID [2022-04-15 08:58:18,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-15 08:58:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 08:58:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:18,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892688309] [2022-04-15 08:58:18,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:18,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287458635] [2022-04-15 08:58:18,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287458635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:18,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:18,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 08:58:18,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:18,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690648035] [2022-04-15 08:58:18,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690648035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:18,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:18,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:58:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937517947] [2022-04-15 08:58:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-15 08:58:18,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:18,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:18,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:18,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:58:18,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:18,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:58:18,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:58:18,678 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:18,896 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-15 08:58:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 08:58:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-15 08:58:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 08:58:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 08:58:18,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 08:58:18,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:18,967 INFO L225 Difference]: With dead ends: 118 [2022-04-15 08:58:18,967 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 08:58:18,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:58:18,968 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:18,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 08:58:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 08:58:19,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:19,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:19,022 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:19,022 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:19,024 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 08:58:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 08:58:19,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:19,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:19,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-15 08:58:19,025 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-15 08:58:19,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:19,026 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 08:58:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 08:58:19,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:19,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:19,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:19,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-15 08:58:19,028 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-15 08:58:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:19,028 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-15 08:58:19,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:19,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-15 08:58:21,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-15 08:58:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 08:58:21,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:21,133 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:21,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:21,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:21,349 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 08:58:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866745213] [2022-04-15 08:58:21,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 08:58:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067168986] [2022-04-15 08:58:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:21,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:21,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907645493] [2022-04-15 08:58:21,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:58:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:21,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:21,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 08:58:21,429 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:58:21,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 08:58:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:21,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:21,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-15 08:58:21,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#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);~counter~0 := 0; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {4703#(<= ~counter~0 0)} 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; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,703 INFO L272 TraceCheckUtils]: 6: Hoare triple {4703#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,705 INFO L272 TraceCheckUtils]: 11: Hoare triple {4703#(<= ~counter~0 0)} 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)); {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,706 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {4703#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4703#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:21,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {4703#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {4752#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,708 INFO L272 TraceCheckUtils]: 19: Hoare triple {4752#(<= ~counter~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)); {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:21,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {4752#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {4777#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,712 INFO L272 TraceCheckUtils]: 27: Hoare triple {4777#(<= ~counter~0 2)} 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)); {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,713 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {4777#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4777#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:21,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {4777#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {4802#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,715 INFO L272 TraceCheckUtils]: 35: Hoare triple {4802#(<= ~counter~0 3)} 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)); {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,718 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {4802#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4802#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:21,718 INFO L290 TraceCheckUtils]: 41: Hoare triple {4802#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4827#(<= |main_#t~post7| 3)} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 10);havoc #t~post8; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 10);havoc #t~post6; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#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)); {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-15 08:58:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:21,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:21,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L272 TraceCheckUtils]: 47: Hoare triple {4696#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)); {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 10);havoc #t~post6; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 10);havoc #t~post8; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-15 08:58:21,990 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {4696#false} is VALID [2022-04-15 08:58:21,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {4883#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4879#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:58:21,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {4883#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4883#(< ~counter~0 10)} is VALID [2022-04-15 08:58:21,992 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 10)} #96#return; {4883#(< ~counter~0 10)} is VALID [2022-04-15 08:58:21,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-15 08:58:21,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-15 08:58:21,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-15 08:58:21,992 INFO L272 TraceCheckUtils]: 35: Hoare triple {4883#(< ~counter~0 10)} 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)); {4695#true} is VALID [2022-04-15 08:58:21,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {4883#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {4883#(< ~counter~0 10)} is VALID [2022-04-15 08:58:21,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {4908#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4883#(< ~counter~0 10)} is VALID [2022-04-15 08:58:21,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {4908#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4908#(< ~counter~0 9)} is VALID [2022-04-15 08:58:21,994 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 9)} #96#return; {4908#(< ~counter~0 9)} is VALID [2022-04-15 08:58:21,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-15 08:58:21,994 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-15 08:58:21,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-15 08:58:21,994 INFO L272 TraceCheckUtils]: 27: Hoare triple {4908#(< ~counter~0 9)} 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)); {4695#true} is VALID [2022-04-15 08:58:21,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {4908#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {4908#(< ~counter~0 9)} is VALID [2022-04-15 08:58:21,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {4933#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4908#(< ~counter~0 9)} is VALID [2022-04-15 08:58:21,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 8)} assume !!(0 != ~r~0); {4933#(< ~counter~0 8)} is VALID [2022-04-15 08:58:21,996 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 8)} #94#return; {4933#(< ~counter~0 8)} is VALID [2022-04-15 08:58:21,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-15 08:58:21,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-15 08:58:21,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-15 08:58:21,996 INFO L272 TraceCheckUtils]: 19: Hoare triple {4933#(< ~counter~0 8)} 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)); {4695#true} is VALID [2022-04-15 08:58:21,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {4933#(< ~counter~0 8)} is VALID [2022-04-15 08:58:21,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {4958#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4933#(< ~counter~0 8)} is VALID [2022-04-15 08:58:21,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {4958#(< ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:21,997 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 7)} #92#return; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:21,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L272 TraceCheckUtils]: 11: Hoare triple {4958#(< ~counter~0 7)} 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)); {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 7)} #90#return; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:21,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-15 08:58:21,998 INFO L272 TraceCheckUtils]: 6: Hoare triple {4958#(< ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4695#true} is VALID [2022-04-15 08:58:21,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {4958#(< ~counter~0 7)} 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; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:21,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 7)} call #t~ret9 := main(); {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:21,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 7)} {4695#true} #102#return; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:22,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 7)} assume true; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:22,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {4695#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);~counter~0 := 0; {4958#(< ~counter~0 7)} is VALID [2022-04-15 08:58:22,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-15 08:58:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 08:58:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:22,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067168986] [2022-04-15 08:58:22,001 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:22,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907645493] [2022-04-15 08:58:22,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907645493] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:22,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:22,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 08:58:22,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:22,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866745213] [2022-04-15 08:58:22,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866745213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:22,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:22,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 08:58:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434965629] [2022-04-15 08:58:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-15 08:58:22,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:22,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:22,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:22,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 08:58:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:22,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 08:58:22,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 08:58:22,039 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:22,244 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-15 08:58:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 08:58:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-15 08:58:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 08:58:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 08:58:22,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 08:58:22,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:22,312 INFO L225 Difference]: With dead ends: 119 [2022-04-15 08:58:22,312 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 08:58:22,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:22,312 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:22,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 08:58:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 08:58:22,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:22,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:22,393 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:22,394 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:22,395 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 08:58:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 08:58:22,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:22,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:22,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-15 08:58:22,396 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-15 08:58:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:22,397 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 08:58:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 08:58:22,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:22,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:22,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:22,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 08:58:22,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-15 08:58:22,399 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-15 08:58:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:22,399 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-15 08:58:22,399 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 08:58:22,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-15 08:58:24,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 08:58:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 08:58:24,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:24,519 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:24,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:24,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 08:58:24,720 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 08:58:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546266719] [2022-04-15 08:58:24,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 08:58:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:24,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529749879] [2022-04-15 08:58:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:24,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:24,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355328407] [2022-04-15 08:58:24,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:24,734 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:24,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 08:58:24,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:24,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:24,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:58:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:24,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:25,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-15 08:58:25,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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);~counter~0 := 0; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {5590#(<= ~counter~0 0)} 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; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {5590#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {5590#(<= ~counter~0 0)} 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)); {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {5590#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5590#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:25,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {5590#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,075 INFO L272 TraceCheckUtils]: 19: Hoare triple {5639#(<= ~counter~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)); {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,076 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:25,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {5639#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {5664#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,078 INFO L272 TraceCheckUtils]: 27: Hoare triple {5664#(<= ~counter~0 2)} 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)); {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,079 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:25,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {5664#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,080 INFO L290 TraceCheckUtils]: 34: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,081 INFO L272 TraceCheckUtils]: 35: Hoare triple {5689#(<= ~counter~0 3)} 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)); {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,082 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:25,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {5689#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,084 INFO L272 TraceCheckUtils]: 43: Hoare triple {5714#(<= ~counter~0 4)} 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)); {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,085 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:25,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {5714#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5739#(<= |main_#t~post6| 4)} is VALID [2022-04-15 08:58:25,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {5583#false} is VALID [2022-04-15 08:58:25,086 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#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)); {5583#false} is VALID [2022-04-15 08:58:25,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-15 08:58:25,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-15 08:58:25,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-15 08:58:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:25,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:25,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-15 08:58:25,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-15 08:58:25,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-15 08:58:25,379 INFO L272 TraceCheckUtils]: 51: Hoare triple {5583#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)); {5583#false} is VALID [2022-04-15 08:58:25,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {5583#false} is VALID [2022-04-15 08:58:25,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {5771#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5767#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:58:25,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 10)} assume !(~r~0 < 0); {5771#(< ~counter~0 10)} is VALID [2022-04-15 08:58:25,381 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 10)} #98#return; {5771#(< ~counter~0 10)} is VALID [2022-04-15 08:58:25,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 08:58:25,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-15 08:58:25,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-15 08:58:25,381 INFO L272 TraceCheckUtils]: 43: Hoare triple {5771#(< ~counter~0 10)} 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)); {5582#true} is VALID [2022-04-15 08:58:25,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {5771#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {5771#(< ~counter~0 10)} is VALID [2022-04-15 08:58:25,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {5796#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5771#(< ~counter~0 10)} is VALID [2022-04-15 08:58:25,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {5796#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5796#(< ~counter~0 9)} is VALID [2022-04-15 08:58:25,383 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 9)} #98#return; {5796#(< ~counter~0 9)} is VALID [2022-04-15 08:58:25,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 08:58:25,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-15 08:58:25,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-15 08:58:25,383 INFO L272 TraceCheckUtils]: 35: Hoare triple {5796#(< ~counter~0 9)} 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)); {5582#true} is VALID [2022-04-15 08:58:25,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {5796#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {5796#(< ~counter~0 9)} is VALID [2022-04-15 08:58:25,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {5821#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5796#(< ~counter~0 9)} is VALID [2022-04-15 08:58:25,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 8)} assume !(~r~0 > 0); {5821#(< ~counter~0 8)} is VALID [2022-04-15 08:58:25,384 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 8)} #96#return; {5821#(< ~counter~0 8)} is VALID [2022-04-15 08:58:25,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 08:58:25,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-15 08:58:25,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-15 08:58:25,385 INFO L272 TraceCheckUtils]: 27: Hoare triple {5821#(< ~counter~0 8)} 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)); {5582#true} is VALID [2022-04-15 08:58:25,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {5821#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {5821#(< ~counter~0 8)} is VALID [2022-04-15 08:58:25,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {5846#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5821#(< ~counter~0 8)} is VALID [2022-04-15 08:58:25,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 7)} assume !!(0 != ~r~0); {5846#(< ~counter~0 7)} is VALID [2022-04-15 08:58:25,386 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 7)} #94#return; {5846#(< ~counter~0 7)} is VALID [2022-04-15 08:58:25,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 08:58:25,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-15 08:58:25,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-15 08:58:25,386 INFO L272 TraceCheckUtils]: 19: Hoare triple {5846#(< ~counter~0 7)} 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)); {5582#true} is VALID [2022-04-15 08:58:25,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {5846#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {5846#(< ~counter~0 7)} is VALID [2022-04-15 08:58:25,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 7)} is VALID [2022-04-15 08:58:25,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 6)} #92#return; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 08:58:25,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-15 08:58:25,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-15 08:58:25,388 INFO L272 TraceCheckUtils]: 11: Hoare triple {5871#(< ~counter~0 6)} 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)); {5582#true} is VALID [2022-04-15 08:58:25,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 6)} #90#return; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-15 08:58:25,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-15 08:58:25,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-15 08:58:25,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {5871#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#true} is VALID [2022-04-15 08:58:25,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {5871#(< ~counter~0 6)} 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; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 6)} call #t~ret9 := main(); {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 6)} {5582#true} #102#return; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 6)} assume true; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {5582#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);~counter~0 := 0; {5871#(< ~counter~0 6)} is VALID [2022-04-15 08:58:25,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-15 08:58:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 08:58:25,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529749879] [2022-04-15 08:58:25,391 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355328407] [2022-04-15 08:58:25,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355328407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:25,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:25,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 08:58:25,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:25,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546266719] [2022-04-15 08:58:25,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546266719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:25,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:25,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:58:25,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440116147] [2022-04-15 08:58:25,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 08:58:25,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:25,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:25,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:25,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:58:25,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:25,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:58:25,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:25,428 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:25,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:25,675 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-15 08:58:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 08:58:25,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 08:58:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 08:58:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 08:58:25,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 08:58:25,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:25,742 INFO L225 Difference]: With dead ends: 99 [2022-04-15 08:58:25,742 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 08:58:25,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 08:58:25,742 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:25,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 08:58:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-15 08:58:25,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:25,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:25,816 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:25,817 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:25,818 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 08:58:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 08:58:25,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:25,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:25,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-15 08:58:25,819 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-15 08:58:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:25,820 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 08:58:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 08:58:25,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:25,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:25,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:25,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-15 08:58:25,823 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-15 08:58:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:25,823 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-15 08:58:25,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:25,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-15 08:58:26,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-15 08:58:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 08:58:26,515 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:26,516 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:26,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 08:58:26,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 08:58:26,716 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 08:58:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:26,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1858803444] [2022-04-15 08:58:26,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:26,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 08:58:26,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:26,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912546990] [2022-04-15 08:58:26,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:26,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:26,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:26,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124581075] [2022-04-15 08:58:26,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:58:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:26,737 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:26,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 08:58:26,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:58:26,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:26,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:58:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:26,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:27,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-15 08:58:27,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#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);~counter~0 := 0; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {6503#(<= ~counter~0 0)} 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; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {6503#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,055 INFO L272 TraceCheckUtils]: 11: Hoare triple {6503#(<= ~counter~0 0)} 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)); {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,057 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {6503#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6503#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:27,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {6552#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {6552#(<= ~counter~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)); {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,060 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:27,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {6552#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {6577#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {6577#(<= ~counter~0 2)} 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)); {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,063 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:27,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,064 INFO L272 TraceCheckUtils]: 35: Hoare triple {6602#(<= ~counter~0 3)} 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)); {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,065 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {6602#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6602#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:27,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {6602#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {6627#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {6627#(<= ~counter~0 4)} 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)); {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,068 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {6627#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6627#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {6627#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6652#(<= |main_#t~post8| 4)} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 10);havoc #t~post8; {6496#false} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 10);havoc #t~post6; {6496#false} is VALID [2022-04-15 08:58:27,069 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#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)); {6496#false} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-15 08:58:27,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-15 08:58:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:27,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:27,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-15 08:58:27,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-15 08:58:27,333 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-15 08:58:27,333 INFO L272 TraceCheckUtils]: 53: Hoare triple {6496#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)); {6496#false} is VALID [2022-04-15 08:58:27,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 10);havoc #t~post6; {6496#false} is VALID [2022-04-15 08:58:27,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-15 08:58:27,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {6496#false} is VALID [2022-04-15 08:58:27,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {6696#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6692#(< |main_#t~post8| 10)} is VALID [2022-04-15 08:58:27,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {6696#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6696#(< ~counter~0 10)} is VALID [2022-04-15 08:58:27,334 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 10)} #98#return; {6696#(< ~counter~0 10)} is VALID [2022-04-15 08:58:27,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-15 08:58:27,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-15 08:58:27,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-15 08:58:27,335 INFO L272 TraceCheckUtils]: 43: Hoare triple {6696#(< ~counter~0 10)} 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)); {6495#true} is VALID [2022-04-15 08:58:27,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {6696#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {6696#(< ~counter~0 10)} is VALID [2022-04-15 08:58:27,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {6721#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6696#(< ~counter~0 10)} is VALID [2022-04-15 08:58:27,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {6721#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6721#(< ~counter~0 9)} is VALID [2022-04-15 08:58:27,336 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 9)} #98#return; {6721#(< ~counter~0 9)} is VALID [2022-04-15 08:58:27,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-15 08:58:27,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-15 08:58:27,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-15 08:58:27,336 INFO L272 TraceCheckUtils]: 35: Hoare triple {6721#(< ~counter~0 9)} 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)); {6495#true} is VALID [2022-04-15 08:58:27,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {6721#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {6721#(< ~counter~0 9)} is VALID [2022-04-15 08:58:27,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {6746#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6721#(< ~counter~0 9)} is VALID [2022-04-15 08:58:27,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 8)} assume !(~r~0 > 0); {6746#(< ~counter~0 8)} is VALID [2022-04-15 08:58:27,337 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 8)} #96#return; {6746#(< ~counter~0 8)} is VALID [2022-04-15 08:58:27,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-15 08:58:27,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-15 08:58:27,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-15 08:58:27,337 INFO L272 TraceCheckUtils]: 27: Hoare triple {6746#(< ~counter~0 8)} 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)); {6495#true} is VALID [2022-04-15 08:58:27,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {6746#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {6746#(< ~counter~0 8)} is VALID [2022-04-15 08:58:27,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {6771#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6746#(< ~counter~0 8)} is VALID [2022-04-15 08:58:27,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 7)} assume !!(0 != ~r~0); {6771#(< ~counter~0 7)} is VALID [2022-04-15 08:58:27,339 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 7)} #94#return; {6771#(< ~counter~0 7)} is VALID [2022-04-15 08:58:27,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-15 08:58:27,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-15 08:58:27,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-15 08:58:27,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {6771#(< ~counter~0 7)} 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)); {6495#true} is VALID [2022-04-15 08:58:27,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {6771#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {6771#(< ~counter~0 7)} is VALID [2022-04-15 08:58:27,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {6796#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6771#(< ~counter~0 7)} is VALID [2022-04-15 08:58:27,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {6796#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,340 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 6)} #92#return; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-15 08:58:27,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-15 08:58:27,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-15 08:58:27,340 INFO L272 TraceCheckUtils]: 11: Hoare triple {6796#(< ~counter~0 6)} 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)); {6495#true} is VALID [2022-04-15 08:58:27,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 6)} #90#return; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-15 08:58:27,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-15 08:58:27,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-15 08:58:27,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {6796#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6495#true} is VALID [2022-04-15 08:58:27,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {6796#(< ~counter~0 6)} 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; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 6)} call #t~ret9 := main(); {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 6)} {6495#true} #102#return; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 6)} assume true; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {6495#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);~counter~0 := 0; {6796#(< ~counter~0 6)} is VALID [2022-04-15 08:58:27,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-15 08:58:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 08:58:27,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912546990] [2022-04-15 08:58:27,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124581075] [2022-04-15 08:58:27,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124581075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:27,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:27,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 08:58:27,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:27,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1858803444] [2022-04-15 08:58:27,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1858803444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:27,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:27,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:58:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391099789] [2022-04-15 08:58:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-15 08:58:27,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:27,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:27,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:27,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:58:27,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:27,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:58:27,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:27,368 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:27,543 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-15 08:58:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 08:58:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-15 08:58:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 08:58:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 08:58:27,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 08:58:27,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:27,625 INFO L225 Difference]: With dead ends: 132 [2022-04-15 08:58:27,626 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 08:58:27,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-15 08:58:27,628 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:27,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 160 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 08:58:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-15 08:58:27,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:27,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:27,704 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:27,704 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:27,706 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 08:58:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 08:58:27,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:27,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:27,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-15 08:58:27,714 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-15 08:58:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:27,716 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 08:58:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 08:58:27,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:27,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:27,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:27,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-15 08:58:27,718 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-15 08:58:27,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:27,718 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-15 08:58:27,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:27,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-15 08:58:27,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 08:58:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 08:58:27,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:27,994 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:28,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:28,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 08:58:28,195 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 08:58:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:28,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730054091] [2022-04-15 08:58:28,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 08:58:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376579962] [2022-04-15 08:58:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:28,231 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [653406331] [2022-04-15 08:58:28,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:58:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:28,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:28,232 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:28,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 08:58:28,307 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 08:58:28,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:28,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 08:58:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:28,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:28,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-15 08:58:28,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#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);~counter~0 := 0; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {7504#(<= ~counter~0 0)} 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; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {7504#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,565 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {7504#(<= ~counter~0 0)} 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)); {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,567 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {7504#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7504#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:28,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {7504#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {7553#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,568 INFO L272 TraceCheckUtils]: 19: Hoare triple {7553#(<= ~counter~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)); {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,570 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:28,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {7553#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {7578#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {7578#(<= ~counter~0 2)} 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)); {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,572 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {7578#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7578#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:28,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {7578#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {7603#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,574 INFO L272 TraceCheckUtils]: 35: Hoare triple {7603#(<= ~counter~0 3)} 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)); {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,575 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {7603#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7603#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:28,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {7603#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {7628#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,576 INFO L272 TraceCheckUtils]: 43: Hoare triple {7628#(<= ~counter~0 4)} 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)); {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,577 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,578 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {7628#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7628#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:28,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7653#(<= |main_#t~post7| 4)} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 10);havoc #t~post8; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 10);havoc #t~post6; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#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)); {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-15 08:58:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:28,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:28,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-15 08:58:28,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-15 08:58:28,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L272 TraceCheckUtils]: 55: Hoare triple {7497#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)); {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 10);havoc #t~post6; {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 10);havoc #t~post8; {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {7497#false} is VALID [2022-04-15 08:58:28,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {7709#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7705#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:58:28,836 INFO L290 TraceCheckUtils]: 48: Hoare triple {7709#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7709#(< ~counter~0 10)} is VALID [2022-04-15 08:58:28,836 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 10)} #96#return; {7709#(< ~counter~0 10)} is VALID [2022-04-15 08:58:28,836 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-15 08:58:28,836 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-15 08:58:28,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-15 08:58:28,836 INFO L272 TraceCheckUtils]: 43: Hoare triple {7709#(< ~counter~0 10)} 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)); {7496#true} is VALID [2022-04-15 08:58:28,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {7709#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {7709#(< ~counter~0 10)} is VALID [2022-04-15 08:58:28,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {7734#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7709#(< ~counter~0 10)} is VALID [2022-04-15 08:58:28,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {7734#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7734#(< ~counter~0 9)} is VALID [2022-04-15 08:58:28,838 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 9)} #96#return; {7734#(< ~counter~0 9)} is VALID [2022-04-15 08:58:28,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-15 08:58:28,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-15 08:58:28,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-15 08:58:28,838 INFO L272 TraceCheckUtils]: 35: Hoare triple {7734#(< ~counter~0 9)} 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)); {7496#true} is VALID [2022-04-15 08:58:28,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {7734#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {7734#(< ~counter~0 9)} is VALID [2022-04-15 08:58:28,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {7759#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7734#(< ~counter~0 9)} is VALID [2022-04-15 08:58:28,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {7759#(< ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7759#(< ~counter~0 8)} is VALID [2022-04-15 08:58:28,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 8)} #96#return; {7759#(< ~counter~0 8)} is VALID [2022-04-15 08:58:28,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-15 08:58:28,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-15 08:58:28,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-15 08:58:28,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {7759#(< ~counter~0 8)} 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)); {7496#true} is VALID [2022-04-15 08:58:28,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {7759#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {7759#(< ~counter~0 8)} is VALID [2022-04-15 08:58:28,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {7784#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7759#(< ~counter~0 8)} is VALID [2022-04-15 08:58:28,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 7)} assume !!(0 != ~r~0); {7784#(< ~counter~0 7)} is VALID [2022-04-15 08:58:28,841 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 7)} #94#return; {7784#(< ~counter~0 7)} is VALID [2022-04-15 08:58:28,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-15 08:58:28,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-15 08:58:28,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-15 08:58:28,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {7784#(< ~counter~0 7)} 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)); {7496#true} is VALID [2022-04-15 08:58:28,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {7784#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {7784#(< ~counter~0 7)} is VALID [2022-04-15 08:58:28,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7784#(< ~counter~0 7)} is VALID [2022-04-15 08:58:28,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#(< ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 6)} #92#return; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-15 08:58:28,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-15 08:58:28,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-15 08:58:28,843 INFO L272 TraceCheckUtils]: 11: Hoare triple {7809#(< ~counter~0 6)} 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)); {7496#true} is VALID [2022-04-15 08:58:28,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 6)} #90#return; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-15 08:58:28,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-15 08:58:28,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-15 08:58:28,844 INFO L272 TraceCheckUtils]: 6: Hoare triple {7809#(< ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7496#true} is VALID [2022-04-15 08:58:28,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {7809#(< ~counter~0 6)} 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; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 6)} call #t~ret9 := main(); {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 6)} {7496#true} #102#return; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 6)} assume true; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#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);~counter~0 := 0; {7809#(< ~counter~0 6)} is VALID [2022-04-15 08:58:28,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-15 08:58:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 08:58:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376579962] [2022-04-15 08:58:28,846 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653406331] [2022-04-15 08:58:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653406331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:28,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 08:58:28,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:28,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730054091] [2022-04-15 08:58:28,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730054091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:28,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:28,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 08:58:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594327734] [2022-04-15 08:58:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 08:58:28,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:28,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:28,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:28,882 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 08:58:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 08:58:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:28,882 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:29,140 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-15 08:58:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 08:58:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 08:58:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 08:58:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 08:58:29,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 08:58:29,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:29,216 INFO L225 Difference]: With dead ends: 133 [2022-04-15 08:58:29,216 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 08:58:29,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-15 08:58:29,217 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:29,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:29,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 08:58:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-15 08:58:29,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:29,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:29,292 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:29,292 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:29,294 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 08:58:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 08:58:29,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:29,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:29,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-15 08:58:29,294 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-15 08:58:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:29,296 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 08:58:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 08:58:29,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:29,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:29,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:29,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 08:58:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-15 08:58:29,298 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-15 08:58:29,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:29,298 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-15 08:58:29,298 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 08:58:29,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-15 08:58:31,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 117 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 08:58:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 08:58:31,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:31,463 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:31,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 08:58:31,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 08:58:31,663 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 08:58:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:31,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494960639] [2022-04-15 08:58:31,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:31,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 08:58:31,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:31,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664381204] [2022-04-15 08:58:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:31,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:31,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:31,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180701352] [2022-04-15 08:58:31,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:58:31,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:31,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:31,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:31,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 08:58:31,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:58:31,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:31,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 08:58:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:31,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:32,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-15 08:58:32,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#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);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~counter~0 0)} 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; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,063 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~counter~0 0)} 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)); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,064 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8527#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:32,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {8576#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,066 INFO L272 TraceCheckUtils]: 19: Hoare triple {8576#(<= ~counter~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)); {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,067 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:32,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {8576#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {8601#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,068 INFO L272 TraceCheckUtils]: 27: Hoare triple {8601#(<= ~counter~0 2)} 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)); {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,070 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:32,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {8626#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,071 INFO L272 TraceCheckUtils]: 35: Hoare triple {8626#(<= ~counter~0 3)} 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)); {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,072 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {8626#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8626#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:32,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {8626#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {8651#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,074 INFO L272 TraceCheckUtils]: 43: Hoare triple {8651#(<= ~counter~0 4)} 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)); {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,075 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {8651#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {8651#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,076 INFO L272 TraceCheckUtils]: 51: Hoare triple {8676#(<= ~counter~0 5)} 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)); {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,077 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,078 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {8676#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8701#(<= |main_#t~post6| 5)} is VALID [2022-04-15 08:58:32,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-15 08:58:32,079 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#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)); {8520#false} is VALID [2022-04-15 08:58:32,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-15 08:58:32,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-15 08:58:32,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-15 08:58:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:32,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:32,363 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-15 08:58:32,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-15 08:58:32,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-15 08:58:32,364 INFO L272 TraceCheckUtils]: 59: Hoare triple {8520#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)); {8520#false} is VALID [2022-04-15 08:58:32,364 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-15 08:58:32,364 INFO L290 TraceCheckUtils]: 57: Hoare triple {8733#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8729#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:58:32,365 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 10)} assume !(~r~0 < 0); {8733#(< ~counter~0 10)} is VALID [2022-04-15 08:58:32,365 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 10)} #98#return; {8733#(< ~counter~0 10)} is VALID [2022-04-15 08:58:32,365 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,365 INFO L272 TraceCheckUtils]: 51: Hoare triple {8733#(< ~counter~0 10)} 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)); {8519#true} is VALID [2022-04-15 08:58:32,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {8733#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {8733#(< ~counter~0 10)} is VALID [2022-04-15 08:58:32,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {8758#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8733#(< ~counter~0 10)} is VALID [2022-04-15 08:58:32,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {8758#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8758#(< ~counter~0 9)} is VALID [2022-04-15 08:58:32,367 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 9)} #98#return; {8758#(< ~counter~0 9)} is VALID [2022-04-15 08:58:32,367 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,367 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,367 INFO L272 TraceCheckUtils]: 43: Hoare triple {8758#(< ~counter~0 9)} 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)); {8519#true} is VALID [2022-04-15 08:58:32,367 INFO L290 TraceCheckUtils]: 42: Hoare triple {8758#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {8758#(< ~counter~0 9)} is VALID [2022-04-15 08:58:32,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {8783#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8758#(< ~counter~0 9)} is VALID [2022-04-15 08:58:32,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {8783#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {8783#(< ~counter~0 8)} is VALID [2022-04-15 08:58:32,369 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 8)} #98#return; {8783#(< ~counter~0 8)} is VALID [2022-04-15 08:58:32,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,369 INFO L272 TraceCheckUtils]: 35: Hoare triple {8783#(< ~counter~0 8)} 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)); {8519#true} is VALID [2022-04-15 08:58:32,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {8783#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {8783#(< ~counter~0 8)} is VALID [2022-04-15 08:58:32,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {8808#(< ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8783#(< ~counter~0 8)} is VALID [2022-04-15 08:58:32,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 7)} assume !(~r~0 > 0); {8808#(< ~counter~0 7)} is VALID [2022-04-15 08:58:32,370 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 7)} #96#return; {8808#(< ~counter~0 7)} is VALID [2022-04-15 08:58:32,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,370 INFO L272 TraceCheckUtils]: 27: Hoare triple {8808#(< ~counter~0 7)} 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)); {8519#true} is VALID [2022-04-15 08:58:32,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {8808#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {8808#(< ~counter~0 7)} is VALID [2022-04-15 08:58:32,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {8676#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8808#(< ~counter~0 7)} is VALID [2022-04-15 08:58:32,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {8676#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,372 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8676#(<= ~counter~0 5)} #94#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,372 INFO L272 TraceCheckUtils]: 19: Hoare triple {8676#(<= ~counter~0 5)} 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)); {8519#true} is VALID [2022-04-15 08:58:32,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {8676#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {8651#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8676#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:32,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {8651#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,373 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8651#(<= ~counter~0 4)} #92#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L272 TraceCheckUtils]: 11: Hoare triple {8651#(<= ~counter~0 4)} 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)); {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8651#(<= ~counter~0 4)} #90#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-15 08:58:32,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {8651#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8519#true} is VALID [2022-04-15 08:58:32,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {8651#(<= ~counter~0 4)} 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; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {8651#(<= ~counter~0 4)} call #t~ret9 := main(); {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8651#(<= ~counter~0 4)} {8519#true} #102#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#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);~counter~0 := 0; {8651#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:32,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-15 08:58:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 08:58:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:32,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664381204] [2022-04-15 08:58:32,376 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:32,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180701352] [2022-04-15 08:58:32,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180701352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:32,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:32,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 08:58:32,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:32,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494960639] [2022-04-15 08:58:32,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494960639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:32,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:32,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:58:32,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112316598] [2022-04-15 08:58:32,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:32,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-15 08:58:32,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:32,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:32,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:32,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:58:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:32,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:58:32,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:32,424 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:32,735 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-15 08:58:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 08:58:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 63 [2022-04-15 08:58:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 08:58:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 08:58:32,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-15 08:58:32,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:32,817 INFO L225 Difference]: With dead ends: 116 [2022-04-15 08:58:32,817 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 08:58:32,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2022-04-15 08:58:32,818 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:32,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 08:58:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-15 08:58:32,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:32,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:32,904 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:32,904 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:32,906 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-15 08:58:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-15 08:58:32,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:32,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:32,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-15 08:58:32,907 INFO L87 Difference]: Start difference. First operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 111 states. [2022-04-15 08:58:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:32,909 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-15 08:58:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-15 08:58:32,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:32,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:32,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:32,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 78 states have internal predecessors, (91), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-15 08:58:32,911 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-15 08:58:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:32,911 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-15 08:58:32,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:32,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-15 08:58:35,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-15 08:58:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 08:58:35,177 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:35,177 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:35,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:35,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:35,377 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:35,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-15 08:58:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:35,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206384985] [2022-04-15 08:58:35,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-15 08:58:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:35,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878898146] [2022-04-15 08:58:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:35,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:35,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040790876] [2022-04-15 08:58:35,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:58:35,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:35,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:35,389 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:35,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 08:58:35,448 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 08:58:35,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:35,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 08:58:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:35,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:35,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {9580#true} call ULTIMATE.init(); {9580#true} is VALID [2022-04-15 08:58:35,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {9580#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);~counter~0 := 0; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9588#(<= ~counter~0 0)} {9580#true} #102#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {9588#(<= ~counter~0 0)} call #t~ret9 := main(); {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {9588#(<= ~counter~0 0)} 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; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {9588#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {9588#(<= ~counter~0 0)} ~cond := #in~cond; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {9588#(<= ~counter~0 0)} assume !(0 == ~cond); {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9588#(<= ~counter~0 0)} {9588#(<= ~counter~0 0)} #90#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,751 INFO L272 TraceCheckUtils]: 11: Hoare triple {9588#(<= ~counter~0 0)} 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)); {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {9588#(<= ~counter~0 0)} ~cond := #in~cond; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(<= ~counter~0 0)} assume !(0 == ~cond); {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9588#(<= ~counter~0 0)} {9588#(<= ~counter~0 0)} #92#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {9588#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9588#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:35,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {9588#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {9637#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {9637#(<= ~counter~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)); {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {9637#(<= ~counter~0 1)} ~cond := #in~cond; {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {9637#(<= ~counter~0 1)} assume !(0 == ~cond); {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {9637#(<= ~counter~0 1)} assume true; {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,755 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9637#(<= ~counter~0 1)} {9637#(<= ~counter~0 1)} #94#return; {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {9637#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9637#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:35,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {9637#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {9662#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,756 INFO L272 TraceCheckUtils]: 27: Hoare triple {9662#(<= ~counter~0 2)} 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)); {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {9662#(<= ~counter~0 2)} ~cond := #in~cond; {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {9662#(<= ~counter~0 2)} assume !(0 == ~cond); {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {9662#(<= ~counter~0 2)} assume true; {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,757 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9662#(<= ~counter~0 2)} {9662#(<= ~counter~0 2)} #96#return; {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {9662#(<= ~counter~0 2)} assume !(~r~0 > 0); {9662#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:35,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {9662#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {9687#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,759 INFO L272 TraceCheckUtils]: 35: Hoare triple {9687#(<= ~counter~0 3)} 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)); {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {9687#(<= ~counter~0 3)} ~cond := #in~cond; {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {9687#(<= ~counter~0 3)} assume !(0 == ~cond); {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {9687#(<= ~counter~0 3)} assume true; {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,760 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9687#(<= ~counter~0 3)} {9687#(<= ~counter~0 3)} #98#return; {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {9687#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9687#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:35,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {9687#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {9712#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,761 INFO L272 TraceCheckUtils]: 43: Hoare triple {9712#(<= ~counter~0 4)} 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)); {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {9712#(<= ~counter~0 4)} ~cond := #in~cond; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {9712#(<= ~counter~0 4)} assume !(0 == ~cond); {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {9712#(<= ~counter~0 4)} assume true; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,762 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9712#(<= ~counter~0 4)} {9712#(<= ~counter~0 4)} #98#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,763 INFO L290 TraceCheckUtils]: 48: Hoare triple {9712#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:35,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {9712#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {9737#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,764 INFO L272 TraceCheckUtils]: 51: Hoare triple {9737#(<= ~counter~0 5)} 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)); {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {9737#(<= ~counter~0 5)} ~cond := #in~cond; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {9737#(<= ~counter~0 5)} assume !(0 == ~cond); {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {9737#(<= ~counter~0 5)} assume true; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,765 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9737#(<= ~counter~0 5)} {9737#(<= ~counter~0 5)} #98#return; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {9737#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {9737#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9762#(<= |main_#t~post8| 5)} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {9762#(<= |main_#t~post8| 5)} assume !(#t~post8 < 10);havoc #t~post8; {9581#false} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {9581#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9581#false} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {9581#false} assume !(#t~post6 < 10);havoc #t~post6; {9581#false} is VALID [2022-04-15 08:58:35,766 INFO L272 TraceCheckUtils]: 61: Hoare triple {9581#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)); {9581#false} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 62: Hoare triple {9581#false} ~cond := #in~cond; {9581#false} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 63: Hoare triple {9581#false} assume 0 == ~cond; {9581#false} is VALID [2022-04-15 08:58:35,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {9581#false} assume !false; {9581#false} is VALID [2022-04-15 08:58:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:35,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:36,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {9581#false} assume !false; {9581#false} is VALID [2022-04-15 08:58:36,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {9581#false} assume 0 == ~cond; {9581#false} is VALID [2022-04-15 08:58:36,050 INFO L290 TraceCheckUtils]: 62: Hoare triple {9581#false} ~cond := #in~cond; {9581#false} is VALID [2022-04-15 08:58:36,051 INFO L272 TraceCheckUtils]: 61: Hoare triple {9581#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)); {9581#false} is VALID [2022-04-15 08:58:36,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {9581#false} assume !(#t~post6 < 10);havoc #t~post6; {9581#false} is VALID [2022-04-15 08:58:36,051 INFO L290 TraceCheckUtils]: 59: Hoare triple {9581#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9581#false} is VALID [2022-04-15 08:58:36,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {9802#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {9581#false} is VALID [2022-04-15 08:58:36,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {9806#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9802#(< |main_#t~post8| 10)} is VALID [2022-04-15 08:58:36,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {9806#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9806#(< ~counter~0 10)} is VALID [2022-04-15 08:58:36,052 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9580#true} {9806#(< ~counter~0 10)} #98#return; {9806#(< ~counter~0 10)} is VALID [2022-04-15 08:58:36,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,052 INFO L272 TraceCheckUtils]: 51: Hoare triple {9806#(< ~counter~0 10)} 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)); {9580#true} is VALID [2022-04-15 08:58:36,052 INFO L290 TraceCheckUtils]: 50: Hoare triple {9806#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {9806#(< ~counter~0 10)} is VALID [2022-04-15 08:58:36,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {9831#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9806#(< ~counter~0 10)} is VALID [2022-04-15 08:58:36,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {9831#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9831#(< ~counter~0 9)} is VALID [2022-04-15 08:58:36,054 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9580#true} {9831#(< ~counter~0 9)} #98#return; {9831#(< ~counter~0 9)} is VALID [2022-04-15 08:58:36,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,054 INFO L272 TraceCheckUtils]: 43: Hoare triple {9831#(< ~counter~0 9)} 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)); {9580#true} is VALID [2022-04-15 08:58:36,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {9831#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {9831#(< ~counter~0 9)} is VALID [2022-04-15 08:58:36,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {9856#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9831#(< ~counter~0 9)} is VALID [2022-04-15 08:58:36,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {9856#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9856#(< ~counter~0 8)} is VALID [2022-04-15 08:58:36,055 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9580#true} {9856#(< ~counter~0 8)} #98#return; {9856#(< ~counter~0 8)} is VALID [2022-04-15 08:58:36,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,056 INFO L272 TraceCheckUtils]: 35: Hoare triple {9856#(< ~counter~0 8)} 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)); {9580#true} is VALID [2022-04-15 08:58:36,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {9856#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {9856#(< ~counter~0 8)} is VALID [2022-04-15 08:58:36,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {9881#(< ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9856#(< ~counter~0 8)} is VALID [2022-04-15 08:58:36,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {9881#(< ~counter~0 7)} assume !(~r~0 > 0); {9881#(< ~counter~0 7)} is VALID [2022-04-15 08:58:36,057 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9580#true} {9881#(< ~counter~0 7)} #96#return; {9881#(< ~counter~0 7)} is VALID [2022-04-15 08:58:36,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,057 INFO L272 TraceCheckUtils]: 27: Hoare triple {9881#(< ~counter~0 7)} 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)); {9580#true} is VALID [2022-04-15 08:58:36,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {9881#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {9881#(< ~counter~0 7)} is VALID [2022-04-15 08:58:36,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {9737#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9881#(< ~counter~0 7)} is VALID [2022-04-15 08:58:36,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {9737#(<= ~counter~0 5)} assume !!(0 != ~r~0); {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:36,059 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9580#true} {9737#(<= ~counter~0 5)} #94#return; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:36,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {9737#(<= ~counter~0 5)} 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)); {9580#true} is VALID [2022-04-15 08:58:36,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {9737#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:36,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {9712#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9737#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:36,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {9712#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,060 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9580#true} {9712#(<= ~counter~0 4)} #92#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,061 INFO L272 TraceCheckUtils]: 11: Hoare triple {9712#(<= ~counter~0 4)} 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)); {9580#true} is VALID [2022-04-15 08:58:36,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9580#true} {9712#(<= ~counter~0 4)} #90#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-15 08:58:36,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-15 08:58:36,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-15 08:58:36,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {9712#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9580#true} is VALID [2022-04-15 08:58:36,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {9712#(<= ~counter~0 4)} 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; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {9712#(<= ~counter~0 4)} call #t~ret9 := main(); {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9712#(<= ~counter~0 4)} {9580#true} #102#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {9712#(<= ~counter~0 4)} assume true; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {9580#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);~counter~0 := 0; {9712#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:36,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {9580#true} call ULTIMATE.init(); {9580#true} is VALID [2022-04-15 08:58:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 08:58:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:36,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878898146] [2022-04-15 08:58:36,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:36,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040790876] [2022-04-15 08:58:36,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040790876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:36,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:36,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 08:58:36,064 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:36,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206384985] [2022-04-15 08:58:36,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206384985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:36,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:36,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:58:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708517026] [2022-04-15 08:58:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:36,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-15 08:58:36,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:36,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:36,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:36,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:58:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:58:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:36,105 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:36,461 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-15 08:58:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 08:58:36,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 65 [2022-04-15 08:58:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 08:58:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 08:58:36,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-15 08:58:36,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:36,554 INFO L225 Difference]: With dead ends: 149 [2022-04-15 08:58:36,554 INFO L226 Difference]: Without dead ends: 112 [2022-04-15 08:58:36,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-15 08:58:36,555 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:36,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-15 08:58:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-15 08:58:36,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:36,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:36,645 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:36,645 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:36,662 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-15 08:58:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-15 08:58:36,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:36,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:36,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-15 08:58:36,663 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 112 states. [2022-04-15 08:58:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:36,668 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-15 08:58:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-15 08:58:36,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:36,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:36,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:36,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 80 states have internal predecessors, (95), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-15 08:58:36,670 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-15 08:58:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:36,670 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-15 08:58:36,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:36,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-15 08:58:38,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 134 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-15 08:58:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 08:58:38,868 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:38,868 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:38,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:39,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 08:58:39,069 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-15 08:58:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:39,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [56935830] [2022-04-15 08:58:39,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-15 08:58:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:39,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477728591] [2022-04-15 08:58:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:39,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:39,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704013652] [2022-04-15 08:58:39,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:39,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:39,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:39,081 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:39,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 08:58:39,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:39,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:39,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 08:58:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:39,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:39,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-15 08:58:39,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#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);~counter~0 := 0; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#(<= ~counter~0 0)} {10729#true} #102#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#(<= ~counter~0 0)} call #t~ret9 := main(); {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {10737#(<= ~counter~0 0)} 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; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,401 INFO L272 TraceCheckUtils]: 6: Hoare triple {10737#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(<= ~counter~0 0)} ~cond := #in~cond; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#(<= ~counter~0 0)} assume !(0 == ~cond); {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,402 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#(<= ~counter~0 0)} {10737#(<= ~counter~0 0)} #90#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,402 INFO L272 TraceCheckUtils]: 11: Hoare triple {10737#(<= ~counter~0 0)} 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)); {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {10737#(<= ~counter~0 0)} ~cond := #in~cond; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {10737#(<= ~counter~0 0)} assume !(0 == ~cond); {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,403 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10737#(<= ~counter~0 0)} {10737#(<= ~counter~0 0)} #92#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {10737#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10737#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:39,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {10737#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {10786#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,405 INFO L272 TraceCheckUtils]: 19: Hoare triple {10786#(<= ~counter~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)); {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {10786#(<= ~counter~0 1)} ~cond := #in~cond; {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {10786#(<= ~counter~0 1)} assume !(0 == ~cond); {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {10786#(<= ~counter~0 1)} assume true; {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,406 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10786#(<= ~counter~0 1)} {10786#(<= ~counter~0 1)} #94#return; {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {10786#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10786#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:39,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {10786#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {10811#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,407 INFO L272 TraceCheckUtils]: 27: Hoare triple {10811#(<= ~counter~0 2)} 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)); {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {10811#(<= ~counter~0 2)} ~cond := #in~cond; {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {10811#(<= ~counter~0 2)} assume !(0 == ~cond); {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {10811#(<= ~counter~0 2)} assume true; {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10811#(<= ~counter~0 2)} {10811#(<= ~counter~0 2)} #96#return; {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {10811#(<= ~counter~0 2)} assume !(~r~0 > 0); {10811#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:39,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {10811#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {10836#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,409 INFO L272 TraceCheckUtils]: 35: Hoare triple {10836#(<= ~counter~0 3)} 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)); {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {10836#(<= ~counter~0 3)} ~cond := #in~cond; {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {10836#(<= ~counter~0 3)} assume !(0 == ~cond); {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {10836#(<= ~counter~0 3)} assume true; {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,411 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10836#(<= ~counter~0 3)} {10836#(<= ~counter~0 3)} #98#return; {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {10836#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10836#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:39,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {10836#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {10861#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,412 INFO L272 TraceCheckUtils]: 43: Hoare triple {10861#(<= ~counter~0 4)} 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)); {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {10861#(<= ~counter~0 4)} ~cond := #in~cond; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {10861#(<= ~counter~0 4)} assume !(0 == ~cond); {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {10861#(<= ~counter~0 4)} assume true; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,413 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10861#(<= ~counter~0 4)} {10861#(<= ~counter~0 4)} #98#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,413 INFO L290 TraceCheckUtils]: 48: Hoare triple {10861#(<= ~counter~0 4)} assume !(~r~0 < 0); {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,414 INFO L290 TraceCheckUtils]: 49: Hoare triple {10861#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,414 INFO L290 TraceCheckUtils]: 50: Hoare triple {10886#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,414 INFO L272 TraceCheckUtils]: 51: Hoare triple {10886#(<= ~counter~0 5)} 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)); {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {10886#(<= ~counter~0 5)} ~cond := #in~cond; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {10886#(<= ~counter~0 5)} assume !(0 == ~cond); {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,415 INFO L290 TraceCheckUtils]: 54: Hoare triple {10886#(<= ~counter~0 5)} assume true; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,416 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10886#(<= ~counter~0 5)} {10886#(<= ~counter~0 5)} #94#return; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {10886#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {10886#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10911#(<= |main_#t~post7| 5)} is VALID [2022-04-15 08:58:39,416 INFO L290 TraceCheckUtils]: 58: Hoare triple {10911#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {10730#false} is VALID [2022-04-15 08:58:39,416 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !(#t~post8 < 10);havoc #t~post8; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} assume !(#t~post6 < 10);havoc #t~post6; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L272 TraceCheckUtils]: 63: Hoare triple {10730#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)); {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-15 08:58:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:39,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L272 TraceCheckUtils]: 63: Hoare triple {10730#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)); {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} assume !(#t~post6 < 10);havoc #t~post6; {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !(#t~post8 < 10);havoc #t~post8; {10730#false} is VALID [2022-04-15 08:58:39,730 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10730#false} is VALID [2022-04-15 08:58:39,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {10963#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {10730#false} is VALID [2022-04-15 08:58:39,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {10967#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10963#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:58:39,731 INFO L290 TraceCheckUtils]: 56: Hoare triple {10967#(< ~counter~0 10)} assume !!(0 != ~r~0); {10967#(< ~counter~0 10)} is VALID [2022-04-15 08:58:39,732 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10729#true} {10967#(< ~counter~0 10)} #94#return; {10967#(< ~counter~0 10)} is VALID [2022-04-15 08:58:39,732 INFO L290 TraceCheckUtils]: 54: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,732 INFO L290 TraceCheckUtils]: 53: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,732 INFO L272 TraceCheckUtils]: 51: Hoare triple {10967#(< ~counter~0 10)} 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)); {10729#true} is VALID [2022-04-15 08:58:39,732 INFO L290 TraceCheckUtils]: 50: Hoare triple {10967#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {10967#(< ~counter~0 10)} is VALID [2022-04-15 08:58:39,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {10992#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10967#(< ~counter~0 10)} is VALID [2022-04-15 08:58:39,733 INFO L290 TraceCheckUtils]: 48: Hoare triple {10992#(< ~counter~0 9)} assume !(~r~0 < 0); {10992#(< ~counter~0 9)} is VALID [2022-04-15 08:58:39,734 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10729#true} {10992#(< ~counter~0 9)} #98#return; {10992#(< ~counter~0 9)} is VALID [2022-04-15 08:58:39,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,734 INFO L272 TraceCheckUtils]: 43: Hoare triple {10992#(< ~counter~0 9)} 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)); {10729#true} is VALID [2022-04-15 08:58:39,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {10992#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {10992#(< ~counter~0 9)} is VALID [2022-04-15 08:58:39,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {11017#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10992#(< ~counter~0 9)} is VALID [2022-04-15 08:58:39,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {11017#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11017#(< ~counter~0 8)} is VALID [2022-04-15 08:58:39,735 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10729#true} {11017#(< ~counter~0 8)} #98#return; {11017#(< ~counter~0 8)} is VALID [2022-04-15 08:58:39,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,736 INFO L272 TraceCheckUtils]: 35: Hoare triple {11017#(< ~counter~0 8)} 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)); {10729#true} is VALID [2022-04-15 08:58:39,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {11017#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {11017#(< ~counter~0 8)} is VALID [2022-04-15 08:58:39,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {11042#(< ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11017#(< ~counter~0 8)} is VALID [2022-04-15 08:58:39,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {11042#(< ~counter~0 7)} assume !(~r~0 > 0); {11042#(< ~counter~0 7)} is VALID [2022-04-15 08:58:39,737 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10729#true} {11042#(< ~counter~0 7)} #96#return; {11042#(< ~counter~0 7)} is VALID [2022-04-15 08:58:39,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,737 INFO L272 TraceCheckUtils]: 27: Hoare triple {11042#(< ~counter~0 7)} 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)); {10729#true} is VALID [2022-04-15 08:58:39,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {11042#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {11042#(< ~counter~0 7)} is VALID [2022-04-15 08:58:39,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {10886#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11042#(< ~counter~0 7)} is VALID [2022-04-15 08:58:39,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {10886#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,739 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10729#true} {10886#(<= ~counter~0 5)} #94#return; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,739 INFO L272 TraceCheckUtils]: 19: Hoare triple {10886#(<= ~counter~0 5)} 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)); {10729#true} is VALID [2022-04-15 08:58:39,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {10886#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {10861#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10886#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:39,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {10861#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10729#true} {10861#(<= ~counter~0 4)} #92#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,740 INFO L272 TraceCheckUtils]: 11: Hoare triple {10861#(<= ~counter~0 4)} 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)); {10729#true} is VALID [2022-04-15 08:58:39,741 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10729#true} {10861#(<= ~counter~0 4)} #90#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-15 08:58:39,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-15 08:58:39,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-15 08:58:39,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {10861#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10729#true} is VALID [2022-04-15 08:58:39,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {10861#(<= ~counter~0 4)} 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; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {10861#(<= ~counter~0 4)} call #t~ret9 := main(); {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10861#(<= ~counter~0 4)} {10729#true} #102#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {10861#(<= ~counter~0 4)} assume true; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {10729#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);~counter~0 := 0; {10861#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:39,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-15 08:58:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 08:58:39,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:39,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477728591] [2022-04-15 08:58:39,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:39,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704013652] [2022-04-15 08:58:39,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704013652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:39,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:39,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 08:58:39,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:39,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [56935830] [2022-04-15 08:58:39,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [56935830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:39,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:39,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 08:58:39,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358244368] [2022-04-15 08:58:39,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:39,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-15 08:58:39,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:39,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:39,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:39,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 08:58:39,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 08:58:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:39,789 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:40,153 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-15 08:58:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:58:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 67 [2022-04-15 08:58:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 08:58:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 08:58:40,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-15 08:58:40,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:40,278 INFO L225 Difference]: With dead ends: 151 [2022-04-15 08:58:40,278 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 08:58:40,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=187, Unknown=0, NotChecked=0, Total=306 [2022-04-15 08:58:40,279 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:40,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 151 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 08:58:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-15 08:58:40,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:40,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:40,374 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:40,374 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:40,376 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-15 08:58:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-15 08:58:40,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:40,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:40,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-15 08:58:40,376 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 114 states. [2022-04-15 08:58:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:40,378 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-15 08:58:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-15 08:58:40,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:40,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:40,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:40,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 21 states have call successors, (21), 10 states have call predecessors, (21), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 08:58:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-15 08:58:40,380 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-15 08:58:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:40,380 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-15 08:58:40,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 08:58:40,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-15 08:58:41,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-15 08:58:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 08:58:41,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:41,396 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:41,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:41,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 08:58:41,597 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:41,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-15 08:58:41,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:41,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1489733095] [2022-04-15 08:58:41,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-15 08:58:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:41,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550423874] [2022-04-15 08:58:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:41,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225544378] [2022-04-15 08:58:41,607 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:58:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:41,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:41,613 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:41,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 08:58:41,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 08:58:41,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:41,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 08:58:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:41,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:42,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {11910#true} call ULTIMATE.init(); {11910#true} is VALID [2022-04-15 08:58:42,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {11910#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);~counter~0 := 0; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11918#(<= ~counter~0 0)} {11910#true} #102#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {11918#(<= ~counter~0 0)} call #t~ret9 := main(); {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {11918#(<= ~counter~0 0)} 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; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {11918#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {11918#(<= ~counter~0 0)} ~cond := #in~cond; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {11918#(<= ~counter~0 0)} assume !(0 == ~cond); {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11918#(<= ~counter~0 0)} {11918#(<= ~counter~0 0)} #90#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {11918#(<= ~counter~0 0)} 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)); {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {11918#(<= ~counter~0 0)} ~cond := #in~cond; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {11918#(<= ~counter~0 0)} assume !(0 == ~cond); {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,020 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11918#(<= ~counter~0 0)} {11918#(<= ~counter~0 0)} #92#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {11918#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11918#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:42,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {11918#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {11967#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,021 INFO L272 TraceCheckUtils]: 19: Hoare triple {11967#(<= ~counter~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)); {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {11967#(<= ~counter~0 1)} ~cond := #in~cond; {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {11967#(<= ~counter~0 1)} assume !(0 == ~cond); {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {11967#(<= ~counter~0 1)} assume true; {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,022 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11967#(<= ~counter~0 1)} {11967#(<= ~counter~0 1)} #94#return; {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {11967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11967#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:42,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {11967#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {11992#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,024 INFO L272 TraceCheckUtils]: 27: Hoare triple {11992#(<= ~counter~0 2)} 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)); {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {11992#(<= ~counter~0 2)} ~cond := #in~cond; {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {11992#(<= ~counter~0 2)} assume !(0 == ~cond); {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {11992#(<= ~counter~0 2)} assume true; {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,025 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11992#(<= ~counter~0 2)} {11992#(<= ~counter~0 2)} #96#return; {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {11992#(<= ~counter~0 2)} assume !(~r~0 > 0); {11992#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:42,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {11992#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {12017#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,027 INFO L272 TraceCheckUtils]: 35: Hoare triple {12017#(<= ~counter~0 3)} 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)); {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {12017#(<= ~counter~0 3)} ~cond := #in~cond; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {12017#(<= ~counter~0 3)} assume !(0 == ~cond); {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {12017#(<= ~counter~0 3)} assume true; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,028 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12017#(<= ~counter~0 3)} {12017#(<= ~counter~0 3)} #98#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {12017#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {12017#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {12042#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,029 INFO L272 TraceCheckUtils]: 43: Hoare triple {12042#(<= ~counter~0 4)} 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)); {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {12042#(<= ~counter~0 4)} ~cond := #in~cond; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {12042#(<= ~counter~0 4)} assume !(0 == ~cond); {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {12042#(<= ~counter~0 4)} assume true; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,030 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12042#(<= ~counter~0 4)} {12042#(<= ~counter~0 4)} #98#return; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {12042#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {12042#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {12067#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,032 INFO L272 TraceCheckUtils]: 51: Hoare triple {12067#(<= ~counter~0 5)} 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)); {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {12067#(<= ~counter~0 5)} ~cond := #in~cond; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {12067#(<= ~counter~0 5)} assume !(0 == ~cond); {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {12067#(<= ~counter~0 5)} assume true; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,033 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12067#(<= ~counter~0 5)} {12067#(<= ~counter~0 5)} #98#return; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {12067#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {12067#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {12092#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,034 INFO L272 TraceCheckUtils]: 59: Hoare triple {12092#(<= ~counter~0 6)} 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)); {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,035 INFO L290 TraceCheckUtils]: 60: Hoare triple {12092#(<= ~counter~0 6)} ~cond := #in~cond; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,035 INFO L290 TraceCheckUtils]: 61: Hoare triple {12092#(<= ~counter~0 6)} assume !(0 == ~cond); {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,035 INFO L290 TraceCheckUtils]: 62: Hoare triple {12092#(<= ~counter~0 6)} assume true; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,036 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12092#(<= ~counter~0 6)} {12092#(<= ~counter~0 6)} #98#return; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,036 INFO L290 TraceCheckUtils]: 64: Hoare triple {12092#(<= ~counter~0 6)} assume !(~r~0 < 0); {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,036 INFO L290 TraceCheckUtils]: 65: Hoare triple {12092#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12117#(<= |main_#t~post6| 6)} is VALID [2022-04-15 08:58:42,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {12117#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {11911#false} is VALID [2022-04-15 08:58:42,037 INFO L272 TraceCheckUtils]: 67: Hoare triple {11911#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)); {11911#false} is VALID [2022-04-15 08:58:42,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {11911#false} ~cond := #in~cond; {11911#false} is VALID [2022-04-15 08:58:42,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {11911#false} assume 0 == ~cond; {11911#false} is VALID [2022-04-15 08:58:42,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-04-15 08:58:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:42,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:42,342 INFO L290 TraceCheckUtils]: 70: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-04-15 08:58:42,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {11911#false} assume 0 == ~cond; {11911#false} is VALID [2022-04-15 08:58:42,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {11911#false} ~cond := #in~cond; {11911#false} is VALID [2022-04-15 08:58:42,342 INFO L272 TraceCheckUtils]: 67: Hoare triple {11911#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)); {11911#false} is VALID [2022-04-15 08:58:42,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {12145#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {11911#false} is VALID [2022-04-15 08:58:42,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {12149#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12145#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:58:42,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {12149#(< ~counter~0 10)} assume !(~r~0 < 0); {12149#(< ~counter~0 10)} is VALID [2022-04-15 08:58:42,343 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11910#true} {12149#(< ~counter~0 10)} #98#return; {12149#(< ~counter~0 10)} is VALID [2022-04-15 08:58:42,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,344 INFO L290 TraceCheckUtils]: 60: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,344 INFO L272 TraceCheckUtils]: 59: Hoare triple {12149#(< ~counter~0 10)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {12149#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {12149#(< ~counter~0 10)} is VALID [2022-04-15 08:58:42,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {12174#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12149#(< ~counter~0 10)} is VALID [2022-04-15 08:58:42,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {12174#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12174#(< ~counter~0 9)} is VALID [2022-04-15 08:58:42,345 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11910#true} {12174#(< ~counter~0 9)} #98#return; {12174#(< ~counter~0 9)} is VALID [2022-04-15 08:58:42,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,345 INFO L272 TraceCheckUtils]: 51: Hoare triple {12174#(< ~counter~0 9)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,346 INFO L290 TraceCheckUtils]: 50: Hoare triple {12174#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {12174#(< ~counter~0 9)} is VALID [2022-04-15 08:58:42,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {12199#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12174#(< ~counter~0 9)} is VALID [2022-04-15 08:58:42,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {12199#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12199#(< ~counter~0 8)} is VALID [2022-04-15 08:58:42,347 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11910#true} {12199#(< ~counter~0 8)} #98#return; {12199#(< ~counter~0 8)} is VALID [2022-04-15 08:58:42,347 INFO L290 TraceCheckUtils]: 46: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,347 INFO L290 TraceCheckUtils]: 45: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,347 INFO L272 TraceCheckUtils]: 43: Hoare triple {12199#(< ~counter~0 8)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {12199#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {12199#(< ~counter~0 8)} is VALID [2022-04-15 08:58:42,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {12092#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12199#(< ~counter~0 8)} is VALID [2022-04-15 08:58:42,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {12092#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11910#true} {12092#(<= ~counter~0 6)} #98#return; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,349 INFO L290 TraceCheckUtils]: 36: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,349 INFO L272 TraceCheckUtils]: 35: Hoare triple {12092#(<= ~counter~0 6)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {12092#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {12067#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12092#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:42,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {12067#(<= ~counter~0 5)} assume !(~r~0 > 0); {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,350 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11910#true} {12067#(<= ~counter~0 5)} #96#return; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,350 INFO L272 TraceCheckUtils]: 27: Hoare triple {12067#(<= ~counter~0 5)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {12067#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {12042#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12067#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:42,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {12042#(<= ~counter~0 4)} assume !!(0 != ~r~0); {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,352 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11910#true} {12042#(<= ~counter~0 4)} #94#return; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,352 INFO L272 TraceCheckUtils]: 19: Hoare triple {12042#(<= ~counter~0 4)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {12042#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {12017#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12042#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:42,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {12017#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,353 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11910#true} {12017#(<= ~counter~0 3)} #92#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {12017#(<= ~counter~0 3)} 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)); {11910#true} is VALID [2022-04-15 08:58:42,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11910#true} {12017#(<= ~counter~0 3)} #90#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-15 08:58:42,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-15 08:58:42,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-15 08:58:42,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {12017#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11910#true} is VALID [2022-04-15 08:58:42,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {12017#(<= ~counter~0 3)} 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; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {12017#(<= ~counter~0 3)} call #t~ret9 := main(); {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12017#(<= ~counter~0 3)} {11910#true} #102#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {12017#(<= ~counter~0 3)} assume true; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {11910#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);~counter~0 := 0; {12017#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:42,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {11910#true} call ULTIMATE.init(); {11910#true} is VALID [2022-04-15 08:58:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 08:58:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:42,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550423874] [2022-04-15 08:58:42,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:42,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225544378] [2022-04-15 08:58:42,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225544378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:42,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:42,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 08:58:42,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:42,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1489733095] [2022-04-15 08:58:42,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1489733095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:42,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:42,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 08:58:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175503868] [2022-04-15 08:58:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-15 08:58:42,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:42,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:42,402 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-15 08:58:42,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 08:58:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 08:58:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:42,403 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:42,828 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-15 08:58:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 08:58:42,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 71 [2022-04-15 08:58:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:42,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 08:58:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 08:58:42,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-15 08:58:42,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:42,908 INFO L225 Difference]: With dead ends: 137 [2022-04-15 08:58:42,908 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 08:58:42,908 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-15 08:58:42,909 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 52 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:42,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 08:58:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-15 08:58:43,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:43,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 08:58:43,000 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 08:58:43,000 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 08:58:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:43,005 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-15 08:58:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-15 08:58:43,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:43,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:43,005 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-15 08:58:43,006 INFO L87 Difference]: Start difference. First operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 132 states. [2022-04-15 08:58:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:43,008 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-15 08:58:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-15 08:58:43,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:43,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:43,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:43,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 93 states have internal predecessors, (107), 25 states have call successors, (25), 11 states have call predecessors, (25), 9 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 08:58:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-15 08:58:43,010 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-15 08:58:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:43,012 INFO L478 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-15 08:58:43,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:43,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-15 08:58:44,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-15 08:58:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 08:58:44,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:44,438 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:44,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:44,641 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 08:58:44,642 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-15 08:58:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986355691] [2022-04-15 08:58:44,643 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-15 08:58:44,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:44,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695143007] [2022-04-15 08:58:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:44,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:44,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909733705] [2022-04-15 08:58:44,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:44,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:44,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:44,653 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:44,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 08:58:44,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:44,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:44,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 08:58:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:44,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:44,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {13143#true} call ULTIMATE.init(); {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {13143#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);~counter~0 := 0; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13143#true} {13143#true} #102#return; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {13143#true} call #t~ret9 := main(); {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {13143#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; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {13143#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13143#true} {13143#true} #90#return; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13143#true} {13143#true} #92#return; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {13143#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13143#true} is VALID [2022-04-15 08:58:44,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {13143#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {13143#true} assume !!(#t~post6 < 10);havoc #t~post6; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L272 TraceCheckUtils]: 19: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13143#true} {13143#true} #94#return; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {13143#true} assume !!(0 != ~r~0); {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {13143#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {13143#true} assume !!(#t~post7 < 10);havoc #t~post7; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13143#true} {13143#true} #96#return; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {13143#true} assume !(~r~0 > 0); {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {13143#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {13143#true} assume !!(#t~post8 < 10);havoc #t~post8; {13143#true} is VALID [2022-04-15 08:58:44,842 INFO L272 TraceCheckUtils]: 35: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-15 08:58:44,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,843 INFO L290 TraceCheckUtils]: 38: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,843 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13143#true} {13143#true} #98#return; {13143#true} is VALID [2022-04-15 08:58:44,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {13143#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {13143#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {13143#true} assume !!(#t~post8 < 10);havoc #t~post8; {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L272 TraceCheckUtils]: 43: Hoare triple {13143#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)); {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,859 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13143#true} {13143#true} #98#return; {13143#true} is VALID [2022-04-15 08:58:44,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {13143#true} assume !(~r~0 < 0); {13292#(not (< main_~r~0 0))} is VALID [2022-04-15 08:58:44,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {13292#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13292#(not (< main_~r~0 0))} is VALID [2022-04-15 08:58:44,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {13292#(not (< main_~r~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {13292#(not (< main_~r~0 0))} is VALID [2022-04-15 08:58:44,860 INFO L272 TraceCheckUtils]: 51: Hoare triple {13292#(not (< main_~r~0 0))} 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)); {13143#true} is VALID [2022-04-15 08:58:44,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,861 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13143#true} {13292#(not (< main_~r~0 0))} #94#return; {13292#(not (< main_~r~0 0))} is VALID [2022-04-15 08:58:44,861 INFO L290 TraceCheckUtils]: 56: Hoare triple {13292#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:58:44,861 INFO L290 TraceCheckUtils]: 57: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:58:44,861 INFO L290 TraceCheckUtils]: 58: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 10);havoc #t~post7; {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:58:44,861 INFO L272 TraceCheckUtils]: 59: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} 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)); {13143#true} is VALID [2022-04-15 08:58:44,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-15 08:58:44,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-15 08:58:44,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-15 08:58:44,862 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13143#true} {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {13317#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 65: Hoare triple {13144#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {13144#false} assume !(#t~post8 < 10);havoc #t~post8; {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {13144#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {13144#false} assume !(#t~post6 < 10);havoc #t~post6; {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L272 TraceCheckUtils]: 69: Hoare triple {13144#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)); {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {13144#false} ~cond := #in~cond; {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 71: Hoare triple {13144#false} assume 0 == ~cond; {13144#false} is VALID [2022-04-15 08:58:44,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {13144#false} assume !false; {13144#false} is VALID [2022-04-15 08:58:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-15 08:58:44,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:58:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:44,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695143007] [2022-04-15 08:58:44,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:44,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909733705] [2022-04-15 08:58:44,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909733705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:44,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:44,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:58:44,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:44,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986355691] [2022-04-15 08:58:44,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986355691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:44,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:44,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:58:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187042539] [2022-04-15 08:58:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-15 08:58:44,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:44,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:58:44,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:44,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:58:44,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:58:44,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:58:44,886 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:58:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:45,082 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-15 08:58:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:58:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-15 08:58:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:58:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 08:58:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:58:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 08:58:45,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 08:58:45,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:45,157 INFO L225 Difference]: With dead ends: 180 [2022-04-15 08:58:45,157 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 08:58:45,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:58:45,157 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:45,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:58:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 08:58:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-15 08:58:45,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:45,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:45,287 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:45,287 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:45,290 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-15 08:58:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-15 08:58:45,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:45,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:45,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-15 08:58:45,290 INFO L87 Difference]: Start difference. First operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-15 08:58:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:45,292 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-15 08:58:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-15 08:58:45,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:45,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:45,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:45,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 99 states have (on average 1.202020202020202) internal successors, (119), 102 states have internal predecessors, (119), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-15 08:58:45,295 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-15 08:58:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:45,295 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-15 08:58:45,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:58:45,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-15 08:58:47,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-15 08:58:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 08:58:47,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:47,589 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:47,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:47,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 08:58:47,805 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-15 08:58:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:47,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099115871] [2022-04-15 08:58:47,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-15 08:58:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:47,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520613989] [2022-04-15 08:58:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:47,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:47,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:47,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797148132] [2022-04-15 08:58:47,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:47,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:47,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:47,830 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:47,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 08:58:47,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:47,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:47,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 08:58:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:47,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:48,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {14285#true} call ULTIMATE.init(); {14285#true} is VALID [2022-04-15 08:58:48,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {14285#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);~counter~0 := 0; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14293#(<= ~counter~0 0)} {14285#true} #102#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {14293#(<= ~counter~0 0)} call #t~ret9 := main(); {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {14293#(<= ~counter~0 0)} 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; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {14293#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {14293#(<= ~counter~0 0)} ~cond := #in~cond; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {14293#(<= ~counter~0 0)} assume !(0 == ~cond); {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14293#(<= ~counter~0 0)} {14293#(<= ~counter~0 0)} #90#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,242 INFO L272 TraceCheckUtils]: 11: Hoare triple {14293#(<= ~counter~0 0)} 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)); {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {14293#(<= ~counter~0 0)} ~cond := #in~cond; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {14293#(<= ~counter~0 0)} assume !(0 == ~cond); {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,243 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14293#(<= ~counter~0 0)} {14293#(<= ~counter~0 0)} #92#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {14293#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14293#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:48,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {14293#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {14342#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,245 INFO L272 TraceCheckUtils]: 19: Hoare triple {14342#(<= ~counter~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)); {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {14342#(<= ~counter~0 1)} ~cond := #in~cond; {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {14342#(<= ~counter~0 1)} assume !(0 == ~cond); {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {14342#(<= ~counter~0 1)} assume true; {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,246 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14342#(<= ~counter~0 1)} {14342#(<= ~counter~0 1)} #94#return; {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {14342#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14342#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:48,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {14342#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {14367#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,247 INFO L272 TraceCheckUtils]: 27: Hoare triple {14367#(<= ~counter~0 2)} 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)); {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {14367#(<= ~counter~0 2)} ~cond := #in~cond; {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {14367#(<= ~counter~0 2)} assume !(0 == ~cond); {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {14367#(<= ~counter~0 2)} assume true; {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,249 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14367#(<= ~counter~0 2)} {14367#(<= ~counter~0 2)} #96#return; {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {14367#(<= ~counter~0 2)} assume !(~r~0 > 0); {14367#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:48,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {14367#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {14392#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,250 INFO L272 TraceCheckUtils]: 35: Hoare triple {14392#(<= ~counter~0 3)} 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)); {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {14392#(<= ~counter~0 3)} ~cond := #in~cond; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {14392#(<= ~counter~0 3)} assume !(0 == ~cond); {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {14392#(<= ~counter~0 3)} assume true; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,251 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14392#(<= ~counter~0 3)} {14392#(<= ~counter~0 3)} #98#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {14392#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {14392#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {14417#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,253 INFO L272 TraceCheckUtils]: 43: Hoare triple {14417#(<= ~counter~0 4)} 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)); {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {14417#(<= ~counter~0 4)} ~cond := #in~cond; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {14417#(<= ~counter~0 4)} assume !(0 == ~cond); {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {14417#(<= ~counter~0 4)} assume true; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,254 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14417#(<= ~counter~0 4)} {14417#(<= ~counter~0 4)} #98#return; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {14417#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {14417#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {14442#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,256 INFO L272 TraceCheckUtils]: 51: Hoare triple {14442#(<= ~counter~0 5)} 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)); {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {14442#(<= ~counter~0 5)} ~cond := #in~cond; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {14442#(<= ~counter~0 5)} assume !(0 == ~cond); {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,256 INFO L290 TraceCheckUtils]: 54: Hoare triple {14442#(<= ~counter~0 5)} assume true; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,257 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14442#(<= ~counter~0 5)} {14442#(<= ~counter~0 5)} #98#return; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {14442#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {14442#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {14467#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,258 INFO L272 TraceCheckUtils]: 59: Hoare triple {14467#(<= ~counter~0 6)} 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)); {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {14467#(<= ~counter~0 6)} ~cond := #in~cond; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {14467#(<= ~counter~0 6)} assume !(0 == ~cond); {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,259 INFO L290 TraceCheckUtils]: 62: Hoare triple {14467#(<= ~counter~0 6)} assume true; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,260 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14467#(<= ~counter~0 6)} {14467#(<= ~counter~0 6)} #98#return; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {14467#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {14467#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14492#(<= |main_#t~post8| 6)} is VALID [2022-04-15 08:58:48,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {14492#(<= |main_#t~post8| 6)} assume !(#t~post8 < 10);havoc #t~post8; {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L290 TraceCheckUtils]: 67: Hoare triple {14286#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {14286#false} assume !(#t~post6 < 10);havoc #t~post6; {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L272 TraceCheckUtils]: 69: Hoare triple {14286#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)); {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L290 TraceCheckUtils]: 70: Hoare triple {14286#false} ~cond := #in~cond; {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L290 TraceCheckUtils]: 71: Hoare triple {14286#false} assume 0 == ~cond; {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {14286#false} assume !false; {14286#false} is VALID [2022-04-15 08:58:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:48,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:48,586 INFO L290 TraceCheckUtils]: 72: Hoare triple {14286#false} assume !false; {14286#false} is VALID [2022-04-15 08:58:48,586 INFO L290 TraceCheckUtils]: 71: Hoare triple {14286#false} assume 0 == ~cond; {14286#false} is VALID [2022-04-15 08:58:48,586 INFO L290 TraceCheckUtils]: 70: Hoare triple {14286#false} ~cond := #in~cond; {14286#false} is VALID [2022-04-15 08:58:48,586 INFO L272 TraceCheckUtils]: 69: Hoare triple {14286#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)); {14286#false} is VALID [2022-04-15 08:58:48,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {14286#false} assume !(#t~post6 < 10);havoc #t~post6; {14286#false} is VALID [2022-04-15 08:58:48,586 INFO L290 TraceCheckUtils]: 67: Hoare triple {14286#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14286#false} is VALID [2022-04-15 08:58:48,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {14532#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {14286#false} is VALID [2022-04-15 08:58:48,587 INFO L290 TraceCheckUtils]: 65: Hoare triple {14536#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14532#(< |main_#t~post8| 10)} is VALID [2022-04-15 08:58:48,587 INFO L290 TraceCheckUtils]: 64: Hoare triple {14536#(< ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14536#(< ~counter~0 10)} is VALID [2022-04-15 08:58:48,587 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14285#true} {14536#(< ~counter~0 10)} #98#return; {14536#(< ~counter~0 10)} is VALID [2022-04-15 08:58:48,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,588 INFO L272 TraceCheckUtils]: 59: Hoare triple {14536#(< ~counter~0 10)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {14536#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {14536#(< ~counter~0 10)} is VALID [2022-04-15 08:58:48,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {14561#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14536#(< ~counter~0 10)} is VALID [2022-04-15 08:58:48,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {14561#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14561#(< ~counter~0 9)} is VALID [2022-04-15 08:58:48,589 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14285#true} {14561#(< ~counter~0 9)} #98#return; {14561#(< ~counter~0 9)} is VALID [2022-04-15 08:58:48,589 INFO L290 TraceCheckUtils]: 54: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,590 INFO L272 TraceCheckUtils]: 51: Hoare triple {14561#(< ~counter~0 9)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {14561#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {14561#(< ~counter~0 9)} is VALID [2022-04-15 08:58:48,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {14586#(< ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14561#(< ~counter~0 9)} is VALID [2022-04-15 08:58:48,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {14586#(< ~counter~0 8)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14586#(< ~counter~0 8)} is VALID [2022-04-15 08:58:48,601 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14285#true} {14586#(< ~counter~0 8)} #98#return; {14586#(< ~counter~0 8)} is VALID [2022-04-15 08:58:48,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,602 INFO L272 TraceCheckUtils]: 43: Hoare triple {14586#(< ~counter~0 8)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {14586#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {14586#(< ~counter~0 8)} is VALID [2022-04-15 08:58:48,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {14467#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14586#(< ~counter~0 8)} is VALID [2022-04-15 08:58:48,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {14467#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,603 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14285#true} {14467#(<= ~counter~0 6)} #98#return; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,603 INFO L272 TraceCheckUtils]: 35: Hoare triple {14467#(<= ~counter~0 6)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {14467#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {14442#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {14467#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:48,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {14442#(<= ~counter~0 5)} assume !(~r~0 > 0); {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,604 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14285#true} {14442#(<= ~counter~0 5)} #96#return; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,604 INFO L272 TraceCheckUtils]: 27: Hoare triple {14442#(<= ~counter~0 5)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {14442#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {14417#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14442#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:48,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {14417#(<= ~counter~0 4)} assume !!(0 != ~r~0); {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,605 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14285#true} {14417#(<= ~counter~0 4)} #94#return; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,606 INFO L272 TraceCheckUtils]: 19: Hoare triple {14417#(<= ~counter~0 4)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {14417#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {14392#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14417#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:48,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {14392#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,607 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14285#true} {14392#(<= ~counter~0 3)} #92#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,607 INFO L272 TraceCheckUtils]: 11: Hoare triple {14392#(<= ~counter~0 3)} 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)); {14285#true} is VALID [2022-04-15 08:58:48,607 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14285#true} {14392#(<= ~counter~0 3)} #90#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-15 08:58:48,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-15 08:58:48,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-15 08:58:48,608 INFO L272 TraceCheckUtils]: 6: Hoare triple {14392#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14285#true} is VALID [2022-04-15 08:58:48,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {14392#(<= ~counter~0 3)} 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; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {14392#(<= ~counter~0 3)} call #t~ret9 := main(); {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14392#(<= ~counter~0 3)} {14285#true} #102#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {14392#(<= ~counter~0 3)} assume true; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {14285#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);~counter~0 := 0; {14392#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:48,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {14285#true} call ULTIMATE.init(); {14285#true} is VALID [2022-04-15 08:58:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 08:58:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520613989] [2022-04-15 08:58:48,609 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797148132] [2022-04-15 08:58:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797148132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:48,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:48,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 08:58:48,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:48,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099115871] [2022-04-15 08:58:48,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099115871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:48,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:48,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 08:58:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389246983] [2022-04-15 08:58:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:48,610 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-15 08:58:48,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:48,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:48,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:48,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 08:58:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 08:58:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:48,644 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:49,089 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-15 08:58:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 08:58:49,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 73 [2022-04-15 08:58:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 08:58:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 08:58:49,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-15 08:58:49,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:49,199 INFO L225 Difference]: With dead ends: 193 [2022-04-15 08:58:49,199 INFO L226 Difference]: Without dead ends: 144 [2022-04-15 08:58:49,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2022-04-15 08:58:49,200 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 57 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:49,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-15 08:58:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-15 08:58:49,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:49,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:49,337 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:49,337 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:49,339 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-15 08:58:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-15 08:58:49,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:49,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:49,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-15 08:58:49,340 INFO L87 Difference]: Start difference. First operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 144 states. [2022-04-15 08:58:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:49,342 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-15 08:58:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-15 08:58:49,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:49,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:49,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:49,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.2058823529411764) internal successors, (123), 104 states have internal predecessors, (123), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-15 08:58:49,345 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-15 08:58:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:49,345 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-15 08:58:49,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:49,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-15 08:58:51,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:51,165 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-15 08:58:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 08:58:51,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:51,166 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:51,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:51,366 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:51,367 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:51,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-15 08:58:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:51,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545745906] [2022-04-15 08:58:51,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-15 08:58:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:51,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036516255] [2022-04-15 08:58:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:51,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:51,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250671079] [2022-04-15 08:58:51,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:51,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:51,379 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:51,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 08:58:51,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:51,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:51,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 08:58:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:51,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {15698#true} call ULTIMATE.init(); {15698#true} is VALID [2022-04-15 08:58:51,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {15698#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);~counter~0 := 0; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15706#(<= ~counter~0 0)} {15698#true} #102#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {15706#(<= ~counter~0 0)} call #t~ret9 := main(); {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {15706#(<= ~counter~0 0)} 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; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {15706#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {15706#(<= ~counter~0 0)} ~cond := #in~cond; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {15706#(<= ~counter~0 0)} assume !(0 == ~cond); {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15706#(<= ~counter~0 0)} {15706#(<= ~counter~0 0)} #90#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,652 INFO L272 TraceCheckUtils]: 11: Hoare triple {15706#(<= ~counter~0 0)} 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)); {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {15706#(<= ~counter~0 0)} ~cond := #in~cond; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {15706#(<= ~counter~0 0)} assume !(0 == ~cond); {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15706#(<= ~counter~0 0)} {15706#(<= ~counter~0 0)} #92#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {15706#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15706#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:51,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {15706#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {15755#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,654 INFO L272 TraceCheckUtils]: 19: Hoare triple {15755#(<= ~counter~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)); {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {15755#(<= ~counter~0 1)} ~cond := #in~cond; {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {15755#(<= ~counter~0 1)} assume !(0 == ~cond); {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {15755#(<= ~counter~0 1)} assume true; {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,655 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15755#(<= ~counter~0 1)} {15755#(<= ~counter~0 1)} #94#return; {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {15755#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15755#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:51,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {15755#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {15780#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,656 INFO L272 TraceCheckUtils]: 27: Hoare triple {15780#(<= ~counter~0 2)} 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)); {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {15780#(<= ~counter~0 2)} ~cond := #in~cond; {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {15780#(<= ~counter~0 2)} assume !(0 == ~cond); {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {15780#(<= ~counter~0 2)} assume true; {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,657 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15780#(<= ~counter~0 2)} {15780#(<= ~counter~0 2)} #96#return; {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {15780#(<= ~counter~0 2)} assume !(~r~0 > 0); {15780#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:51,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {15780#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,658 INFO L290 TraceCheckUtils]: 34: Hoare triple {15805#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,658 INFO L272 TraceCheckUtils]: 35: Hoare triple {15805#(<= ~counter~0 3)} 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)); {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {15805#(<= ~counter~0 3)} ~cond := #in~cond; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {15805#(<= ~counter~0 3)} assume !(0 == ~cond); {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,658 INFO L290 TraceCheckUtils]: 38: Hoare triple {15805#(<= ~counter~0 3)} assume true; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,659 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15805#(<= ~counter~0 3)} {15805#(<= ~counter~0 3)} #98#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {15805#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {15805#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {15830#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,660 INFO L272 TraceCheckUtils]: 43: Hoare triple {15830#(<= ~counter~0 4)} 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)); {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {15830#(<= ~counter~0 4)} ~cond := #in~cond; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {15830#(<= ~counter~0 4)} assume !(0 == ~cond); {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {15830#(<= ~counter~0 4)} assume true; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,661 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15830#(<= ~counter~0 4)} {15830#(<= ~counter~0 4)} #98#return; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {15830#(<= ~counter~0 4)} assume !(~r~0 < 0); {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {15830#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {15855#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,662 INFO L272 TraceCheckUtils]: 51: Hoare triple {15855#(<= ~counter~0 5)} 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)); {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {15855#(<= ~counter~0 5)} ~cond := #in~cond; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {15855#(<= ~counter~0 5)} assume !(0 == ~cond); {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {15855#(<= ~counter~0 5)} assume true; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,662 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15855#(<= ~counter~0 5)} {15855#(<= ~counter~0 5)} #94#return; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {15855#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {15855#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {15880#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,663 INFO L272 TraceCheckUtils]: 59: Hoare triple {15880#(<= ~counter~0 6)} 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)); {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {15880#(<= ~counter~0 6)} ~cond := #in~cond; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {15880#(<= ~counter~0 6)} assume !(0 == ~cond); {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {15880#(<= ~counter~0 6)} assume true; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,664 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15880#(<= ~counter~0 6)} {15880#(<= ~counter~0 6)} #96#return; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {15880#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {15880#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15905#(<= |main_#t~post7| 6)} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {15905#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {15699#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {15699#false} assume !(#t~post8 < 10);havoc #t~post8; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {15699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {15699#false} assume !(#t~post6 < 10);havoc #t~post6; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L272 TraceCheckUtils]: 71: Hoare triple {15699#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)); {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {15699#false} ~cond := #in~cond; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {15699#false} assume 0 == ~cond; {15699#false} is VALID [2022-04-15 08:58:51,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {15699#false} assume !false; {15699#false} is VALID [2022-04-15 08:58:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:51,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:51,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {15699#false} assume !false; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 73: Hoare triple {15699#false} assume 0 == ~cond; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {15699#false} ~cond := #in~cond; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L272 TraceCheckUtils]: 71: Hoare triple {15699#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)); {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 70: Hoare triple {15699#false} assume !(#t~post6 < 10);havoc #t~post6; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 69: Hoare triple {15699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 68: Hoare triple {15699#false} assume !(#t~post8 < 10);havoc #t~post8; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 67: Hoare triple {15699#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15699#false} is VALID [2022-04-15 08:58:51,943 INFO L290 TraceCheckUtils]: 66: Hoare triple {15957#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {15699#false} is VALID [2022-04-15 08:58:51,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {15961#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15957#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:58:51,944 INFO L290 TraceCheckUtils]: 64: Hoare triple {15961#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15961#(< ~counter~0 10)} is VALID [2022-04-15 08:58:51,944 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15698#true} {15961#(< ~counter~0 10)} #96#return; {15961#(< ~counter~0 10)} is VALID [2022-04-15 08:58:51,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,945 INFO L290 TraceCheckUtils]: 61: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,945 INFO L290 TraceCheckUtils]: 60: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,945 INFO L272 TraceCheckUtils]: 59: Hoare triple {15961#(< ~counter~0 10)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {15961#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {15961#(< ~counter~0 10)} is VALID [2022-04-15 08:58:51,946 INFO L290 TraceCheckUtils]: 57: Hoare triple {15986#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15961#(< ~counter~0 10)} is VALID [2022-04-15 08:58:51,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {15986#(< ~counter~0 9)} assume !!(0 != ~r~0); {15986#(< ~counter~0 9)} is VALID [2022-04-15 08:58:51,946 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15698#true} {15986#(< ~counter~0 9)} #94#return; {15986#(< ~counter~0 9)} is VALID [2022-04-15 08:58:51,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,947 INFO L272 TraceCheckUtils]: 51: Hoare triple {15986#(< ~counter~0 9)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {15986#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {15986#(< ~counter~0 9)} is VALID [2022-04-15 08:58:51,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {16011#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15986#(< ~counter~0 9)} is VALID [2022-04-15 08:58:51,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {16011#(< ~counter~0 8)} assume !(~r~0 < 0); {16011#(< ~counter~0 8)} is VALID [2022-04-15 08:58:51,948 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15698#true} {16011#(< ~counter~0 8)} #98#return; {16011#(< ~counter~0 8)} is VALID [2022-04-15 08:58:51,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,948 INFO L272 TraceCheckUtils]: 43: Hoare triple {16011#(< ~counter~0 8)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {16011#(< ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {16011#(< ~counter~0 8)} is VALID [2022-04-15 08:58:51,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {15880#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16011#(< ~counter~0 8)} is VALID [2022-04-15 08:58:51,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {15880#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,950 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15698#true} {15880#(<= ~counter~0 6)} #98#return; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,950 INFO L272 TraceCheckUtils]: 35: Hoare triple {15880#(<= ~counter~0 6)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {15880#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {15855#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15880#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:51,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {15855#(<= ~counter~0 5)} assume !(~r~0 > 0); {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,952 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15698#true} {15855#(<= ~counter~0 5)} #96#return; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,952 INFO L272 TraceCheckUtils]: 27: Hoare triple {15855#(<= ~counter~0 5)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {15855#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {15830#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15855#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:51,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {15830#(<= ~counter~0 4)} assume !!(0 != ~r~0); {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15698#true} {15830#(<= ~counter~0 4)} #94#return; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {15830#(<= ~counter~0 4)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {15830#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {15805#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15830#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:51,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {15805#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,955 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15698#true} {15805#(<= ~counter~0 3)} #92#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,955 INFO L272 TraceCheckUtils]: 11: Hoare triple {15805#(<= ~counter~0 3)} 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)); {15698#true} is VALID [2022-04-15 08:58:51,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15698#true} {15805#(<= ~counter~0 3)} #90#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-15 08:58:51,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-15 08:58:51,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-15 08:58:51,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {15805#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15698#true} is VALID [2022-04-15 08:58:51,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {15805#(<= ~counter~0 3)} 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; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {15805#(<= ~counter~0 3)} call #t~ret9 := main(); {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15805#(<= ~counter~0 3)} {15698#true} #102#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {15805#(<= ~counter~0 3)} assume true; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {15698#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);~counter~0 := 0; {15805#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:51,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {15698#true} call ULTIMATE.init(); {15698#true} is VALID [2022-04-15 08:58:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 08:58:51,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:51,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036516255] [2022-04-15 08:58:51,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:51,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250671079] [2022-04-15 08:58:51,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250671079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:51,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:51,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-15 08:58:51,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:51,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545745906] [2022-04-15 08:58:51,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545745906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:51,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:51,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 08:58:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905614206] [2022-04-15 08:58:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:51,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-15 08:58:51,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:51,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:52,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:52,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 08:58:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 08:58:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:52,008 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:52,403 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-15 08:58:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 08:58:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 75 [2022-04-15 08:58:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 08:58:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 08:58:52,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-15 08:58:52,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:52,524 INFO L225 Difference]: With dead ends: 195 [2022-04-15 08:58:52,524 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 08:58:52,524 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-15 08:58:52,525 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:52,525 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 08:58:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-15 08:58:52,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:52,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:52,655 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:52,655 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:52,657 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-15 08:58:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-15 08:58:52,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:52,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:52,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-15 08:58:52,658 INFO L87 Difference]: Start difference. First operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 146 states. [2022-04-15 08:58:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:52,660 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-15 08:58:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-15 08:58:52,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:52,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:52,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:52,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 108 states have internal predecessors, (129), 28 states have call successors, (28), 11 states have call predecessors, (28), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 08:58:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-15 08:58:52,662 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-15 08:58:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:52,662 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-15 08:58:52,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 9 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 08:58:52,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-15 08:58:54,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 182 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-15 08:58:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 08:58:54,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:54,957 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:54,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:55,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:55,173 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-15 08:58:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:55,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376696747] [2022-04-15 08:58:55,174 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:55,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-15 08:58:55,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:55,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371964992] [2022-04-15 08:58:55,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:55,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:55,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:55,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562078031] [2022-04-15 08:58:55,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:55,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:55,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:55,185 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:55,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 08:58:55,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:55,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:55,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 08:58:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:55,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:55,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {17145#true} call ULTIMATE.init(); {17145#true} is VALID [2022-04-15 08:58:55,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {17145#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);~counter~0 := 0; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17153#(<= ~counter~0 0)} {17145#true} #102#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {17153#(<= ~counter~0 0)} call #t~ret9 := main(); {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {17153#(<= ~counter~0 0)} 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; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {17153#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {17153#(<= ~counter~0 0)} ~cond := #in~cond; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {17153#(<= ~counter~0 0)} assume !(0 == ~cond); {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17153#(<= ~counter~0 0)} {17153#(<= ~counter~0 0)} #90#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,482 INFO L272 TraceCheckUtils]: 11: Hoare triple {17153#(<= ~counter~0 0)} 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)); {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {17153#(<= ~counter~0 0)} ~cond := #in~cond; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {17153#(<= ~counter~0 0)} assume !(0 == ~cond); {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,482 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17153#(<= ~counter~0 0)} {17153#(<= ~counter~0 0)} #92#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {17153#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17153#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:55,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {17153#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {17202#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,483 INFO L272 TraceCheckUtils]: 19: Hoare triple {17202#(<= ~counter~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)); {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {17202#(<= ~counter~0 1)} ~cond := #in~cond; {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {17202#(<= ~counter~0 1)} assume !(0 == ~cond); {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {17202#(<= ~counter~0 1)} assume true; {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,484 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17202#(<= ~counter~0 1)} {17202#(<= ~counter~0 1)} #94#return; {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {17202#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17202#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:55,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {17202#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {17227#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,485 INFO L272 TraceCheckUtils]: 27: Hoare triple {17227#(<= ~counter~0 2)} 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)); {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {17227#(<= ~counter~0 2)} ~cond := #in~cond; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {17227#(<= ~counter~0 2)} assume !(0 == ~cond); {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {17227#(<= ~counter~0 2)} assume true; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,486 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17227#(<= ~counter~0 2)} {17227#(<= ~counter~0 2)} #96#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {17227#(<= ~counter~0 2)} assume !(~r~0 > 0); {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {17227#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {17252#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,487 INFO L272 TraceCheckUtils]: 35: Hoare triple {17252#(<= ~counter~0 3)} 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)); {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {17252#(<= ~counter~0 3)} ~cond := #in~cond; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {17252#(<= ~counter~0 3)} assume !(0 == ~cond); {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {17252#(<= ~counter~0 3)} assume true; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,488 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17252#(<= ~counter~0 3)} {17252#(<= ~counter~0 3)} #98#return; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {17252#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {17252#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {17277#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,489 INFO L272 TraceCheckUtils]: 43: Hoare triple {17277#(<= ~counter~0 4)} 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)); {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {17277#(<= ~counter~0 4)} ~cond := #in~cond; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {17277#(<= ~counter~0 4)} assume !(0 == ~cond); {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {17277#(<= ~counter~0 4)} assume true; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,490 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17277#(<= ~counter~0 4)} {17277#(<= ~counter~0 4)} #98#return; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {17277#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {17277#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {17302#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,491 INFO L272 TraceCheckUtils]: 51: Hoare triple {17302#(<= ~counter~0 5)} 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)); {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {17302#(<= ~counter~0 5)} ~cond := #in~cond; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {17302#(<= ~counter~0 5)} assume !(0 == ~cond); {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {17302#(<= ~counter~0 5)} assume true; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,492 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17302#(<= ~counter~0 5)} {17302#(<= ~counter~0 5)} #98#return; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {17302#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {17302#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {17327#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,493 INFO L272 TraceCheckUtils]: 59: Hoare triple {17327#(<= ~counter~0 6)} 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)); {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,493 INFO L290 TraceCheckUtils]: 60: Hoare triple {17327#(<= ~counter~0 6)} ~cond := #in~cond; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {17327#(<= ~counter~0 6)} assume !(0 == ~cond); {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {17327#(<= ~counter~0 6)} assume true; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,494 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17327#(<= ~counter~0 6)} {17327#(<= ~counter~0 6)} #98#return; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,494 INFO L290 TraceCheckUtils]: 64: Hoare triple {17327#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {17327#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {17352#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,495 INFO L272 TraceCheckUtils]: 67: Hoare triple {17352#(<= ~counter~0 7)} 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)); {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,495 INFO L290 TraceCheckUtils]: 68: Hoare triple {17352#(<= ~counter~0 7)} ~cond := #in~cond; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,495 INFO L290 TraceCheckUtils]: 69: Hoare triple {17352#(<= ~counter~0 7)} assume !(0 == ~cond); {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {17352#(<= ~counter~0 7)} assume true; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,496 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17352#(<= ~counter~0 7)} {17352#(<= ~counter~0 7)} #98#return; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {17352#(<= ~counter~0 7)} assume !(~r~0 < 0); {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {17352#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17377#(<= |main_#t~post6| 7)} is VALID [2022-04-15 08:58:55,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {17377#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {17146#false} is VALID [2022-04-15 08:58:55,496 INFO L272 TraceCheckUtils]: 75: Hoare triple {17146#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)); {17146#false} is VALID [2022-04-15 08:58:55,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {17146#false} ~cond := #in~cond; {17146#false} is VALID [2022-04-15 08:58:55,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {17146#false} assume 0 == ~cond; {17146#false} is VALID [2022-04-15 08:58:55,496 INFO L290 TraceCheckUtils]: 78: Hoare triple {17146#false} assume !false; {17146#false} is VALID [2022-04-15 08:58:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:55,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:55,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {17146#false} assume !false; {17146#false} is VALID [2022-04-15 08:58:55,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {17146#false} assume 0 == ~cond; {17146#false} is VALID [2022-04-15 08:58:55,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {17146#false} ~cond := #in~cond; {17146#false} is VALID [2022-04-15 08:58:55,725 INFO L272 TraceCheckUtils]: 75: Hoare triple {17146#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)); {17146#false} is VALID [2022-04-15 08:58:55,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {17405#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {17146#false} is VALID [2022-04-15 08:58:55,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {17409#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17405#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:58:55,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {17409#(< ~counter~0 10)} assume !(~r~0 < 0); {17409#(< ~counter~0 10)} is VALID [2022-04-15 08:58:55,726 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17145#true} {17409#(< ~counter~0 10)} #98#return; {17409#(< ~counter~0 10)} is VALID [2022-04-15 08:58:55,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,726 INFO L272 TraceCheckUtils]: 67: Hoare triple {17409#(< ~counter~0 10)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {17409#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {17409#(< ~counter~0 10)} is VALID [2022-04-15 08:58:55,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {17434#(< ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17409#(< ~counter~0 10)} is VALID [2022-04-15 08:58:55,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {17434#(< ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17434#(< ~counter~0 9)} is VALID [2022-04-15 08:58:55,727 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17145#true} {17434#(< ~counter~0 9)} #98#return; {17434#(< ~counter~0 9)} is VALID [2022-04-15 08:58:55,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,727 INFO L272 TraceCheckUtils]: 59: Hoare triple {17434#(< ~counter~0 9)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {17434#(< ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {17434#(< ~counter~0 9)} is VALID [2022-04-15 08:58:55,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {17352#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17434#(< ~counter~0 9)} is VALID [2022-04-15 08:58:55,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {17352#(<= ~counter~0 7)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,728 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17145#true} {17352#(<= ~counter~0 7)} #98#return; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,729 INFO L272 TraceCheckUtils]: 51: Hoare triple {17352#(<= ~counter~0 7)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {17352#(<= ~counter~0 7)} assume !!(#t~post8 < 10);havoc #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {17327#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17352#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:55,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {17327#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,730 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17145#true} {17327#(<= ~counter~0 6)} #98#return; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,730 INFO L272 TraceCheckUtils]: 43: Hoare triple {17327#(<= ~counter~0 6)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {17327#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {17302#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17327#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:55,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {17302#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,731 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17145#true} {17302#(<= ~counter~0 5)} #98#return; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,731 INFO L272 TraceCheckUtils]: 35: Hoare triple {17302#(<= ~counter~0 5)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {17302#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {17277#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17302#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:55,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {17277#(<= ~counter~0 4)} assume !(~r~0 > 0); {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,732 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17145#true} {17277#(<= ~counter~0 4)} #96#return; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,732 INFO L272 TraceCheckUtils]: 27: Hoare triple {17277#(<= ~counter~0 4)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {17277#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {17252#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17277#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:55,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {17252#(<= ~counter~0 3)} assume !!(0 != ~r~0); {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,733 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17145#true} {17252#(<= ~counter~0 3)} #94#return; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {17252#(<= ~counter~0 3)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {17252#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {17227#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17252#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:55,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {17227#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17145#true} {17227#(<= ~counter~0 2)} #92#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {17227#(<= ~counter~0 2)} 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)); {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17145#true} {17227#(<= ~counter~0 2)} #90#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L272 TraceCheckUtils]: 6: Hoare triple {17227#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17145#true} is VALID [2022-04-15 08:58:55,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {17227#(<= ~counter~0 2)} 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; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {17227#(<= ~counter~0 2)} call #t~ret9 := main(); {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17227#(<= ~counter~0 2)} {17145#true} #102#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {17227#(<= ~counter~0 2)} assume true; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {17145#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);~counter~0 := 0; {17227#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:55,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {17145#true} call ULTIMATE.init(); {17145#true} is VALID [2022-04-15 08:58:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 08:58:55,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:55,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371964992] [2022-04-15 08:58:55,740 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:55,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562078031] [2022-04-15 08:58:55,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562078031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:55,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:55,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-15 08:58:55,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:55,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376696747] [2022-04-15 08:58:55,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376696747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:55,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:55,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 08:58:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29531532] [2022-04-15 08:58:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-15 08:58:55,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:55,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:55,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:55,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 08:58:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:55,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 08:58:55,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:55,776 INFO L87 Difference]: Start difference. First operand 146 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:56,179 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-15 08:58:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 08:58:56,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 79 [2022-04-15 08:58:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 08:58:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 08:58:56,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-15 08:58:56,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:56,251 INFO L225 Difference]: With dead ends: 168 [2022-04-15 08:58:56,251 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 08:58:56,251 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-15 08:58:56,252 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 83 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:56,252 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 08:58:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-15 08:58:56,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:56,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:56,355 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:56,355 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:56,358 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 08:58:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 08:58:56,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:56,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:56,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-15 08:58:56,358 INFO L87 Difference]: Start difference. First operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 163 states. [2022-04-15 08:58:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:56,361 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 08:58:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 08:58:56,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:56,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:56,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:56,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 117 states have internal predecessors, (136), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-15 08:58:56,364 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-15 08:58:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:56,364 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-15 08:58:56,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:56,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-15 08:58:57,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-15 08:58:57,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 08:58:57,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:57,880 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:58:57,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 08:58:58,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:58,087 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:58,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-15 08:58:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:58,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2003656659] [2022-04-15 08:58:58,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-15 08:58:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:58,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284057491] [2022-04-15 08:58:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:58,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:58,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504341516] [2022-04-15 08:58:58,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:58:58,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:58,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:58,101 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:58,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 08:58:58,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:58:58,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:58:58,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 08:58:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:58:58,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:58:58,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {18616#true} call ULTIMATE.init(); {18616#true} is VALID [2022-04-15 08:58:58,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {18616#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);~counter~0 := 0; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18624#(<= ~counter~0 0)} {18616#true} #102#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {18624#(<= ~counter~0 0)} call #t~ret9 := main(); {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {18624#(<= ~counter~0 0)} 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; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,403 INFO L272 TraceCheckUtils]: 6: Hoare triple {18624#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {18624#(<= ~counter~0 0)} ~cond := #in~cond; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {18624#(<= ~counter~0 0)} assume !(0 == ~cond); {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,403 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18624#(<= ~counter~0 0)} {18624#(<= ~counter~0 0)} #90#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,404 INFO L272 TraceCheckUtils]: 11: Hoare triple {18624#(<= ~counter~0 0)} 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)); {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {18624#(<= ~counter~0 0)} ~cond := #in~cond; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {18624#(<= ~counter~0 0)} assume !(0 == ~cond); {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18624#(<= ~counter~0 0)} {18624#(<= ~counter~0 0)} #92#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {18624#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18624#(<= ~counter~0 0)} is VALID [2022-04-15 08:58:58,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {18624#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {18673#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,406 INFO L272 TraceCheckUtils]: 19: Hoare triple {18673#(<= ~counter~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)); {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {18673#(<= ~counter~0 1)} ~cond := #in~cond; {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {18673#(<= ~counter~0 1)} assume !(0 == ~cond); {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {18673#(<= ~counter~0 1)} assume true; {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,406 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18673#(<= ~counter~0 1)} {18673#(<= ~counter~0 1)} #94#return; {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {18673#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18673#(<= ~counter~0 1)} is VALID [2022-04-15 08:58:58,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {18673#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {18698#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,407 INFO L272 TraceCheckUtils]: 27: Hoare triple {18698#(<= ~counter~0 2)} 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)); {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {18698#(<= ~counter~0 2)} ~cond := #in~cond; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {18698#(<= ~counter~0 2)} assume !(0 == ~cond); {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {18698#(<= ~counter~0 2)} assume true; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18698#(<= ~counter~0 2)} {18698#(<= ~counter~0 2)} #96#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {18698#(<= ~counter~0 2)} assume !(~r~0 > 0); {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,409 INFO L290 TraceCheckUtils]: 33: Hoare triple {18698#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {18723#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,409 INFO L272 TraceCheckUtils]: 35: Hoare triple {18723#(<= ~counter~0 3)} 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)); {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {18723#(<= ~counter~0 3)} ~cond := #in~cond; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {18723#(<= ~counter~0 3)} assume !(0 == ~cond); {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {18723#(<= ~counter~0 3)} assume true; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,410 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18723#(<= ~counter~0 3)} {18723#(<= ~counter~0 3)} #98#return; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {18723#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {18723#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {18748#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,411 INFO L272 TraceCheckUtils]: 43: Hoare triple {18748#(<= ~counter~0 4)} 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)); {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {18748#(<= ~counter~0 4)} ~cond := #in~cond; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {18748#(<= ~counter~0 4)} assume !(0 == ~cond); {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {18748#(<= ~counter~0 4)} assume true; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,412 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18748#(<= ~counter~0 4)} {18748#(<= ~counter~0 4)} #98#return; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {18748#(<= ~counter~0 4)} assume !(~r~0 < 0); {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {18748#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {18773#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,413 INFO L272 TraceCheckUtils]: 51: Hoare triple {18773#(<= ~counter~0 5)} 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)); {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {18773#(<= ~counter~0 5)} ~cond := #in~cond; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {18773#(<= ~counter~0 5)} assume !(0 == ~cond); {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {18773#(<= ~counter~0 5)} assume true; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,414 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18773#(<= ~counter~0 5)} {18773#(<= ~counter~0 5)} #94#return; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {18773#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {18773#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,414 INFO L290 TraceCheckUtils]: 58: Hoare triple {18798#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,415 INFO L272 TraceCheckUtils]: 59: Hoare triple {18798#(<= ~counter~0 6)} 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)); {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {18798#(<= ~counter~0 6)} ~cond := #in~cond; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {18798#(<= ~counter~0 6)} assume !(0 == ~cond); {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {18798#(<= ~counter~0 6)} assume true; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,417 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18798#(<= ~counter~0 6)} {18798#(<= ~counter~0 6)} #96#return; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {18798#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {18798#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {18823#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,418 INFO L272 TraceCheckUtils]: 67: Hoare triple {18823#(<= ~counter~0 7)} 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)); {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,419 INFO L290 TraceCheckUtils]: 68: Hoare triple {18823#(<= ~counter~0 7)} ~cond := #in~cond; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,419 INFO L290 TraceCheckUtils]: 69: Hoare triple {18823#(<= ~counter~0 7)} assume !(0 == ~cond); {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {18823#(<= ~counter~0 7)} assume true; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,419 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18823#(<= ~counter~0 7)} {18823#(<= ~counter~0 7)} #96#return; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,419 INFO L290 TraceCheckUtils]: 72: Hoare triple {18823#(<= ~counter~0 7)} assume !(~r~0 > 0); {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {18823#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18848#(<= |main_#t~post8| 7)} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {18848#(<= |main_#t~post8| 7)} assume !(#t~post8 < 10);havoc #t~post8; {18617#false} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {18617#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#false} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {18617#false} assume !(#t~post6 < 10);havoc #t~post6; {18617#false} is VALID [2022-04-15 08:58:58,420 INFO L272 TraceCheckUtils]: 77: Hoare triple {18617#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)); {18617#false} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {18617#false} ~cond := #in~cond; {18617#false} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 79: Hoare triple {18617#false} assume 0 == ~cond; {18617#false} is VALID [2022-04-15 08:58:58,420 INFO L290 TraceCheckUtils]: 80: Hoare triple {18617#false} assume !false; {18617#false} is VALID [2022-04-15 08:58:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:58:58,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:58:58,652 INFO L290 TraceCheckUtils]: 80: Hoare triple {18617#false} assume !false; {18617#false} is VALID [2022-04-15 08:58:58,652 INFO L290 TraceCheckUtils]: 79: Hoare triple {18617#false} assume 0 == ~cond; {18617#false} is VALID [2022-04-15 08:58:58,652 INFO L290 TraceCheckUtils]: 78: Hoare triple {18617#false} ~cond := #in~cond; {18617#false} is VALID [2022-04-15 08:58:58,652 INFO L272 TraceCheckUtils]: 77: Hoare triple {18617#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)); {18617#false} is VALID [2022-04-15 08:58:58,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {18617#false} assume !(#t~post6 < 10);havoc #t~post6; {18617#false} is VALID [2022-04-15 08:58:58,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {18617#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#false} is VALID [2022-04-15 08:58:58,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {18888#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {18617#false} is VALID [2022-04-15 08:58:58,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {18892#(< ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18888#(< |main_#t~post8| 10)} is VALID [2022-04-15 08:58:58,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {18892#(< ~counter~0 10)} assume !(~r~0 > 0); {18892#(< ~counter~0 10)} is VALID [2022-04-15 08:58:58,653 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18616#true} {18892#(< ~counter~0 10)} #96#return; {18892#(< ~counter~0 10)} is VALID [2022-04-15 08:58:58,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,654 INFO L290 TraceCheckUtils]: 68: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,654 INFO L272 TraceCheckUtils]: 67: Hoare triple {18892#(< ~counter~0 10)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {18892#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {18892#(< ~counter~0 10)} is VALID [2022-04-15 08:58:58,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {18917#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18892#(< ~counter~0 10)} is VALID [2022-04-15 08:58:58,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {18917#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18917#(< ~counter~0 9)} is VALID [2022-04-15 08:58:58,655 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18616#true} {18917#(< ~counter~0 9)} #96#return; {18917#(< ~counter~0 9)} is VALID [2022-04-15 08:58:58,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,656 INFO L272 TraceCheckUtils]: 59: Hoare triple {18917#(< ~counter~0 9)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {18917#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {18917#(< ~counter~0 9)} is VALID [2022-04-15 08:58:58,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {18823#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18917#(< ~counter~0 9)} is VALID [2022-04-15 08:58:58,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {18823#(<= ~counter~0 7)} assume !!(0 != ~r~0); {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,657 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18616#true} {18823#(<= ~counter~0 7)} #94#return; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,657 INFO L272 TraceCheckUtils]: 51: Hoare triple {18823#(<= ~counter~0 7)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {18823#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {18798#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18823#(<= ~counter~0 7)} is VALID [2022-04-15 08:58:58,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {18798#(<= ~counter~0 6)} assume !(~r~0 < 0); {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,658 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18616#true} {18798#(<= ~counter~0 6)} #98#return; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,658 INFO L272 TraceCheckUtils]: 43: Hoare triple {18798#(<= ~counter~0 6)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {18798#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,659 INFO L290 TraceCheckUtils]: 41: Hoare triple {18773#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18798#(<= ~counter~0 6)} is VALID [2022-04-15 08:58:58,659 INFO L290 TraceCheckUtils]: 40: Hoare triple {18773#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,659 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18616#true} {18773#(<= ~counter~0 5)} #98#return; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,659 INFO L272 TraceCheckUtils]: 35: Hoare triple {18773#(<= ~counter~0 5)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {18773#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {18748#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18773#(<= ~counter~0 5)} is VALID [2022-04-15 08:58:58,660 INFO L290 TraceCheckUtils]: 32: Hoare triple {18748#(<= ~counter~0 4)} assume !(~r~0 > 0); {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,660 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18616#true} {18748#(<= ~counter~0 4)} #96#return; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,661 INFO L272 TraceCheckUtils]: 27: Hoare triple {18748#(<= ~counter~0 4)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {18748#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {18723#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18748#(<= ~counter~0 4)} is VALID [2022-04-15 08:58:58,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {18723#(<= ~counter~0 3)} assume !!(0 != ~r~0); {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,662 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18616#true} {18723#(<= ~counter~0 3)} #94#return; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,662 INFO L272 TraceCheckUtils]: 19: Hoare triple {18723#(<= ~counter~0 3)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {18723#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {18698#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18723#(<= ~counter~0 3)} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {18698#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,663 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18616#true} {18698#(<= ~counter~0 2)} #92#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L272 TraceCheckUtils]: 11: Hoare triple {18698#(<= ~counter~0 2)} 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)); {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18616#true} {18698#(<= ~counter~0 2)} #90#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-15 08:58:58,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {18698#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {18616#true} is VALID [2022-04-15 08:58:58,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {18698#(<= ~counter~0 2)} 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; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {18698#(<= ~counter~0 2)} call #t~ret9 := main(); {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18698#(<= ~counter~0 2)} {18616#true} #102#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {18698#(<= ~counter~0 2)} assume true; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {18616#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);~counter~0 := 0; {18698#(<= ~counter~0 2)} is VALID [2022-04-15 08:58:58,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {18616#true} call ULTIMATE.init(); {18616#true} is VALID [2022-04-15 08:58:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 08:58:58,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:58:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284057491] [2022-04-15 08:58:58,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:58:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504341516] [2022-04-15 08:58:58,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504341516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:58:58,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:58:58,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-15 08:58:58,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:58:58,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2003656659] [2022-04-15 08:58:58,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2003656659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:58:58,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:58:58,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 08:58:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759127024] [2022-04-15 08:58:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:58:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-15 08:58:58,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:58:58,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:58,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:58,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 08:58:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 08:58:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:58:58,706 INFO L87 Difference]: Start difference. First operand 157 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:59,090 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-15 08:58:59,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 08:58:59,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 81 [2022-04-15 08:58:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:58:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 08:58:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 08:58:59,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-15 08:58:59,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:59,181 INFO L225 Difference]: With dead ends: 213 [2022-04-15 08:58:59,181 INFO L226 Difference]: Without dead ends: 164 [2022-04-15 08:58:59,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-04-15 08:58:59,182 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 81 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:58:59,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 206 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:58:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-15 08:58:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-15 08:58:59,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:58:59,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:59,333 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:59,333 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:59,335 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-15 08:58:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-15 08:58:59,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:59,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:59,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-15 08:58:59,336 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 164 states. [2022-04-15 08:58:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:58:59,338 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-15 08:58:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-15 08:58:59,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:58:59,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:58:59,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:58:59,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:58:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.1965811965811965) internal successors, (140), 119 states have internal predecessors, (140), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:58:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-15 08:58:59,341 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-15 08:58:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:58:59,341 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-15 08:58:59,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:58:59,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-15 08:58:59,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:58:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-15 08:58:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 08:58:59,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:58:59,731 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-15 08:58:59,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 08:58:59,932 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:59,932 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:58:59,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:58:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-15 08:58:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:58:59,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640366849] [2022-04-15 08:58:59,933 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:58:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-15 08:58:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:58:59,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173183766] [2022-04-15 08:58:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:58:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:58:59,945 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:58:59,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1992481408] [2022-04-15 08:58:59,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:58:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:58:59,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:58:59,946 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:58:59,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 08:59:00,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:59:00,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:00,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 08:59:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:00,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:00,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {20199#true} call ULTIMATE.init(); {20199#true} is VALID [2022-04-15 08:59:00,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {20199#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);~counter~0 := 0; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20207#(<= ~counter~0 0)} {20199#true} #102#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {20207#(<= ~counter~0 0)} call #t~ret9 := main(); {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {20207#(<= ~counter~0 0)} 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; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,438 INFO L272 TraceCheckUtils]: 6: Hoare triple {20207#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {20207#(<= ~counter~0 0)} ~cond := #in~cond; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {20207#(<= ~counter~0 0)} assume !(0 == ~cond); {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,439 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20207#(<= ~counter~0 0)} {20207#(<= ~counter~0 0)} #90#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,439 INFO L272 TraceCheckUtils]: 11: Hoare triple {20207#(<= ~counter~0 0)} 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)); {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {20207#(<= ~counter~0 0)} ~cond := #in~cond; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {20207#(<= ~counter~0 0)} assume !(0 == ~cond); {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,441 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20207#(<= ~counter~0 0)} {20207#(<= ~counter~0 0)} #92#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {20207#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20207#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:00,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {20207#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {20256#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,442 INFO L272 TraceCheckUtils]: 19: Hoare triple {20256#(<= ~counter~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)); {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {20256#(<= ~counter~0 1)} ~cond := #in~cond; {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {20256#(<= ~counter~0 1)} assume !(0 == ~cond); {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {20256#(<= ~counter~0 1)} assume true; {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,444 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20256#(<= ~counter~0 1)} {20256#(<= ~counter~0 1)} #94#return; {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {20256#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20256#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:00,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {20256#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {20281#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,445 INFO L272 TraceCheckUtils]: 27: Hoare triple {20281#(<= ~counter~0 2)} 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)); {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {20281#(<= ~counter~0 2)} ~cond := #in~cond; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {20281#(<= ~counter~0 2)} assume !(0 == ~cond); {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {20281#(<= ~counter~0 2)} assume true; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,446 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20281#(<= ~counter~0 2)} {20281#(<= ~counter~0 2)} #96#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {20281#(<= ~counter~0 2)} assume !(~r~0 > 0); {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {20281#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {20306#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,448 INFO L272 TraceCheckUtils]: 35: Hoare triple {20306#(<= ~counter~0 3)} 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)); {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {20306#(<= ~counter~0 3)} ~cond := #in~cond; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {20306#(<= ~counter~0 3)} assume !(0 == ~cond); {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,449 INFO L290 TraceCheckUtils]: 38: Hoare triple {20306#(<= ~counter~0 3)} assume true; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,449 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20306#(<= ~counter~0 3)} {20306#(<= ~counter~0 3)} #98#return; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {20306#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {20306#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {20331#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,451 INFO L272 TraceCheckUtils]: 43: Hoare triple {20331#(<= ~counter~0 4)} 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)); {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {20331#(<= ~counter~0 4)} ~cond := #in~cond; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {20331#(<= ~counter~0 4)} assume !(0 == ~cond); {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {20331#(<= ~counter~0 4)} assume true; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,452 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20331#(<= ~counter~0 4)} {20331#(<= ~counter~0 4)} #98#return; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {20331#(<= ~counter~0 4)} assume !(~r~0 < 0); {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {20331#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {20356#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,453 INFO L272 TraceCheckUtils]: 51: Hoare triple {20356#(<= ~counter~0 5)} 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)); {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {20356#(<= ~counter~0 5)} ~cond := #in~cond; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {20356#(<= ~counter~0 5)} assume !(0 == ~cond); {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {20356#(<= ~counter~0 5)} assume true; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,455 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20356#(<= ~counter~0 5)} {20356#(<= ~counter~0 5)} #94#return; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,455 INFO L290 TraceCheckUtils]: 56: Hoare triple {20356#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {20356#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {20381#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,456 INFO L272 TraceCheckUtils]: 59: Hoare triple {20381#(<= ~counter~0 6)} 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)); {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,457 INFO L290 TraceCheckUtils]: 60: Hoare triple {20381#(<= ~counter~0 6)} ~cond := #in~cond; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {20381#(<= ~counter~0 6)} assume !(0 == ~cond); {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {20381#(<= ~counter~0 6)} assume true; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,458 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20381#(<= ~counter~0 6)} {20381#(<= ~counter~0 6)} #96#return; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,458 INFO L290 TraceCheckUtils]: 64: Hoare triple {20381#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,458 INFO L290 TraceCheckUtils]: 65: Hoare triple {20381#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {20406#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,459 INFO L272 TraceCheckUtils]: 67: Hoare triple {20406#(<= ~counter~0 7)} 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)); {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {20406#(<= ~counter~0 7)} ~cond := #in~cond; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,460 INFO L290 TraceCheckUtils]: 69: Hoare triple {20406#(<= ~counter~0 7)} assume !(0 == ~cond); {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,460 INFO L290 TraceCheckUtils]: 70: Hoare triple {20406#(<= ~counter~0 7)} assume true; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,460 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20406#(<= ~counter~0 7)} {20406#(<= ~counter~0 7)} #96#return; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,461 INFO L290 TraceCheckUtils]: 72: Hoare triple {20406#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,461 INFO L290 TraceCheckUtils]: 73: Hoare triple {20406#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20431#(<= |main_#t~post7| 7)} is VALID [2022-04-15 08:59:00,461 INFO L290 TraceCheckUtils]: 74: Hoare triple {20431#(<= |main_#t~post7| 7)} assume !(#t~post7 < 10);havoc #t~post7; {20200#false} is VALID [2022-04-15 08:59:00,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {20200#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20200#false} is VALID [2022-04-15 08:59:00,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {20200#false} assume !(#t~post8 < 10);havoc #t~post8; {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L290 TraceCheckUtils]: 77: Hoare triple {20200#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {20200#false} assume !(#t~post6 < 10);havoc #t~post6; {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L272 TraceCheckUtils]: 79: Hoare triple {20200#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)); {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {20200#false} ~cond := #in~cond; {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L290 TraceCheckUtils]: 81: Hoare triple {20200#false} assume 0 == ~cond; {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L290 TraceCheckUtils]: 82: Hoare triple {20200#false} assume !false; {20200#false} is VALID [2022-04-15 08:59:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:59:00,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:00,819 INFO L290 TraceCheckUtils]: 82: Hoare triple {20200#false} assume !false; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 81: Hoare triple {20200#false} assume 0 == ~cond; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 80: Hoare triple {20200#false} ~cond := #in~cond; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L272 TraceCheckUtils]: 79: Hoare triple {20200#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)); {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 78: Hoare triple {20200#false} assume !(#t~post6 < 10);havoc #t~post6; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {20200#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {20200#false} assume !(#t~post8 < 10);havoc #t~post8; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {20200#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20200#false} is VALID [2022-04-15 08:59:00,820 INFO L290 TraceCheckUtils]: 74: Hoare triple {20483#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {20200#false} is VALID [2022-04-15 08:59:00,821 INFO L290 TraceCheckUtils]: 73: Hoare triple {20487#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20483#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:59:00,821 INFO L290 TraceCheckUtils]: 72: Hoare triple {20487#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20487#(< ~counter~0 10)} is VALID [2022-04-15 08:59:00,821 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20199#true} {20487#(< ~counter~0 10)} #96#return; {20487#(< ~counter~0 10)} is VALID [2022-04-15 08:59:00,821 INFO L290 TraceCheckUtils]: 70: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,822 INFO L272 TraceCheckUtils]: 67: Hoare triple {20487#(< ~counter~0 10)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {20487#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {20487#(< ~counter~0 10)} is VALID [2022-04-15 08:59:00,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {20512#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20487#(< ~counter~0 10)} is VALID [2022-04-15 08:59:00,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {20512#(< ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20512#(< ~counter~0 9)} is VALID [2022-04-15 08:59:00,823 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20199#true} {20512#(< ~counter~0 9)} #96#return; {20512#(< ~counter~0 9)} is VALID [2022-04-15 08:59:00,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,824 INFO L272 TraceCheckUtils]: 59: Hoare triple {20512#(< ~counter~0 9)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {20512#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {20512#(< ~counter~0 9)} is VALID [2022-04-15 08:59:00,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {20406#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20512#(< ~counter~0 9)} is VALID [2022-04-15 08:59:00,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {20406#(<= ~counter~0 7)} assume !!(0 != ~r~0); {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,825 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20199#true} {20406#(<= ~counter~0 7)} #94#return; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,825 INFO L272 TraceCheckUtils]: 51: Hoare triple {20406#(<= ~counter~0 7)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {20406#(<= ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {20381#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20406#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:00,826 INFO L290 TraceCheckUtils]: 48: Hoare triple {20381#(<= ~counter~0 6)} assume !(~r~0 < 0); {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,827 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20199#true} {20381#(<= ~counter~0 6)} #98#return; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,827 INFO L272 TraceCheckUtils]: 43: Hoare triple {20381#(<= ~counter~0 6)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {20381#(<= ~counter~0 6)} assume !!(#t~post8 < 10);havoc #t~post8; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {20356#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20381#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:00,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {20356#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,829 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20199#true} {20356#(<= ~counter~0 5)} #98#return; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,829 INFO L272 TraceCheckUtils]: 35: Hoare triple {20356#(<= ~counter~0 5)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {20356#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {20331#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20356#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:00,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {20331#(<= ~counter~0 4)} assume !(~r~0 > 0); {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,830 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20199#true} {20331#(<= ~counter~0 4)} #96#return; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,831 INFO L272 TraceCheckUtils]: 27: Hoare triple {20331#(<= ~counter~0 4)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {20331#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {20306#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20331#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:00,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {20306#(<= ~counter~0 3)} assume !!(0 != ~r~0); {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,843 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20199#true} {20306#(<= ~counter~0 3)} #94#return; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,843 INFO L272 TraceCheckUtils]: 19: Hoare triple {20306#(<= ~counter~0 3)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {20306#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {20281#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20306#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:00,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {20281#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,845 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20199#true} {20281#(<= ~counter~0 2)} #92#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,845 INFO L272 TraceCheckUtils]: 11: Hoare triple {20281#(<= ~counter~0 2)} 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)); {20199#true} is VALID [2022-04-15 08:59:00,845 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20199#true} {20281#(<= ~counter~0 2)} #90#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-15 08:59:00,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-15 08:59:00,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-15 08:59:00,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {20281#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {20199#true} is VALID [2022-04-15 08:59:00,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {20281#(<= ~counter~0 2)} 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; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {20281#(<= ~counter~0 2)} call #t~ret9 := main(); {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20281#(<= ~counter~0 2)} {20199#true} #102#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {20281#(<= ~counter~0 2)} assume true; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {20199#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);~counter~0 := 0; {20281#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:00,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {20199#true} call ULTIMATE.init(); {20199#true} is VALID [2022-04-15 08:59:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 08:59:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173183766] [2022-04-15 08:59:00,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992481408] [2022-04-15 08:59:00,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992481408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:00,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:00,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-15 08:59:00,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:00,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640366849] [2022-04-15 08:59:00,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640366849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:00,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:00,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 08:59:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808647106] [2022-04-15 08:59:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:00,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-15 08:59:00,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:00,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:59:00,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:00,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 08:59:00,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:00,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 08:59:00,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:59:00,904 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:59:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:01,534 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-15 08:59:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 08:59:01,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 83 [2022-04-15 08:59:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:59:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 08:59:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:59:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 08:59:01,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-15 08:59:01,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:01,663 INFO L225 Difference]: With dead ends: 215 [2022-04-15 08:59:01,663 INFO L226 Difference]: Without dead ends: 166 [2022-04-15 08:59:01,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2022-04-15 08:59:01,664 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:01,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 207 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:59:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-15 08:59:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-15 08:59:01,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:01,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:59:01,857 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:59:01,858 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:59:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:01,860 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-15 08:59:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-15 08:59:01,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:01,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:01,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-15 08:59:01,860 INFO L87 Difference]: Start difference. First operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 166 states. [2022-04-15 08:59:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:01,862 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-15 08:59:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-15 08:59:01,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:01,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:01,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:01,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 123 states have internal predecessors, (146), 32 states have call successors, (32), 12 states have call predecessors, (32), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 08:59:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-15 08:59:01,865 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-15 08:59:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:01,865 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-15 08:59:01,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 10 states have call successors, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-15 08:59:01,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-15 08:59:04,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 207 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-15 08:59:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 08:59:04,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:04,215 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:59:04,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:04,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:04,416 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:04,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-15 08:59:04,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:04,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850736196] [2022-04-15 08:59:04,417 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-15 08:59:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:04,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777243574] [2022-04-15 08:59:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:04,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:04,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265556420] [2022-04-15 08:59:04,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:04,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:04,428 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:04,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 08:59:04,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:04,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:04,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 08:59:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:04,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:04,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {21816#true} call ULTIMATE.init(); {21816#true} is VALID [2022-04-15 08:59:04,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {21816#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);~counter~0 := 0; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21824#(<= ~counter~0 0)} {21816#true} #102#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {21824#(<= ~counter~0 0)} call #t~ret9 := main(); {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {21824#(<= ~counter~0 0)} 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; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {21824#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {21824#(<= ~counter~0 0)} ~cond := #in~cond; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {21824#(<= ~counter~0 0)} assume !(0 == ~cond); {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,946 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21824#(<= ~counter~0 0)} {21824#(<= ~counter~0 0)} #90#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,947 INFO L272 TraceCheckUtils]: 11: Hoare triple {21824#(<= ~counter~0 0)} 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)); {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {21824#(<= ~counter~0 0)} ~cond := #in~cond; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {21824#(<= ~counter~0 0)} assume !(0 == ~cond); {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,948 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21824#(<= ~counter~0 0)} {21824#(<= ~counter~0 0)} #92#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {21824#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21824#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:04,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {21824#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {21873#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,950 INFO L272 TraceCheckUtils]: 19: Hoare triple {21873#(<= ~counter~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)); {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {21873#(<= ~counter~0 1)} ~cond := #in~cond; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {21873#(<= ~counter~0 1)} assume !(0 == ~cond); {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {21873#(<= ~counter~0 1)} assume true; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,951 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21873#(<= ~counter~0 1)} {21873#(<= ~counter~0 1)} #94#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {21873#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:04,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {21873#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {21898#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,952 INFO L272 TraceCheckUtils]: 27: Hoare triple {21898#(<= ~counter~0 2)} 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)); {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {21898#(<= ~counter~0 2)} ~cond := #in~cond; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {21898#(<= ~counter~0 2)} assume !(0 == ~cond); {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {21898#(<= ~counter~0 2)} assume true; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,954 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21898#(<= ~counter~0 2)} {21898#(<= ~counter~0 2)} #96#return; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {21898#(<= ~counter~0 2)} assume !(~r~0 > 0); {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:04,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {21898#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {21923#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,955 INFO L272 TraceCheckUtils]: 35: Hoare triple {21923#(<= ~counter~0 3)} 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)); {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {21923#(<= ~counter~0 3)} ~cond := #in~cond; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {21923#(<= ~counter~0 3)} assume !(0 == ~cond); {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {21923#(<= ~counter~0 3)} assume true; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,956 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21923#(<= ~counter~0 3)} {21923#(<= ~counter~0 3)} #98#return; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {21923#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:04,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {21923#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {21948#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,958 INFO L272 TraceCheckUtils]: 43: Hoare triple {21948#(<= ~counter~0 4)} 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)); {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {21948#(<= ~counter~0 4)} ~cond := #in~cond; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {21948#(<= ~counter~0 4)} assume !(0 == ~cond); {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {21948#(<= ~counter~0 4)} assume true; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,959 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21948#(<= ~counter~0 4)} {21948#(<= ~counter~0 4)} #98#return; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {21948#(<= ~counter~0 4)} assume !(~r~0 < 0); {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:04,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {21948#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {21973#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,961 INFO L272 TraceCheckUtils]: 51: Hoare triple {21973#(<= ~counter~0 5)} 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)); {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {21973#(<= ~counter~0 5)} ~cond := #in~cond; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {21973#(<= ~counter~0 5)} assume !(0 == ~cond); {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {21973#(<= ~counter~0 5)} assume true; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,962 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21973#(<= ~counter~0 5)} {21973#(<= ~counter~0 5)} #94#return; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,962 INFO L290 TraceCheckUtils]: 56: Hoare triple {21973#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:04,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {21973#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,963 INFO L290 TraceCheckUtils]: 58: Hoare triple {21998#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,964 INFO L272 TraceCheckUtils]: 59: Hoare triple {21998#(<= ~counter~0 6)} 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)); {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {21998#(<= ~counter~0 6)} ~cond := #in~cond; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {21998#(<= ~counter~0 6)} assume !(0 == ~cond); {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {21998#(<= ~counter~0 6)} assume true; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,965 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21998#(<= ~counter~0 6)} {21998#(<= ~counter~0 6)} #96#return; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,965 INFO L290 TraceCheckUtils]: 64: Hoare triple {21998#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:04,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {21998#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {22023#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,966 INFO L272 TraceCheckUtils]: 67: Hoare triple {22023#(<= ~counter~0 7)} 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)); {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {22023#(<= ~counter~0 7)} ~cond := #in~cond; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {22023#(<= ~counter~0 7)} assume !(0 == ~cond); {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {22023#(<= ~counter~0 7)} assume true; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,968 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22023#(<= ~counter~0 7)} {22023#(<= ~counter~0 7)} #96#return; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {22023#(<= ~counter~0 7)} assume !(~r~0 > 0); {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:04,968 INFO L290 TraceCheckUtils]: 73: Hoare triple {22023#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {22048#(<= ~counter~0 8)} assume !!(#t~post8 < 10);havoc #t~post8; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,969 INFO L272 TraceCheckUtils]: 75: Hoare triple {22048#(<= ~counter~0 8)} 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)); {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {22048#(<= ~counter~0 8)} ~cond := #in~cond; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {22048#(<= ~counter~0 8)} assume !(0 == ~cond); {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {22048#(<= ~counter~0 8)} assume true; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,970 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22048#(<= ~counter~0 8)} {22048#(<= ~counter~0 8)} #98#return; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,971 INFO L290 TraceCheckUtils]: 80: Hoare triple {22048#(<= ~counter~0 8)} assume !(~r~0 < 0); {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:04,971 INFO L290 TraceCheckUtils]: 81: Hoare triple {22048#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22073#(<= |main_#t~post6| 8)} is VALID [2022-04-15 08:59:04,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {22073#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {21817#false} is VALID [2022-04-15 08:59:04,971 INFO L272 TraceCheckUtils]: 83: Hoare triple {21817#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)); {21817#false} is VALID [2022-04-15 08:59:04,971 INFO L290 TraceCheckUtils]: 84: Hoare triple {21817#false} ~cond := #in~cond; {21817#false} is VALID [2022-04-15 08:59:04,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {21817#false} assume 0 == ~cond; {21817#false} is VALID [2022-04-15 08:59:04,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {21817#false} assume !false; {21817#false} is VALID [2022-04-15 08:59:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:59:04,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:05,350 INFO L290 TraceCheckUtils]: 86: Hoare triple {21817#false} assume !false; {21817#false} is VALID [2022-04-15 08:59:05,350 INFO L290 TraceCheckUtils]: 85: Hoare triple {21817#false} assume 0 == ~cond; {21817#false} is VALID [2022-04-15 08:59:05,350 INFO L290 TraceCheckUtils]: 84: Hoare triple {21817#false} ~cond := #in~cond; {21817#false} is VALID [2022-04-15 08:59:05,350 INFO L272 TraceCheckUtils]: 83: Hoare triple {21817#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)); {21817#false} is VALID [2022-04-15 08:59:05,350 INFO L290 TraceCheckUtils]: 82: Hoare triple {22101#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {21817#false} is VALID [2022-04-15 08:59:05,351 INFO L290 TraceCheckUtils]: 81: Hoare triple {22105#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22101#(< |main_#t~post6| 10)} is VALID [2022-04-15 08:59:05,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {22105#(< ~counter~0 10)} assume !(~r~0 < 0); {22105#(< ~counter~0 10)} is VALID [2022-04-15 08:59:05,352 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21816#true} {22105#(< ~counter~0 10)} #98#return; {22105#(< ~counter~0 10)} is VALID [2022-04-15 08:59:05,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,352 INFO L272 TraceCheckUtils]: 75: Hoare triple {22105#(< ~counter~0 10)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,352 INFO L290 TraceCheckUtils]: 74: Hoare triple {22105#(< ~counter~0 10)} assume !!(#t~post8 < 10);havoc #t~post8; {22105#(< ~counter~0 10)} is VALID [2022-04-15 08:59:05,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {22048#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22105#(< ~counter~0 10)} is VALID [2022-04-15 08:59:05,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {22048#(<= ~counter~0 8)} assume !(~r~0 > 0); {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:05,354 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21816#true} {22048#(<= ~counter~0 8)} #96#return; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:05,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,354 INFO L272 TraceCheckUtils]: 67: Hoare triple {22048#(<= ~counter~0 8)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,354 INFO L290 TraceCheckUtils]: 66: Hoare triple {22048#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:05,355 INFO L290 TraceCheckUtils]: 65: Hoare triple {22023#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22048#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:05,355 INFO L290 TraceCheckUtils]: 64: Hoare triple {22023#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:05,355 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21816#true} {22023#(<= ~counter~0 7)} #96#return; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:05,355 INFO L290 TraceCheckUtils]: 62: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,355 INFO L290 TraceCheckUtils]: 61: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,356 INFO L272 TraceCheckUtils]: 59: Hoare triple {22023#(<= ~counter~0 7)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {22023#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:05,356 INFO L290 TraceCheckUtils]: 57: Hoare triple {21998#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22023#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:05,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {21998#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:05,357 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21816#true} {21998#(<= ~counter~0 6)} #94#return; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:05,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,357 INFO L272 TraceCheckUtils]: 51: Hoare triple {21998#(<= ~counter~0 6)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,358 INFO L290 TraceCheckUtils]: 50: Hoare triple {21998#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:05,358 INFO L290 TraceCheckUtils]: 49: Hoare triple {21973#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21998#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:05,358 INFO L290 TraceCheckUtils]: 48: Hoare triple {21973#(<= ~counter~0 5)} assume !(~r~0 < 0); {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:05,359 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21816#true} {21973#(<= ~counter~0 5)} #98#return; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:05,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,359 INFO L290 TraceCheckUtils]: 45: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,359 INFO L290 TraceCheckUtils]: 44: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,359 INFO L272 TraceCheckUtils]: 43: Hoare triple {21973#(<= ~counter~0 5)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,359 INFO L290 TraceCheckUtils]: 42: Hoare triple {21973#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:05,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {21948#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21973#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:05,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {21948#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:05,361 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21816#true} {21948#(<= ~counter~0 4)} #98#return; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:05,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,361 INFO L272 TraceCheckUtils]: 35: Hoare triple {21948#(<= ~counter~0 4)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {21948#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:05,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {21923#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21948#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:05,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {21923#(<= ~counter~0 3)} assume !(~r~0 > 0); {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:05,362 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21816#true} {21923#(<= ~counter~0 3)} #96#return; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:05,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,362 INFO L272 TraceCheckUtils]: 27: Hoare triple {21923#(<= ~counter~0 3)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {21923#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:05,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {21898#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21923#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:05,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {21898#(<= ~counter~0 2)} assume !!(0 != ~r~0); {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:05,364 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21816#true} {21898#(<= ~counter~0 2)} #94#return; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:05,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,364 INFO L272 TraceCheckUtils]: 19: Hoare triple {21898#(<= ~counter~0 2)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {21898#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:05,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {21873#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21898#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:05,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {21873#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21816#true} {21873#(<= ~counter~0 1)} #92#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L272 TraceCheckUtils]: 11: Hoare triple {21873#(<= ~counter~0 1)} 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)); {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21816#true} {21873#(<= ~counter~0 1)} #90#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-15 08:59:05,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {21873#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21816#true} is VALID [2022-04-15 08:59:05,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {21873#(<= ~counter~0 1)} 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; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {21873#(<= ~counter~0 1)} call #t~ret9 := main(); {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21873#(<= ~counter~0 1)} {21816#true} #102#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {21873#(<= ~counter~0 1)} assume true; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {21816#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);~counter~0 := 0; {21873#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:05,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {21816#true} call ULTIMATE.init(); {21816#true} is VALID [2022-04-15 08:59:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 08:59:05,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:05,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777243574] [2022-04-15 08:59:05,369 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:05,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265556420] [2022-04-15 08:59:05,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265556420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:05,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:05,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-15 08:59:05,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:05,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850736196] [2022-04-15 08:59:05,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850736196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:05,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:05,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 08:59:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439968342] [2022-04-15 08:59:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-15 08:59:05,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:05,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:05,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:05,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 08:59:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:05,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 08:59:05,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:59:05,430 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:06,141 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-15 08:59:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 08:59:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 87 [2022-04-15 08:59:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 08:59:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 08:59:06,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-15 08:59:06,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:06,269 INFO L225 Difference]: With dead ends: 188 [2022-04-15 08:59:06,269 INFO L226 Difference]: Without dead ends: 183 [2022-04-15 08:59:06,269 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2022-04-15 08:59:06,270 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:06,270 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 216 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 08:59:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-15 08:59:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-15 08:59:06,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:06,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 08:59:06,480 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 08:59:06,481 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 08:59:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:06,483 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-15 08:59:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-15 08:59:06,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:06,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:06,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-15 08:59:06,484 INFO L87 Difference]: Start difference. First operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 183 states. [2022-04-15 08:59:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:06,486 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-15 08:59:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-15 08:59:06,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:06,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:06,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:06,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 129 states have (on average 1.186046511627907) internal successors, (153), 132 states have internal predecessors, (153), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 08:59:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-15 08:59:06,489 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-15 08:59:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:06,489 INFO L478 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-15 08:59:06,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:06,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-15 08:59:07,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-15 08:59:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 08:59:07,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:07,727 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:59:07,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:07,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:07,928 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:07,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-15 08:59:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:07,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [427586223] [2022-04-15 08:59:07,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:07,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-15 08:59:07,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:07,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361837790] [2022-04-15 08:59:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:07,940 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:07,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354581948] [2022-04-15 08:59:07,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:59:07,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:07,955 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:07,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 08:59:07,998 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:59:07,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:07,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 08:59:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:08,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:08,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {23457#true} call ULTIMATE.init(); {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {23457#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);~counter~0 := 0; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23457#true} {23457#true} #102#return; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {23457#true} call #t~ret9 := main(); {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {23457#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; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {23457#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23457#true} {23457#true} #90#return; {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L272 TraceCheckUtils]: 11: Hoare triple {23457#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)); {23457#true} is VALID [2022-04-15 08:59:08,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23457#true} {23457#true} #92#return; {23457#true} is VALID [2022-04-15 08:59:08,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {23457#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,296 INFO L272 TraceCheckUtils]: 19: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,296 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,297 INFO L272 TraceCheckUtils]: 27: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,298 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 > 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,299 INFO L272 TraceCheckUtils]: 35: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,299 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,300 INFO L272 TraceCheckUtils]: 43: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,301 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 < 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,302 INFO L272 TraceCheckUtils]: 51: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,302 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,303 INFO L272 TraceCheckUtils]: 59: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,304 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,305 INFO L272 TraceCheckUtils]: 67: Hoare triple {23655#(< 0 (+ main_~r~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)); {23457#true} is VALID [2022-04-15 08:59:08,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,306 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #96#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,307 INFO L290 TraceCheckUtils]: 73: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,307 INFO L290 TraceCheckUtils]: 74: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,307 INFO L272 TraceCheckUtils]: 75: Hoare triple {23655#(< 0 (+ main_~r~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)); {23457#true} is VALID [2022-04-15 08:59:08,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,307 INFO L290 TraceCheckUtils]: 77: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,307 INFO L290 TraceCheckUtils]: 78: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,308 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #98#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 81: Hoare triple {23458#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 82: Hoare triple {23458#false} assume !(#t~post8 < 10);havoc #t~post8; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 83: Hoare triple {23458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {23458#false} assume !(#t~post6 < 10);havoc #t~post6; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L272 TraceCheckUtils]: 85: Hoare triple {23458#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)); {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {23458#false} ~cond := #in~cond; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 87: Hoare triple {23458#false} assume 0 == ~cond; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L290 TraceCheckUtils]: 88: Hoare triple {23458#false} assume !false; {23458#false} is VALID [2022-04-15 08:59:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-15 08:59:08,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 88: Hoare triple {23458#false} assume !false; {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {23458#false} assume 0 == ~cond; {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 86: Hoare triple {23458#false} ~cond := #in~cond; {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L272 TraceCheckUtils]: 85: Hoare triple {23458#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)); {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 84: Hoare triple {23458#false} assume !(#t~post6 < 10);havoc #t~post6; {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {23458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 82: Hoare triple {23458#false} assume !(#t~post8 < 10);havoc #t~post8; {23458#false} is VALID [2022-04-15 08:59:08,573 INFO L290 TraceCheckUtils]: 81: Hoare triple {23458#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23458#false} is VALID [2022-04-15 08:59:08,574 INFO L290 TraceCheckUtils]: 80: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23458#false} is VALID [2022-04-15 08:59:08,575 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #98#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,575 INFO L290 TraceCheckUtils]: 78: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,575 INFO L290 TraceCheckUtils]: 77: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,575 INFO L290 TraceCheckUtils]: 76: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,575 INFO L272 TraceCheckUtils]: 75: Hoare triple {23655#(< 0 (+ main_~r~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)); {23457#true} is VALID [2022-04-15 08:59:08,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 10);havoc #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,576 INFO L290 TraceCheckUtils]: 72: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,576 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23457#true} {23655#(< 0 (+ main_~r~0 1))} #96#return; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,576 INFO L290 TraceCheckUtils]: 70: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,577 INFO L272 TraceCheckUtils]: 67: Hoare triple {23655#(< 0 (+ main_~r~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)); {23457#true} is VALID [2022-04-15 08:59:08,577 INFO L290 TraceCheckUtils]: 66: Hoare triple {23655#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,577 INFO L290 TraceCheckUtils]: 65: Hoare triple {23655#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23655#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 08:59:08,578 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,578 INFO L290 TraceCheckUtils]: 62: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,578 INFO L290 TraceCheckUtils]: 61: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,578 INFO L290 TraceCheckUtils]: 60: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,578 INFO L272 TraceCheckUtils]: 59: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,580 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,580 INFO L272 TraceCheckUtils]: 51: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 < 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,581 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,581 INFO L272 TraceCheckUtils]: 43: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {23510#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,583 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,583 INFO L272 TraceCheckUtils]: 35: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post8 < 10);havoc #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {23510#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 > 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,584 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {23510#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,586 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,586 INFO L272 TraceCheckUtils]: 19: Hoare triple {23510#(<= 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)); {23457#true} is VALID [2022-04-15 08:59:08,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {23510#(<= main_~v~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {23510#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {23457#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23510#(<= main_~v~0 1)} is VALID [2022-04-15 08:59:08,587 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23457#true} {23457#true} #92#return; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L272 TraceCheckUtils]: 11: Hoare triple {23457#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)); {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23457#true} {23457#true} #90#return; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {23457#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {23457#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; {23457#true} is VALID [2022-04-15 08:59:08,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {23457#true} call #t~ret9 := main(); {23457#true} is VALID [2022-04-15 08:59:08,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23457#true} {23457#true} #102#return; {23457#true} is VALID [2022-04-15 08:59:08,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-15 08:59:08,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {23457#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);~counter~0 := 0; {23457#true} is VALID [2022-04-15 08:59:08,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {23457#true} call ULTIMATE.init(); {23457#true} is VALID [2022-04-15 08:59:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-15 08:59:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361837790] [2022-04-15 08:59:08,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:08,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354581948] [2022-04-15 08:59:08,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354581948] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:08,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:08,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-15 08:59:08,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:08,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [427586223] [2022-04-15 08:59:08,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [427586223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:08,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:08,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424752713] [2022-04-15 08:59:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:08,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-15 08:59:08,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:08,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:08,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:08,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:59:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:59:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:59:08,627 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:09,229 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-15 08:59:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 08:59:09,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-15 08:59:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 08:59:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:09,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 08:59:09,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-15 08:59:09,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:09,342 INFO L225 Difference]: With dead ends: 407 [2022-04-15 08:59:09,342 INFO L226 Difference]: Without dead ends: 301 [2022-04-15 08:59:09,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 08:59:09,349 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:09,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:59:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-15 08:59:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-15 08:59:09,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:09,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 08:59:09,722 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 08:59:09,722 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 08:59:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:09,727 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-15 08:59:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-15 08:59:09,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:09,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:09,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-15 08:59:09,729 INFO L87 Difference]: Start difference. First operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 301 states. [2022-04-15 08:59:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:09,734 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-15 08:59:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-15 08:59:09,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:09,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:09,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:09,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 219 states have (on average 1.2191780821917808) internal successors, (267), 225 states have internal predecessors, (267), 65 states have call successors, (65), 13 states have call predecessors, (65), 11 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 08:59:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-15 08:59:09,740 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-15 08:59:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:09,740 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-15 08:59:09,740 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:09,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-15 08:59:11,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-15 08:59:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 08:59:11,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:11,254 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:59:11,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:11,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 08:59:11,467 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-15 08:59:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:11,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049709365] [2022-04-15 08:59:11,468 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:11,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-15 08:59:11,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:11,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947062392] [2022-04-15 08:59:11,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:11,506 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:11,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390174165] [2022-04-15 08:59:11,506 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:59:11,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:11,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:11,507 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:11,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 08:59:11,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 08:59:11,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:11,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 08:59:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:11,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:11,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {26004#true} call ULTIMATE.init(); {26004#true} is VALID [2022-04-15 08:59:11,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {26004#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);~counter~0 := 0; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26012#(<= ~counter~0 0)} {26004#true} #102#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {26012#(<= ~counter~0 0)} call #t~ret9 := main(); {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {26012#(<= ~counter~0 0)} 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; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {26012#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {26012#(<= ~counter~0 0)} ~cond := #in~cond; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {26012#(<= ~counter~0 0)} assume !(0 == ~cond); {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,944 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26012#(<= ~counter~0 0)} {26012#(<= ~counter~0 0)} #90#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,945 INFO L272 TraceCheckUtils]: 11: Hoare triple {26012#(<= ~counter~0 0)} 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)); {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {26012#(<= ~counter~0 0)} ~cond := #in~cond; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {26012#(<= ~counter~0 0)} assume !(0 == ~cond); {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26012#(<= ~counter~0 0)} {26012#(<= ~counter~0 0)} #92#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {26012#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:11,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {26012#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {26061#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {26061#(<= ~counter~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)); {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {26061#(<= ~counter~0 1)} ~cond := #in~cond; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {26061#(<= ~counter~0 1)} assume !(0 == ~cond); {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {26061#(<= ~counter~0 1)} assume true; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,948 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26061#(<= ~counter~0 1)} {26061#(<= ~counter~0 1)} #94#return; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {26061#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:11,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {26061#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {26086#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,949 INFO L272 TraceCheckUtils]: 27: Hoare triple {26086#(<= ~counter~0 2)} 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)); {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {26086#(<= ~counter~0 2)} ~cond := #in~cond; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {26086#(<= ~counter~0 2)} assume !(0 == ~cond); {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {26086#(<= ~counter~0 2)} assume true; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,949 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26086#(<= ~counter~0 2)} {26086#(<= ~counter~0 2)} #96#return; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {26086#(<= ~counter~0 2)} assume !(~r~0 > 0); {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:11,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {26086#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {26111#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,950 INFO L272 TraceCheckUtils]: 35: Hoare triple {26111#(<= ~counter~0 3)} 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)); {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {26111#(<= ~counter~0 3)} ~cond := #in~cond; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {26111#(<= ~counter~0 3)} assume !(0 == ~cond); {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {26111#(<= ~counter~0 3)} assume true; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,951 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26111#(<= ~counter~0 3)} {26111#(<= ~counter~0 3)} #98#return; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {26111#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:11,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {26111#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {26136#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,952 INFO L272 TraceCheckUtils]: 43: Hoare triple {26136#(<= ~counter~0 4)} 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)); {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {26136#(<= ~counter~0 4)} ~cond := #in~cond; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {26136#(<= ~counter~0 4)} assume !(0 == ~cond); {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {26136#(<= ~counter~0 4)} assume true; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,953 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26136#(<= ~counter~0 4)} {26136#(<= ~counter~0 4)} #98#return; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {26136#(<= ~counter~0 4)} assume !(~r~0 < 0); {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:11,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {26136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,954 INFO L290 TraceCheckUtils]: 50: Hoare triple {26161#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,954 INFO L272 TraceCheckUtils]: 51: Hoare triple {26161#(<= ~counter~0 5)} 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)); {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {26161#(<= ~counter~0 5)} ~cond := #in~cond; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {26161#(<= ~counter~0 5)} assume !(0 == ~cond); {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {26161#(<= ~counter~0 5)} assume true; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,955 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26161#(<= ~counter~0 5)} {26161#(<= ~counter~0 5)} #94#return; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,955 INFO L290 TraceCheckUtils]: 56: Hoare triple {26161#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:11,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {26161#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {26186#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,956 INFO L272 TraceCheckUtils]: 59: Hoare triple {26186#(<= ~counter~0 6)} 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)); {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {26186#(<= ~counter~0 6)} ~cond := #in~cond; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {26186#(<= ~counter~0 6)} assume !(0 == ~cond); {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {26186#(<= ~counter~0 6)} assume true; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,964 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26186#(<= ~counter~0 6)} {26186#(<= ~counter~0 6)} #96#return; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {26186#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:11,965 INFO L290 TraceCheckUtils]: 65: Hoare triple {26186#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,965 INFO L290 TraceCheckUtils]: 66: Hoare triple {26211#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,965 INFO L272 TraceCheckUtils]: 67: Hoare triple {26211#(<= ~counter~0 7)} 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)); {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {26211#(<= ~counter~0 7)} ~cond := #in~cond; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {26211#(<= ~counter~0 7)} assume !(0 == ~cond); {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,966 INFO L290 TraceCheckUtils]: 70: Hoare triple {26211#(<= ~counter~0 7)} assume true; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,966 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26211#(<= ~counter~0 7)} {26211#(<= ~counter~0 7)} #96#return; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {26211#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:11,967 INFO L290 TraceCheckUtils]: 73: Hoare triple {26211#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,967 INFO L290 TraceCheckUtils]: 74: Hoare triple {26236#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,967 INFO L272 TraceCheckUtils]: 75: Hoare triple {26236#(<= ~counter~0 8)} 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)); {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,967 INFO L290 TraceCheckUtils]: 76: Hoare triple {26236#(<= ~counter~0 8)} ~cond := #in~cond; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {26236#(<= ~counter~0 8)} assume !(0 == ~cond); {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {26236#(<= ~counter~0 8)} assume true; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,968 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26236#(<= ~counter~0 8)} {26236#(<= ~counter~0 8)} #96#return; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,968 INFO L290 TraceCheckUtils]: 80: Hoare triple {26236#(<= ~counter~0 8)} assume !(~r~0 > 0); {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:11,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {26236#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:11,969 INFO L290 TraceCheckUtils]: 82: Hoare triple {26261#(<= ~counter~0 9)} assume !(#t~post8 < 10);havoc #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:11,969 INFO L290 TraceCheckUtils]: 83: Hoare triple {26261#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26268#(<= |main_#t~post6| 9)} is VALID [2022-04-15 08:59:11,969 INFO L290 TraceCheckUtils]: 84: Hoare triple {26268#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {26005#false} is VALID [2022-04-15 08:59:11,969 INFO L272 TraceCheckUtils]: 85: Hoare triple {26005#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)); {26005#false} is VALID [2022-04-15 08:59:11,969 INFO L290 TraceCheckUtils]: 86: Hoare triple {26005#false} ~cond := #in~cond; {26005#false} is VALID [2022-04-15 08:59:11,969 INFO L290 TraceCheckUtils]: 87: Hoare triple {26005#false} assume 0 == ~cond; {26005#false} is VALID [2022-04-15 08:59:11,969 INFO L290 TraceCheckUtils]: 88: Hoare triple {26005#false} assume !false; {26005#false} is VALID [2022-04-15 08:59:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:59:11,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:12,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {26005#false} assume !false; {26005#false} is VALID [2022-04-15 08:59:12,194 INFO L290 TraceCheckUtils]: 87: Hoare triple {26005#false} assume 0 == ~cond; {26005#false} is VALID [2022-04-15 08:59:12,194 INFO L290 TraceCheckUtils]: 86: Hoare triple {26005#false} ~cond := #in~cond; {26005#false} is VALID [2022-04-15 08:59:12,194 INFO L272 TraceCheckUtils]: 85: Hoare triple {26005#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)); {26005#false} is VALID [2022-04-15 08:59:12,195 INFO L290 TraceCheckUtils]: 84: Hoare triple {26268#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {26005#false} is VALID [2022-04-15 08:59:12,195 INFO L290 TraceCheckUtils]: 83: Hoare triple {26261#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26268#(<= |main_#t~post6| 9)} is VALID [2022-04-15 08:59:12,195 INFO L290 TraceCheckUtils]: 82: Hoare triple {26261#(<= ~counter~0 9)} assume !(#t~post8 < 10);havoc #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:12,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {26236#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26261#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:12,198 INFO L290 TraceCheckUtils]: 80: Hoare triple {26236#(<= ~counter~0 8)} assume !(~r~0 > 0); {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:12,198 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26004#true} {26236#(<= ~counter~0 8)} #96#return; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:12,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,199 INFO L272 TraceCheckUtils]: 75: Hoare triple {26236#(<= ~counter~0 8)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,199 INFO L290 TraceCheckUtils]: 74: Hoare triple {26236#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:12,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {26211#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26236#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:12,199 INFO L290 TraceCheckUtils]: 72: Hoare triple {26211#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:12,200 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26004#true} {26211#(<= ~counter~0 7)} #96#return; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:12,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,200 INFO L290 TraceCheckUtils]: 69: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,200 INFO L290 TraceCheckUtils]: 68: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,200 INFO L272 TraceCheckUtils]: 67: Hoare triple {26211#(<= ~counter~0 7)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {26211#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:12,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {26186#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26211#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:12,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {26186#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:12,207 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26004#true} {26186#(<= ~counter~0 6)} #96#return; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:12,207 INFO L290 TraceCheckUtils]: 62: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,207 INFO L290 TraceCheckUtils]: 61: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,207 INFO L290 TraceCheckUtils]: 60: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,207 INFO L272 TraceCheckUtils]: 59: Hoare triple {26186#(<= ~counter~0 6)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {26186#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:12,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {26161#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26186#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:12,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {26161#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:12,208 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26004#true} {26161#(<= ~counter~0 5)} #94#return; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:12,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,208 INFO L272 TraceCheckUtils]: 51: Hoare triple {26161#(<= ~counter~0 5)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {26161#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:12,209 INFO L290 TraceCheckUtils]: 49: Hoare triple {26136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26161#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:12,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {26136#(<= ~counter~0 4)} assume !(~r~0 < 0); {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:12,209 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26004#true} {26136#(<= ~counter~0 4)} #98#return; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:12,209 INFO L290 TraceCheckUtils]: 46: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,210 INFO L272 TraceCheckUtils]: 43: Hoare triple {26136#(<= ~counter~0 4)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {26136#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:12,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {26111#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26136#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:12,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {26111#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:12,231 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26004#true} {26111#(<= ~counter~0 3)} #98#return; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:12,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,231 INFO L272 TraceCheckUtils]: 35: Hoare triple {26111#(<= ~counter~0 3)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {26111#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:12,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {26086#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {26111#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:12,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {26086#(<= ~counter~0 2)} assume !(~r~0 > 0); {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:12,232 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26004#true} {26086#(<= ~counter~0 2)} #96#return; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:12,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,233 INFO L272 TraceCheckUtils]: 27: Hoare triple {26086#(<= ~counter~0 2)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {26086#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:12,233 INFO L290 TraceCheckUtils]: 25: Hoare triple {26061#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26086#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:12,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {26061#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:12,234 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26004#true} {26061#(<= ~counter~0 1)} #94#return; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:12,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {26061#(<= ~counter~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)); {26004#true} is VALID [2022-04-15 08:59:12,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {26061#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:12,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {26012#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26061#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:12,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {26012#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26004#true} {26012#(<= ~counter~0 0)} #92#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,235 INFO L272 TraceCheckUtils]: 11: Hoare triple {26012#(<= ~counter~0 0)} 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)); {26004#true} is VALID [2022-04-15 08:59:12,236 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26004#true} {26012#(<= ~counter~0 0)} #90#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-15 08:59:12,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-15 08:59:12,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-15 08:59:12,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {26012#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26004#true} is VALID [2022-04-15 08:59:12,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {26012#(<= ~counter~0 0)} 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; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {26012#(<= ~counter~0 0)} call #t~ret9 := main(); {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26012#(<= ~counter~0 0)} {26004#true} #102#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {26004#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);~counter~0 := 0; {26012#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:12,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {26004#true} call ULTIMATE.init(); {26004#true} is VALID [2022-04-15 08:59:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 08:59:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:12,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947062392] [2022-04-15 08:59:12,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:12,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390174165] [2022-04-15 08:59:12,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390174165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:12,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:12,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-15 08:59:12,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:12,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049709365] [2022-04-15 08:59:12,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049709365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:12,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:12,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 08:59:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994014620] [2022-04-15 08:59:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-15 08:59:12,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:12,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:12,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:12,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 08:59:12,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 08:59:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:59:12,277 INFO L87 Difference]: Start difference. First operand 296 states and 395 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:13,009 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-15 08:59:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 08:59:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 89 [2022-04-15 08:59:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 08:59:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 08:59:13,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 08:59:13,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:13,122 INFO L225 Difference]: With dead ends: 362 [2022-04-15 08:59:13,122 INFO L226 Difference]: Without dead ends: 357 [2022-04-15 08:59:13,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2022-04-15 08:59:13,123 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:13,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 240 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:59:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-15 08:59:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-15 08:59:13,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:13,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:13,674 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:13,674 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:13,680 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-15 08:59:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-15 08:59:13,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:13,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:13,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-15 08:59:13,681 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 357 states. [2022-04-15 08:59:13,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:13,687 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-15 08:59:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-15 08:59:13,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:13,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:13,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:13,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.231372549019608) internal successors, (314), 261 states have internal predecessors, (314), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-15 08:59:13,694 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-15 08:59:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:13,694 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-15 08:59:13,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:13,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-15 08:59:16,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 459 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-15 08:59:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 08:59:16,533 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:16,533 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-15 08:59:16,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:16,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 08:59:16,736 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:16,736 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-15 08:59:16,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:16,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847786795] [2022-04-15 08:59:16,737 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-15 08:59:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:16,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394097629] [2022-04-15 08:59:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:16,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122579125] [2022-04-15 08:59:16,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 08:59:16,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:16,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:16,748 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:16,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 08:59:16,889 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 08:59:16,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:16,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 08:59:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:16,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:17,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {28684#true} call ULTIMATE.init(); {28684#true} is VALID [2022-04-15 08:59:17,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {28684#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);~counter~0 := 0; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28692#(<= ~counter~0 0)} {28684#true} #102#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {28692#(<= ~counter~0 0)} call #t~ret9 := main(); {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {28692#(<= ~counter~0 0)} 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; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,237 INFO L272 TraceCheckUtils]: 6: Hoare triple {28692#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {28692#(<= ~counter~0 0)} ~cond := #in~cond; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {28692#(<= ~counter~0 0)} assume !(0 == ~cond); {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,238 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28692#(<= ~counter~0 0)} {28692#(<= ~counter~0 0)} #90#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,238 INFO L272 TraceCheckUtils]: 11: Hoare triple {28692#(<= ~counter~0 0)} 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)); {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {28692#(<= ~counter~0 0)} ~cond := #in~cond; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {28692#(<= ~counter~0 0)} assume !(0 == ~cond); {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,239 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28692#(<= ~counter~0 0)} {28692#(<= ~counter~0 0)} #92#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {28692#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28692#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:17,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {28692#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {28741#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,241 INFO L272 TraceCheckUtils]: 19: Hoare triple {28741#(<= ~counter~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)); {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {28741#(<= ~counter~0 1)} ~cond := #in~cond; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {28741#(<= ~counter~0 1)} assume !(0 == ~cond); {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {28741#(<= ~counter~0 1)} assume true; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,242 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28741#(<= ~counter~0 1)} {28741#(<= ~counter~0 1)} #94#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {28741#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {28741#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {28766#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,243 INFO L272 TraceCheckUtils]: 27: Hoare triple {28766#(<= ~counter~0 2)} 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)); {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {28766#(<= ~counter~0 2)} ~cond := #in~cond; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {28766#(<= ~counter~0 2)} assume !(0 == ~cond); {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {28766#(<= ~counter~0 2)} assume true; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,244 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28766#(<= ~counter~0 2)} {28766#(<= ~counter~0 2)} #96#return; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {28766#(<= ~counter~0 2)} assume !(~r~0 > 0); {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {28766#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {28791#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,246 INFO L272 TraceCheckUtils]: 35: Hoare triple {28791#(<= ~counter~0 3)} 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)); {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {28791#(<= ~counter~0 3)} ~cond := #in~cond; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {28791#(<= ~counter~0 3)} assume !(0 == ~cond); {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {28791#(<= ~counter~0 3)} assume true; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,247 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28791#(<= ~counter~0 3)} {28791#(<= ~counter~0 3)} #98#return; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {28791#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {28791#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {28816#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,248 INFO L272 TraceCheckUtils]: 43: Hoare triple {28816#(<= ~counter~0 4)} 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)); {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {28816#(<= ~counter~0 4)} ~cond := #in~cond; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {28816#(<= ~counter~0 4)} assume !(0 == ~cond); {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {28816#(<= ~counter~0 4)} assume true; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,261 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28816#(<= ~counter~0 4)} {28816#(<= ~counter~0 4)} #98#return; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {28816#(<= ~counter~0 4)} assume !(~r~0 < 0); {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {28816#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {28841#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,263 INFO L272 TraceCheckUtils]: 51: Hoare triple {28841#(<= ~counter~0 5)} 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)); {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {28841#(<= ~counter~0 5)} ~cond := #in~cond; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {28841#(<= ~counter~0 5)} assume !(0 == ~cond); {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {28841#(<= ~counter~0 5)} assume true; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,264 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28841#(<= ~counter~0 5)} {28841#(<= ~counter~0 5)} #94#return; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {28841#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {28841#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {28866#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,266 INFO L272 TraceCheckUtils]: 59: Hoare triple {28866#(<= ~counter~0 6)} 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)); {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {28866#(<= ~counter~0 6)} ~cond := #in~cond; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {28866#(<= ~counter~0 6)} assume !(0 == ~cond); {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {28866#(<= ~counter~0 6)} assume true; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,267 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28866#(<= ~counter~0 6)} {28866#(<= ~counter~0 6)} #96#return; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {28866#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {28866#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {28891#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,269 INFO L272 TraceCheckUtils]: 67: Hoare triple {28891#(<= ~counter~0 7)} 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)); {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {28891#(<= ~counter~0 7)} ~cond := #in~cond; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {28891#(<= ~counter~0 7)} assume !(0 == ~cond); {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,270 INFO L290 TraceCheckUtils]: 70: Hoare triple {28891#(<= ~counter~0 7)} assume true; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,270 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28891#(<= ~counter~0 7)} {28891#(<= ~counter~0 7)} #96#return; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {28891#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {28891#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {28916#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,272 INFO L272 TraceCheckUtils]: 75: Hoare triple {28916#(<= ~counter~0 8)} 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)); {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {28916#(<= ~counter~0 8)} ~cond := #in~cond; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {28916#(<= ~counter~0 8)} assume !(0 == ~cond); {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {28916#(<= ~counter~0 8)} assume true; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,273 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28916#(<= ~counter~0 8)} {28916#(<= ~counter~0 8)} #96#return; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,274 INFO L290 TraceCheckUtils]: 80: Hoare triple {28916#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,274 INFO L290 TraceCheckUtils]: 81: Hoare triple {28916#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28941#(<= |main_#t~post7| 8)} is VALID [2022-04-15 08:59:17,274 INFO L290 TraceCheckUtils]: 82: Hoare triple {28941#(<= |main_#t~post7| 8)} assume !(#t~post7 < 10);havoc #t~post7; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 83: Hoare triple {28685#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 84: Hoare triple {28685#false} assume !(#t~post8 < 10);havoc #t~post8; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 85: Hoare triple {28685#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {28685#false} assume !(#t~post6 < 10);havoc #t~post6; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L272 TraceCheckUtils]: 87: Hoare triple {28685#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)); {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {28685#false} ~cond := #in~cond; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {28685#false} assume 0 == ~cond; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {28685#false} assume !false; {28685#false} is VALID [2022-04-15 08:59:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:59:17,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 90: Hoare triple {28685#false} assume !false; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 89: Hoare triple {28685#false} assume 0 == ~cond; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 88: Hoare triple {28685#false} ~cond := #in~cond; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L272 TraceCheckUtils]: 87: Hoare triple {28685#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)); {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 86: Hoare triple {28685#false} assume !(#t~post6 < 10);havoc #t~post6; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 85: Hoare triple {28685#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {28685#false} assume !(#t~post8 < 10);havoc #t~post8; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {28685#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28685#false} is VALID [2022-04-15 08:59:17,663 INFO L290 TraceCheckUtils]: 82: Hoare triple {28993#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {28685#false} is VALID [2022-04-15 08:59:17,664 INFO L290 TraceCheckUtils]: 81: Hoare triple {28997#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28993#(< |main_#t~post7| 10)} is VALID [2022-04-15 08:59:17,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {28997#(< ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28997#(< ~counter~0 10)} is VALID [2022-04-15 08:59:17,665 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28684#true} {28997#(< ~counter~0 10)} #96#return; {28997#(< ~counter~0 10)} is VALID [2022-04-15 08:59:17,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,665 INFO L272 TraceCheckUtils]: 75: Hoare triple {28997#(< ~counter~0 10)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {28997#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {28997#(< ~counter~0 10)} is VALID [2022-04-15 08:59:17,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {28916#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28997#(< ~counter~0 10)} is VALID [2022-04-15 08:59:17,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {28916#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,667 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28684#true} {28916#(<= ~counter~0 8)} #96#return; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,667 INFO L290 TraceCheckUtils]: 69: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,667 INFO L290 TraceCheckUtils]: 68: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,667 INFO L272 TraceCheckUtils]: 67: Hoare triple {28916#(<= ~counter~0 8)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,667 INFO L290 TraceCheckUtils]: 66: Hoare triple {28916#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {28891#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28916#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:17,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {28891#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,668 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28684#true} {28891#(<= ~counter~0 7)} #96#return; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,669 INFO L290 TraceCheckUtils]: 61: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,669 INFO L272 TraceCheckUtils]: 59: Hoare triple {28891#(<= ~counter~0 7)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,669 INFO L290 TraceCheckUtils]: 58: Hoare triple {28891#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {28866#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28891#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:17,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {28866#(<= ~counter~0 6)} assume !!(0 != ~r~0); {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,670 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28684#true} {28866#(<= ~counter~0 6)} #94#return; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,670 INFO L272 TraceCheckUtils]: 51: Hoare triple {28866#(<= ~counter~0 6)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {28866#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,671 INFO L290 TraceCheckUtils]: 49: Hoare triple {28841#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28866#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:17,671 INFO L290 TraceCheckUtils]: 48: Hoare triple {28841#(<= ~counter~0 5)} assume !(~r~0 < 0); {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,672 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28684#true} {28841#(<= ~counter~0 5)} #98#return; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,672 INFO L290 TraceCheckUtils]: 46: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,672 INFO L290 TraceCheckUtils]: 45: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,672 INFO L290 TraceCheckUtils]: 44: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,672 INFO L272 TraceCheckUtils]: 43: Hoare triple {28841#(<= ~counter~0 5)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {28841#(<= ~counter~0 5)} assume !!(#t~post8 < 10);havoc #t~post8; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {28816#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28841#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:17,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {28816#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,674 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28684#true} {28816#(<= ~counter~0 4)} #98#return; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,674 INFO L272 TraceCheckUtils]: 35: Hoare triple {28816#(<= ~counter~0 4)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {28816#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {28791#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28816#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:17,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {28791#(<= ~counter~0 3)} assume !(~r~0 > 0); {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,676 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28684#true} {28791#(<= ~counter~0 3)} #96#return; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,676 INFO L272 TraceCheckUtils]: 27: Hoare triple {28791#(<= ~counter~0 3)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {28791#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {28766#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28791#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:17,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {28766#(<= ~counter~0 2)} assume !!(0 != ~r~0); {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,677 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28684#true} {28766#(<= ~counter~0 2)} #94#return; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,678 INFO L272 TraceCheckUtils]: 19: Hoare triple {28766#(<= ~counter~0 2)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {28766#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {28741#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28766#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:17,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {28741#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28684#true} {28741#(<= ~counter~0 1)} #92#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {28741#(<= ~counter~0 1)} 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)); {28684#true} is VALID [2022-04-15 08:59:17,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28684#true} {28741#(<= ~counter~0 1)} #90#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-15 08:59:17,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-15 08:59:17,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-15 08:59:17,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {28741#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28684#true} is VALID [2022-04-15 08:59:17,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {28741#(<= ~counter~0 1)} 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; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {28741#(<= ~counter~0 1)} call #t~ret9 := main(); {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28741#(<= ~counter~0 1)} {28684#true} #102#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {28741#(<= ~counter~0 1)} assume true; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {28684#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);~counter~0 := 0; {28741#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:17,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {28684#true} call ULTIMATE.init(); {28684#true} is VALID [2022-04-15 08:59:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 08:59:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394097629] [2022-04-15 08:59:17,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122579125] [2022-04-15 08:59:17,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122579125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:17,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:17,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-15 08:59:17,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847786795] [2022-04-15 08:59:17,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847786795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:17,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:17,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 08:59:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262039093] [2022-04-15 08:59:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-15 08:59:17,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:17,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:17,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:17,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 08:59:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 08:59:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 08:59:17,740 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:18,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:18,479 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-15 08:59:18,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 08:59:18,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 91 [2022-04-15 08:59:18,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 08:59:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 08:59:18,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 08:59:18,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:18,578 INFO L225 Difference]: With dead ends: 427 [2022-04-15 08:59:18,579 INFO L226 Difference]: Without dead ends: 342 [2022-04-15 08:59:18,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=265, Unknown=0, NotChecked=0, Total=420 [2022-04-15 08:59:18,579 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 104 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:18,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 211 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:59:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-15 08:59:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-15 08:59:19,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:19,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:19,130 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:19,130 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:19,136 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-15 08:59:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-15 08:59:19,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:19,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:19,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-15 08:59:19,137 INFO L87 Difference]: Start difference. First operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 342 states. [2022-04-15 08:59:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:19,142 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-15 08:59:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-15 08:59:19,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:19,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:19,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:19,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 255 states have (on average 1.2156862745098038) internal successors, (310), 261 states have internal predecessors, (310), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-15 08:59:19,149 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-15 08:59:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:19,149 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-15 08:59:19,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 11 states have call successors, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-15 08:59:19,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-15 08:59:21,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-15 08:59:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 08:59:21,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:21,820 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:59:21,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:22,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 08:59:22,021 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-15 08:59:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:22,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1397733795] [2022-04-15 08:59:22,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-15 08:59:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:22,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499996221] [2022-04-15 08:59:22,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:22,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:22,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622377707] [2022-04-15 08:59:22,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:22,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:22,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:22,051 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:22,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 08:59:22,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:22,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:22,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 08:59:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:22,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:22,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {31479#true} call ULTIMATE.init(); {31479#true} is VALID [2022-04-15 08:59:22,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {31479#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);~counter~0 := 0; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31487#(<= ~counter~0 0)} {31479#true} #102#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {31487#(<= ~counter~0 0)} call #t~ret9 := main(); {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {31487#(<= ~counter~0 0)} 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; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,485 INFO L272 TraceCheckUtils]: 6: Hoare triple {31487#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {31487#(<= ~counter~0 0)} ~cond := #in~cond; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {31487#(<= ~counter~0 0)} assume !(0 == ~cond); {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31487#(<= ~counter~0 0)} {31487#(<= ~counter~0 0)} #90#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,486 INFO L272 TraceCheckUtils]: 11: Hoare triple {31487#(<= ~counter~0 0)} 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)); {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {31487#(<= ~counter~0 0)} ~cond := #in~cond; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {31487#(<= ~counter~0 0)} assume !(0 == ~cond); {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,487 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31487#(<= ~counter~0 0)} {31487#(<= ~counter~0 0)} #92#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {31487#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {31487#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {31536#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,488 INFO L272 TraceCheckUtils]: 19: Hoare triple {31536#(<= ~counter~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)); {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {31536#(<= ~counter~0 1)} ~cond := #in~cond; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {31536#(<= ~counter~0 1)} assume !(0 == ~cond); {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {31536#(<= ~counter~0 1)} assume true; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,489 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31536#(<= ~counter~0 1)} {31536#(<= ~counter~0 1)} #94#return; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {31536#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {31536#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {31561#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,491 INFO L272 TraceCheckUtils]: 27: Hoare triple {31561#(<= ~counter~0 2)} 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)); {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {31561#(<= ~counter~0 2)} ~cond := #in~cond; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {31561#(<= ~counter~0 2)} assume !(0 == ~cond); {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {31561#(<= ~counter~0 2)} assume true; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,491 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31561#(<= ~counter~0 2)} {31561#(<= ~counter~0 2)} #96#return; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {31561#(<= ~counter~0 2)} assume !(~r~0 > 0); {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {31561#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {31586#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,493 INFO L272 TraceCheckUtils]: 35: Hoare triple {31586#(<= ~counter~0 3)} 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)); {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {31586#(<= ~counter~0 3)} ~cond := #in~cond; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {31586#(<= ~counter~0 3)} assume !(0 == ~cond); {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {31586#(<= ~counter~0 3)} assume true; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,494 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31586#(<= ~counter~0 3)} {31586#(<= ~counter~0 3)} #98#return; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {31586#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {31586#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {31611#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,495 INFO L272 TraceCheckUtils]: 43: Hoare triple {31611#(<= ~counter~0 4)} 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)); {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {31611#(<= ~counter~0 4)} ~cond := #in~cond; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {31611#(<= ~counter~0 4)} assume !(0 == ~cond); {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {31611#(<= ~counter~0 4)} assume true; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,496 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31611#(<= ~counter~0 4)} {31611#(<= ~counter~0 4)} #98#return; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {31611#(<= ~counter~0 4)} assume !(~r~0 < 0); {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {31611#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {31636#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,497 INFO L272 TraceCheckUtils]: 51: Hoare triple {31636#(<= ~counter~0 5)} 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)); {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {31636#(<= ~counter~0 5)} ~cond := #in~cond; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {31636#(<= ~counter~0 5)} assume !(0 == ~cond); {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {31636#(<= ~counter~0 5)} assume true; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,498 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31636#(<= ~counter~0 5)} {31636#(<= ~counter~0 5)} #94#return; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,498 INFO L290 TraceCheckUtils]: 56: Hoare triple {31636#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {31636#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {31661#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,499 INFO L272 TraceCheckUtils]: 59: Hoare triple {31661#(<= ~counter~0 6)} 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)); {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,499 INFO L290 TraceCheckUtils]: 60: Hoare triple {31661#(<= ~counter~0 6)} ~cond := #in~cond; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {31661#(<= ~counter~0 6)} assume !(0 == ~cond); {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {31661#(<= ~counter~0 6)} assume true; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,500 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31661#(<= ~counter~0 6)} {31661#(<= ~counter~0 6)} #96#return; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {31661#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {31661#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {31686#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,501 INFO L272 TraceCheckUtils]: 67: Hoare triple {31686#(<= ~counter~0 7)} 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)); {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,502 INFO L290 TraceCheckUtils]: 68: Hoare triple {31686#(<= ~counter~0 7)} ~cond := #in~cond; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,502 INFO L290 TraceCheckUtils]: 69: Hoare triple {31686#(<= ~counter~0 7)} assume !(0 == ~cond); {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,502 INFO L290 TraceCheckUtils]: 70: Hoare triple {31686#(<= ~counter~0 7)} assume true; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,502 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31686#(<= ~counter~0 7)} {31686#(<= ~counter~0 7)} #96#return; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {31686#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {31686#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {31711#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,503 INFO L272 TraceCheckUtils]: 75: Hoare triple {31711#(<= ~counter~0 8)} 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)); {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {31711#(<= ~counter~0 8)} ~cond := #in~cond; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {31711#(<= ~counter~0 8)} assume !(0 == ~cond); {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {31711#(<= ~counter~0 8)} assume true; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,504 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31711#(<= ~counter~0 8)} {31711#(<= ~counter~0 8)} #96#return; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,505 INFO L290 TraceCheckUtils]: 80: Hoare triple {31711#(<= ~counter~0 8)} assume !(~r~0 > 0); {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,505 INFO L290 TraceCheckUtils]: 81: Hoare triple {31711#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,505 INFO L290 TraceCheckUtils]: 82: Hoare triple {31736#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,506 INFO L272 TraceCheckUtils]: 83: Hoare triple {31736#(<= ~counter~0 9)} 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)); {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,506 INFO L290 TraceCheckUtils]: 84: Hoare triple {31736#(<= ~counter~0 9)} ~cond := #in~cond; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,506 INFO L290 TraceCheckUtils]: 85: Hoare triple {31736#(<= ~counter~0 9)} assume !(0 == ~cond); {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,506 INFO L290 TraceCheckUtils]: 86: Hoare triple {31736#(<= ~counter~0 9)} assume true; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,507 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31736#(<= ~counter~0 9)} {31736#(<= ~counter~0 9)} #98#return; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,507 INFO L290 TraceCheckUtils]: 88: Hoare triple {31736#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,507 INFO L290 TraceCheckUtils]: 89: Hoare triple {31736#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31761#(<= |main_#t~post8| 9)} is VALID [2022-04-15 08:59:22,507 INFO L290 TraceCheckUtils]: 90: Hoare triple {31761#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {31480#false} is VALID [2022-04-15 08:59:22,507 INFO L290 TraceCheckUtils]: 91: Hoare triple {31480#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31480#false} is VALID [2022-04-15 08:59:22,507 INFO L290 TraceCheckUtils]: 92: Hoare triple {31480#false} assume !(#t~post6 < 10);havoc #t~post6; {31480#false} is VALID [2022-04-15 08:59:22,507 INFO L272 TraceCheckUtils]: 93: Hoare triple {31480#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)); {31480#false} is VALID [2022-04-15 08:59:22,508 INFO L290 TraceCheckUtils]: 94: Hoare triple {31480#false} ~cond := #in~cond; {31480#false} is VALID [2022-04-15 08:59:22,508 INFO L290 TraceCheckUtils]: 95: Hoare triple {31480#false} assume 0 == ~cond; {31480#false} is VALID [2022-04-15 08:59:22,508 INFO L290 TraceCheckUtils]: 96: Hoare triple {31480#false} assume !false; {31480#false} is VALID [2022-04-15 08:59:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:59:22,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:22,757 INFO L290 TraceCheckUtils]: 96: Hoare triple {31480#false} assume !false; {31480#false} is VALID [2022-04-15 08:59:22,757 INFO L290 TraceCheckUtils]: 95: Hoare triple {31480#false} assume 0 == ~cond; {31480#false} is VALID [2022-04-15 08:59:22,757 INFO L290 TraceCheckUtils]: 94: Hoare triple {31480#false} ~cond := #in~cond; {31480#false} is VALID [2022-04-15 08:59:22,757 INFO L272 TraceCheckUtils]: 93: Hoare triple {31480#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)); {31480#false} is VALID [2022-04-15 08:59:22,757 INFO L290 TraceCheckUtils]: 92: Hoare triple {31480#false} assume !(#t~post6 < 10);havoc #t~post6; {31480#false} is VALID [2022-04-15 08:59:22,757 INFO L290 TraceCheckUtils]: 91: Hoare triple {31480#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31480#false} is VALID [2022-04-15 08:59:22,757 INFO L290 TraceCheckUtils]: 90: Hoare triple {31761#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {31480#false} is VALID [2022-04-15 08:59:22,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {31736#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31761#(<= |main_#t~post8| 9)} is VALID [2022-04-15 08:59:22,758 INFO L290 TraceCheckUtils]: 88: Hoare triple {31736#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,758 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31479#true} {31736#(<= ~counter~0 9)} #98#return; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,758 INFO L290 TraceCheckUtils]: 85: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,758 INFO L290 TraceCheckUtils]: 84: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,758 INFO L272 TraceCheckUtils]: 83: Hoare triple {31736#(<= ~counter~0 9)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,758 INFO L290 TraceCheckUtils]: 82: Hoare triple {31736#(<= ~counter~0 9)} assume !!(#t~post8 < 10);havoc #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {31711#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31736#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:22,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {31711#(<= ~counter~0 8)} assume !(~r~0 > 0); {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,760 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31479#true} {31711#(<= ~counter~0 8)} #96#return; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,760 INFO L290 TraceCheckUtils]: 78: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,760 INFO L290 TraceCheckUtils]: 77: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,760 INFO L290 TraceCheckUtils]: 76: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,760 INFO L272 TraceCheckUtils]: 75: Hoare triple {31711#(<= ~counter~0 8)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {31711#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,761 INFO L290 TraceCheckUtils]: 73: Hoare triple {31686#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31711#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:22,761 INFO L290 TraceCheckUtils]: 72: Hoare triple {31686#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,761 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31479#true} {31686#(<= ~counter~0 7)} #96#return; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,761 INFO L272 TraceCheckUtils]: 67: Hoare triple {31686#(<= ~counter~0 7)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {31686#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {31661#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31686#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:22,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {31661#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,762 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31479#true} {31661#(<= ~counter~0 6)} #96#return; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,763 INFO L290 TraceCheckUtils]: 60: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,763 INFO L272 TraceCheckUtils]: 59: Hoare triple {31661#(<= ~counter~0 6)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,763 INFO L290 TraceCheckUtils]: 58: Hoare triple {31661#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {31636#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31661#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:22,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {31636#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,764 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31479#true} {31636#(<= ~counter~0 5)} #94#return; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,764 INFO L272 TraceCheckUtils]: 51: Hoare triple {31636#(<= ~counter~0 5)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {31636#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {31611#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31636#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:22,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {31611#(<= ~counter~0 4)} assume !(~r~0 < 0); {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,765 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31479#true} {31611#(<= ~counter~0 4)} #98#return; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,765 INFO L290 TraceCheckUtils]: 46: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,765 INFO L272 TraceCheckUtils]: 43: Hoare triple {31611#(<= ~counter~0 4)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {31611#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {31586#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31611#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:22,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {31586#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,766 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31479#true} {31586#(<= ~counter~0 3)} #98#return; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,767 INFO L272 TraceCheckUtils]: 35: Hoare triple {31586#(<= ~counter~0 3)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {31586#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {31561#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {31586#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:22,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {31561#(<= ~counter~0 2)} assume !(~r~0 > 0); {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,768 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31479#true} {31561#(<= ~counter~0 2)} #96#return; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,768 INFO L290 TraceCheckUtils]: 28: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,768 INFO L272 TraceCheckUtils]: 27: Hoare triple {31561#(<= ~counter~0 2)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {31561#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {31536#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {31561#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:22,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {31536#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31479#true} {31536#(<= ~counter~0 1)} #94#return; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,769 INFO L272 TraceCheckUtils]: 19: Hoare triple {31536#(<= ~counter~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)); {31479#true} is VALID [2022-04-15 08:59:22,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {31536#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {31487#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31536#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:22,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {31487#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,771 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31479#true} {31487#(<= ~counter~0 0)} #92#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L272 TraceCheckUtils]: 11: Hoare triple {31487#(<= ~counter~0 0)} 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)); {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31479#true} {31487#(<= ~counter~0 0)} #90#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-15 08:59:22,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {31487#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {31479#true} is VALID [2022-04-15 08:59:22,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {31487#(<= ~counter~0 0)} 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; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {31487#(<= ~counter~0 0)} call #t~ret9 := main(); {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31487#(<= ~counter~0 0)} {31479#true} #102#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {31479#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);~counter~0 := 0; {31487#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:22,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {31479#true} call ULTIMATE.init(); {31479#true} is VALID [2022-04-15 08:59:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 08:59:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499996221] [2022-04-15 08:59:22,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622377707] [2022-04-15 08:59:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622377707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:22,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:22,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-15 08:59:22,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1397733795] [2022-04-15 08:59:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1397733795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:22,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 08:59:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653115215] [2022-04-15 08:59:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:22,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-15 08:59:22,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:22,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:22,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:22,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 08:59:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 08:59:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:59:22,828 INFO L87 Difference]: Start difference. First operand 342 states and 456 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:23,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:23,674 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-15 08:59:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 08:59:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 97 [2022-04-15 08:59:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 08:59:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 08:59:23,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-15 08:59:23,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:23,878 INFO L225 Difference]: With dead ends: 467 [2022-04-15 08:59:23,878 INFO L226 Difference]: Without dead ends: 352 [2022-04-15 08:59:23,878 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2022-04-15 08:59:23,879 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:23,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 230 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 08:59:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-15 08:59:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-15 08:59:24,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:24,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:24,453 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:24,454 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:24,459 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-15 08:59:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-15 08:59:24,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:24,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:24,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-15 08:59:24,460 INFO L87 Difference]: Start difference. First operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 352 states. [2022-04-15 08:59:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:24,465 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-15 08:59:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-15 08:59:24,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:24,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:24,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:24,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.2101167315175096) internal successors, (311), 261 states have internal predecessors, (311), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-15 08:59:24,473 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-15 08:59:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:24,473 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-15 08:59:24,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:24,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-15 08:59:27,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 456 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-15 08:59:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 08:59:27,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:27,326 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:59:27,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:27,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 08:59:27,526 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-15 08:59:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:27,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650190106] [2022-04-15 08:59:27,527 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-15 08:59:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:27,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518428367] [2022-04-15 08:59:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:27,537 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:27,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [859319123] [2022-04-15 08:59:27,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 08:59:27,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:27,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:27,557 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:27,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 08:59:27,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 08:59:27,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:27,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 08:59:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:27,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:27,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {34413#true} call ULTIMATE.init(); {34413#true} is VALID [2022-04-15 08:59:27,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {34413#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);~counter~0 := 0; {34413#true} is VALID [2022-04-15 08:59:27,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34413#true} {34413#true} #102#return; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {34413#true} call #t~ret9 := main(); {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {34413#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; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {34413#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34413#true} {34413#true} #90#return; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34413#true} {34413#true} #92#return; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {34413#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {34413#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {34413#true} assume !!(#t~post6 < 10);havoc #t~post6; {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L272 TraceCheckUtils]: 19: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34413#true} {34413#true} #94#return; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {34413#true} assume !!(0 != ~r~0); {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L272 TraceCheckUtils]: 27: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {34413#true} assume !(~r~0 > 0); {34413#true} is VALID [2022-04-15 08:59:27,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {34413#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {34413#true} assume !!(#t~post8 < 10);havoc #t~post8; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L272 TraceCheckUtils]: 35: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34413#true} {34413#true} #98#return; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {34413#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {34413#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {34413#true} assume !!(#t~post8 < 10);havoc #t~post8; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L272 TraceCheckUtils]: 43: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34413#true} {34413#true} #98#return; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {34413#true} assume !(~r~0 < 0); {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {34413#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {34413#true} assume !!(#t~post6 < 10);havoc #t~post6; {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L272 TraceCheckUtils]: 51: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34413#true} {34413#true} #94#return; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {34413#true} assume !!(0 != ~r~0); {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L272 TraceCheckUtils]: 59: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {34413#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 66: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L272 TraceCheckUtils]: 67: Hoare triple {34413#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)); {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 68: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 69: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,882 INFO L290 TraceCheckUtils]: 70: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,883 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-15 08:59:27,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {34413#true} assume !(~r~0 > 0); {34634#(not (< 0 main_~r~0))} is VALID [2022-04-15 08:59:27,883 INFO L290 TraceCheckUtils]: 73: Hoare triple {34634#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34634#(not (< 0 main_~r~0))} is VALID [2022-04-15 08:59:27,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {34634#(not (< 0 main_~r~0))} assume !!(#t~post8 < 10);havoc #t~post8; {34634#(not (< 0 main_~r~0))} is VALID [2022-04-15 08:59:27,884 INFO L272 TraceCheckUtils]: 75: Hoare triple {34634#(not (< 0 main_~r~0))} 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)); {34413#true} is VALID [2022-04-15 08:59:27,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,885 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34413#true} {34634#(not (< 0 main_~r~0))} #98#return; {34634#(not (< 0 main_~r~0))} is VALID [2022-04-15 08:59:27,885 INFO L290 TraceCheckUtils]: 80: Hoare triple {34634#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:59:27,885 INFO L290 TraceCheckUtils]: 81: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:59:27,886 INFO L290 TraceCheckUtils]: 82: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:59:27,886 INFO L272 TraceCheckUtils]: 83: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} 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)); {34413#true} is VALID [2022-04-15 08:59:27,886 INFO L290 TraceCheckUtils]: 84: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-15 08:59:27,886 INFO L290 TraceCheckUtils]: 85: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-15 08:59:27,886 INFO L290 TraceCheckUtils]: 86: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-15 08:59:27,886 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34413#true} {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 88: Hoare triple {34659#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {34414#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 90: Hoare triple {34414#false} assume !(#t~post7 < 10);havoc #t~post7; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {34414#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 92: Hoare triple {34414#false} assume !(#t~post8 < 10);havoc #t~post8; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {34414#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 94: Hoare triple {34414#false} assume !(#t~post6 < 10);havoc #t~post6; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L272 TraceCheckUtils]: 95: Hoare triple {34414#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)); {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 96: Hoare triple {34414#false} ~cond := #in~cond; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 97: Hoare triple {34414#false} assume 0 == ~cond; {34414#false} is VALID [2022-04-15 08:59:27,887 INFO L290 TraceCheckUtils]: 98: Hoare triple {34414#false} assume !false; {34414#false} is VALID [2022-04-15 08:59:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-15 08:59:27,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 08:59:27,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:27,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518428367] [2022-04-15 08:59:27,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:27,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859319123] [2022-04-15 08:59:27,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859319123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:27,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:27,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:27,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:27,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650190106] [2022-04-15 08:59:27,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650190106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:27,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:27,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 08:59:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052778468] [2022-04-15 08:59:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:27,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 08:59:27,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:27,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:27,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:27,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 08:59:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 08:59:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:59:27,930 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:28,676 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-15 08:59:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 08:59:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 08:59:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 08:59:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 08:59:28,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 08:59:28,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:28,752 INFO L225 Difference]: With dead ends: 504 [2022-04-15 08:59:28,752 INFO L226 Difference]: Without dead ends: 362 [2022-04-15 08:59:28,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 08:59:28,752 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:28,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 08:59:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-15 08:59:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-15 08:59:29,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:29,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:29,229 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:29,229 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:29,235 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-15 08:59:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-15 08:59:29,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:29,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:29,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-15 08:59:29,236 INFO L87 Difference]: Start difference. First operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 362 states. [2022-04-15 08:59:29,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:29,242 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-15 08:59:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-15 08:59:29,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:29,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:29,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:29,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 265 states have (on average 1.2150943396226415) internal successors, (322), 269 states have internal predecessors, (322), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-15 08:59:29,249 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-15 08:59:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:29,249 INFO L478 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-15 08:59:29,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 08:59:29,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-15 08:59:30,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-15 08:59:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 08:59:30,803 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:30,803 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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-15 08:59:30,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:31,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 08:59:31,003 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:31,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-15 08:59:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:31,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [788531038] [2022-04-15 08:59:31,004 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-15 08:59:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:31,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441035810] [2022-04-15 08:59:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:31,015 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:31,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573434018] [2022-04-15 08:59:31,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:59:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:31,016 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:31,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 08:59:31,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:59:31,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 08:59:31,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 08:59:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 08:59:31,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 08:59:31,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {37149#true} call ULTIMATE.init(); {37149#true} is VALID [2022-04-15 08:59:31,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {37149#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);~counter~0 := 0; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37157#(<= ~counter~0 0)} {37149#true} #102#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {37157#(<= ~counter~0 0)} call #t~ret9 := main(); {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {37157#(<= ~counter~0 0)} 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; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {37157#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {37157#(<= ~counter~0 0)} ~cond := #in~cond; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {37157#(<= ~counter~0 0)} assume !(0 == ~cond); {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37157#(<= ~counter~0 0)} {37157#(<= ~counter~0 0)} #90#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,560 INFO L272 TraceCheckUtils]: 11: Hoare triple {37157#(<= ~counter~0 0)} 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)); {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {37157#(<= ~counter~0 0)} ~cond := #in~cond; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {37157#(<= ~counter~0 0)} assume !(0 == ~cond); {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,561 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37157#(<= ~counter~0 0)} {37157#(<= ~counter~0 0)} #92#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {37157#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:31,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {37157#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {37206#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,563 INFO L272 TraceCheckUtils]: 19: Hoare triple {37206#(<= ~counter~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)); {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {37206#(<= ~counter~0 1)} ~cond := #in~cond; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(<= ~counter~0 1)} assume !(0 == ~cond); {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(<= ~counter~0 1)} assume true; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,564 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37206#(<= ~counter~0 1)} {37206#(<= ~counter~0 1)} #94#return; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {37206#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:31,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {37206#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {37231#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,565 INFO L272 TraceCheckUtils]: 27: Hoare triple {37231#(<= ~counter~0 2)} 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)); {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {37231#(<= ~counter~0 2)} ~cond := #in~cond; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {37231#(<= ~counter~0 2)} assume !(0 == ~cond); {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {37231#(<= ~counter~0 2)} assume true; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,567 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37231#(<= ~counter~0 2)} {37231#(<= ~counter~0 2)} #96#return; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {37231#(<= ~counter~0 2)} assume !(~r~0 > 0); {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:31,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {37231#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {37256#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,568 INFO L272 TraceCheckUtils]: 35: Hoare triple {37256#(<= ~counter~0 3)} 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)); {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {37256#(<= ~counter~0 3)} ~cond := #in~cond; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {37256#(<= ~counter~0 3)} assume !(0 == ~cond); {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {37256#(<= ~counter~0 3)} assume true; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,570 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37256#(<= ~counter~0 3)} {37256#(<= ~counter~0 3)} #98#return; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {37256#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {37256#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {37281#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,571 INFO L272 TraceCheckUtils]: 43: Hoare triple {37281#(<= ~counter~0 4)} 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)); {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {37281#(<= ~counter~0 4)} ~cond := #in~cond; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {37281#(<= ~counter~0 4)} assume !(0 == ~cond); {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {37281#(<= ~counter~0 4)} assume true; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,572 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37281#(<= ~counter~0 4)} {37281#(<= ~counter~0 4)} #98#return; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,573 INFO L290 TraceCheckUtils]: 48: Hoare triple {37281#(<= ~counter~0 4)} assume !(~r~0 < 0); {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,573 INFO L290 TraceCheckUtils]: 49: Hoare triple {37281#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,573 INFO L290 TraceCheckUtils]: 50: Hoare triple {37306#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,574 INFO L272 TraceCheckUtils]: 51: Hoare triple {37306#(<= ~counter~0 5)} 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)); {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,574 INFO L290 TraceCheckUtils]: 52: Hoare triple {37306#(<= ~counter~0 5)} ~cond := #in~cond; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,574 INFO L290 TraceCheckUtils]: 53: Hoare triple {37306#(<= ~counter~0 5)} assume !(0 == ~cond); {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,575 INFO L290 TraceCheckUtils]: 54: Hoare triple {37306#(<= ~counter~0 5)} assume true; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,575 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37306#(<= ~counter~0 5)} {37306#(<= ~counter~0 5)} #94#return; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,575 INFO L290 TraceCheckUtils]: 56: Hoare triple {37306#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {37306#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {37331#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,577 INFO L272 TraceCheckUtils]: 59: Hoare triple {37331#(<= ~counter~0 6)} 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)); {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {37331#(<= ~counter~0 6)} ~cond := #in~cond; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,577 INFO L290 TraceCheckUtils]: 61: Hoare triple {37331#(<= ~counter~0 6)} assume !(0 == ~cond); {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,577 INFO L290 TraceCheckUtils]: 62: Hoare triple {37331#(<= ~counter~0 6)} assume true; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,578 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37331#(<= ~counter~0 6)} {37331#(<= ~counter~0 6)} #96#return; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,578 INFO L290 TraceCheckUtils]: 64: Hoare triple {37331#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,579 INFO L290 TraceCheckUtils]: 65: Hoare triple {37331#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,579 INFO L290 TraceCheckUtils]: 66: Hoare triple {37356#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,579 INFO L272 TraceCheckUtils]: 67: Hoare triple {37356#(<= ~counter~0 7)} 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)); {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {37356#(<= ~counter~0 7)} ~cond := #in~cond; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,580 INFO L290 TraceCheckUtils]: 69: Hoare triple {37356#(<= ~counter~0 7)} assume !(0 == ~cond); {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,580 INFO L290 TraceCheckUtils]: 70: Hoare triple {37356#(<= ~counter~0 7)} assume true; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,581 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37356#(<= ~counter~0 7)} {37356#(<= ~counter~0 7)} #96#return; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,581 INFO L290 TraceCheckUtils]: 72: Hoare triple {37356#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,581 INFO L290 TraceCheckUtils]: 73: Hoare triple {37356#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {37381#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,582 INFO L272 TraceCheckUtils]: 75: Hoare triple {37381#(<= ~counter~0 8)} 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)); {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {37381#(<= ~counter~0 8)} ~cond := #in~cond; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,583 INFO L290 TraceCheckUtils]: 77: Hoare triple {37381#(<= ~counter~0 8)} assume !(0 == ~cond); {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,583 INFO L290 TraceCheckUtils]: 78: Hoare triple {37381#(<= ~counter~0 8)} assume true; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,583 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37381#(<= ~counter~0 8)} {37381#(<= ~counter~0 8)} #96#return; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {37381#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {37381#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {37406#(<= ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,585 INFO L272 TraceCheckUtils]: 83: Hoare triple {37406#(<= ~counter~0 9)} 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)); {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {37406#(<= ~counter~0 9)} ~cond := #in~cond; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {37406#(<= ~counter~0 9)} assume !(0 == ~cond); {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {37406#(<= ~counter~0 9)} assume true; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,586 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37406#(<= ~counter~0 9)} {37406#(<= ~counter~0 9)} #96#return; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {37406#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {37406#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37431#(<= |main_#t~post7| 9)} is VALID [2022-04-15 08:59:31,587 INFO L290 TraceCheckUtils]: 90: Hoare triple {37431#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {37150#false} is VALID [2022-04-15 08:59:31,587 INFO L290 TraceCheckUtils]: 91: Hoare triple {37150#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37150#false} is VALID [2022-04-15 08:59:31,587 INFO L290 TraceCheckUtils]: 92: Hoare triple {37150#false} assume !(#t~post8 < 10);havoc #t~post8; {37150#false} is VALID [2022-04-15 08:59:31,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {37150#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37150#false} is VALID [2022-04-15 08:59:31,587 INFO L290 TraceCheckUtils]: 94: Hoare triple {37150#false} assume !(#t~post6 < 10);havoc #t~post6; {37150#false} is VALID [2022-04-15 08:59:31,588 INFO L272 TraceCheckUtils]: 95: Hoare triple {37150#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)); {37150#false} is VALID [2022-04-15 08:59:31,588 INFO L290 TraceCheckUtils]: 96: Hoare triple {37150#false} ~cond := #in~cond; {37150#false} is VALID [2022-04-15 08:59:31,588 INFO L290 TraceCheckUtils]: 97: Hoare triple {37150#false} assume 0 == ~cond; {37150#false} is VALID [2022-04-15 08:59:31,588 INFO L290 TraceCheckUtils]: 98: Hoare triple {37150#false} assume !false; {37150#false} is VALID [2022-04-15 08:59:31,588 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 08:59:31,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 08:59:31,984 INFO L290 TraceCheckUtils]: 98: Hoare triple {37150#false} assume !false; {37150#false} is VALID [2022-04-15 08:59:31,984 INFO L290 TraceCheckUtils]: 97: Hoare triple {37150#false} assume 0 == ~cond; {37150#false} is VALID [2022-04-15 08:59:31,984 INFO L290 TraceCheckUtils]: 96: Hoare triple {37150#false} ~cond := #in~cond; {37150#false} is VALID [2022-04-15 08:59:31,984 INFO L272 TraceCheckUtils]: 95: Hoare triple {37150#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)); {37150#false} is VALID [2022-04-15 08:59:31,985 INFO L290 TraceCheckUtils]: 94: Hoare triple {37150#false} assume !(#t~post6 < 10);havoc #t~post6; {37150#false} is VALID [2022-04-15 08:59:31,985 INFO L290 TraceCheckUtils]: 93: Hoare triple {37150#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37150#false} is VALID [2022-04-15 08:59:31,985 INFO L290 TraceCheckUtils]: 92: Hoare triple {37150#false} assume !(#t~post8 < 10);havoc #t~post8; {37150#false} is VALID [2022-04-15 08:59:31,985 INFO L290 TraceCheckUtils]: 91: Hoare triple {37150#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37150#false} is VALID [2022-04-15 08:59:31,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {37431#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {37150#false} is VALID [2022-04-15 08:59:31,987 INFO L290 TraceCheckUtils]: 89: Hoare triple {37406#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37431#(<= |main_#t~post7| 9)} is VALID [2022-04-15 08:59:31,987 INFO L290 TraceCheckUtils]: 88: Hoare triple {37406#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,988 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37149#true} {37406#(<= ~counter~0 9)} #96#return; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,988 INFO L290 TraceCheckUtils]: 85: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,988 INFO L290 TraceCheckUtils]: 84: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,988 INFO L272 TraceCheckUtils]: 83: Hoare triple {37406#(<= ~counter~0 9)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,988 INFO L290 TraceCheckUtils]: 82: Hoare triple {37406#(<= ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,989 INFO L290 TraceCheckUtils]: 81: Hoare triple {37381#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37406#(<= ~counter~0 9)} is VALID [2022-04-15 08:59:31,989 INFO L290 TraceCheckUtils]: 80: Hoare triple {37381#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,990 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37149#true} {37381#(<= ~counter~0 8)} #96#return; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,990 INFO L290 TraceCheckUtils]: 78: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,990 INFO L290 TraceCheckUtils]: 76: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,990 INFO L272 TraceCheckUtils]: 75: Hoare triple {37381#(<= ~counter~0 8)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {37381#(<= ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,991 INFO L290 TraceCheckUtils]: 73: Hoare triple {37356#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37381#(<= ~counter~0 8)} is VALID [2022-04-15 08:59:31,991 INFO L290 TraceCheckUtils]: 72: Hoare triple {37356#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,991 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37149#true} {37356#(<= ~counter~0 7)} #96#return; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,992 INFO L290 TraceCheckUtils]: 68: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,992 INFO L272 TraceCheckUtils]: 67: Hoare triple {37356#(<= ~counter~0 7)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,992 INFO L290 TraceCheckUtils]: 66: Hoare triple {37356#(<= ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,992 INFO L290 TraceCheckUtils]: 65: Hoare triple {37331#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37356#(<= ~counter~0 7)} is VALID [2022-04-15 08:59:31,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {37331#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,993 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37149#true} {37331#(<= ~counter~0 6)} #96#return; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,993 INFO L272 TraceCheckUtils]: 59: Hoare triple {37331#(<= ~counter~0 6)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {37331#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {37306#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37331#(<= ~counter~0 6)} is VALID [2022-04-15 08:59:31,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {37306#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,995 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37149#true} {37306#(<= ~counter~0 5)} #94#return; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,995 INFO L272 TraceCheckUtils]: 51: Hoare triple {37306#(<= ~counter~0 5)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,995 INFO L290 TraceCheckUtils]: 50: Hoare triple {37306#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {37281#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37306#(<= ~counter~0 5)} is VALID [2022-04-15 08:59:31,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {37281#(<= ~counter~0 4)} assume !(~r~0 < 0); {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,997 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37149#true} {37281#(<= ~counter~0 4)} #98#return; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,997 INFO L290 TraceCheckUtils]: 46: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,997 INFO L290 TraceCheckUtils]: 45: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,997 INFO L272 TraceCheckUtils]: 43: Hoare triple {37281#(<= ~counter~0 4)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {37281#(<= ~counter~0 4)} assume !!(#t~post8 < 10);havoc #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {37256#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37281#(<= ~counter~0 4)} is VALID [2022-04-15 08:59:31,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {37256#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,998 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37149#true} {37256#(<= ~counter~0 3)} #98#return; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:31,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:31,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:31,998 INFO L272 TraceCheckUtils]: 35: Hoare triple {37256#(<= ~counter~0 3)} 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)); {37149#true} is VALID [2022-04-15 08:59:31,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {37256#(<= ~counter~0 3)} assume !!(#t~post8 < 10);havoc #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {37231#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37256#(<= ~counter~0 3)} is VALID [2022-04-15 08:59:31,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {37231#(<= ~counter~0 2)} assume !(~r~0 > 0); {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:32,000 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37149#true} {37231#(<= ~counter~0 2)} #96#return; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:32,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:32,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:32,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:32,000 INFO L272 TraceCheckUtils]: 27: Hoare triple {37231#(<= ~counter~0 2)} 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)); {37149#true} is VALID [2022-04-15 08:59:32,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {37231#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:32,001 INFO L290 TraceCheckUtils]: 25: Hoare triple {37206#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37231#(<= ~counter~0 2)} is VALID [2022-04-15 08:59:32,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {37206#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:32,002 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37149#true} {37206#(<= ~counter~0 1)} #94#return; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:32,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:32,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:32,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:32,002 INFO L272 TraceCheckUtils]: 19: Hoare triple {37206#(<= ~counter~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)); {37149#true} is VALID [2022-04-15 08:59:32,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {37206#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:32,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {37157#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37206#(<= ~counter~0 1)} is VALID [2022-04-15 08:59:32,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {37157#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37149#true} {37157#(<= ~counter~0 0)} #92#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:32,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L272 TraceCheckUtils]: 11: Hoare triple {37157#(<= ~counter~0 0)} 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)); {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37149#true} {37157#(<= ~counter~0 0)} #90#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {37157#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {37149#true} is VALID [2022-04-15 08:59:32,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {37157#(<= ~counter~0 0)} 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; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {37157#(<= ~counter~0 0)} call #t~ret9 := main(); {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37157#(<= ~counter~0 0)} {37149#true} #102#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {37149#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);~counter~0 := 0; {37157#(<= ~counter~0 0)} is VALID [2022-04-15 08:59:32,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {37149#true} call ULTIMATE.init(); {37149#true} is VALID [2022-04-15 08:59:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 08:59:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 08:59:32,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441035810] [2022-04-15 08:59:32,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 08:59:32,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573434018] [2022-04-15 08:59:32,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573434018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 08:59:32,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 08:59:32,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-15 08:59:32,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 08:59:32,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [788531038] [2022-04-15 08:59:32,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [788531038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 08:59:32,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 08:59:32,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 08:59:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393877111] [2022-04-15 08:59:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 08:59:32,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-15 08:59:32,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 08:59:32,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:32,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:32,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 08:59:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:32,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 08:59:32,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-15 08:59:32,075 INFO L87 Difference]: Start difference. First operand 352 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:33,171 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-15 08:59:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 08:59:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 99 [2022-04-15 08:59:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 08:59:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 08:59:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 08:59:33,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-15 08:59:33,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:33,377 INFO L225 Difference]: With dead ends: 471 [2022-04-15 08:59:33,377 INFO L226 Difference]: Without dead ends: 364 [2022-04-15 08:59:33,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=264, Unknown=0, NotChecked=0, Total=420 [2022-04-15 08:59:33,378 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 100 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 08:59:33,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 246 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 08:59:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-15 08:59:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-15 08:59:33,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 08:59:33,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:33,891 INFO L74 IsIncluded]: Start isIncluded. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:33,892 INFO L87 Difference]: Start difference. First operand 364 states. Second operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:33,897 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-15 08:59:33,897 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-15 08:59:33,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:33,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:33,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-15 08:59:33,898 INFO L87 Difference]: Start difference. First operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 364 states. [2022-04-15 08:59:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 08:59:33,904 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-15 08:59:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-15 08:59:33,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 08:59:33,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 08:59:33,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 08:59:33,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 08:59:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.2057761732851986) internal successors, (334), 277 states have internal predecessors, (334), 74 states have call successors, (74), 14 states have call predecessors, (74), 12 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 08:59:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-15 08:59:33,911 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-15 08:59:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 08:59:33,912 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-15 08:59:33,912 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 12 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-15 08:59:33,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-15 08:59:36,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 479 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 08:59:36,759 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-15 08:59:36,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 08:59:36,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 08:59:36,760 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 08:59:36,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:36,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:36,975 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 08:59:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 08:59:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-15 08:59:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 08:59:36,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963025059] [2022-04-15 08:59:36,975 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 08:59:36,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-15 08:59:36,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 08:59:36,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625573443] [2022-04-15 08:59:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 08:59:36,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 08:59:36,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 08:59:36,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1779819640] [2022-04-15 08:59:36,997 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 08:59:36,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:36,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 08:59:37,000 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 08:59:37,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 08:59:37,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 08:59:37,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 08:59:37,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 08:59:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 08:59:37,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 08:59:37,108 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 08:59:37,108 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 08:59:37,110 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 08:59:37,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 08:59:37,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 08:59:37,345 INFO L719 BasicCegarLoop]: Path program histogram: [10, 8, 8, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 08:59:37,347 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 08:59:37,358 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 08:59:37,359 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 08:59:37,360 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 08:59:37,360 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 08:59:37,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 08:59:37 BoogieIcfgContainer [2022-04-15 08:59:37,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 08:59:37,362 INFO L158 Benchmark]: Toolchain (without parser) took 121493.32ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 174.7MB in the beginning and 179.3MB in the end (delta: -4.6MB). Peak memory consumption was 42.4MB. Max. memory is 8.0GB. [2022-04-15 08:59:37,362 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 230.7MB. Free memory was 190.8MB in the beginning and 190.7MB in the end (delta: 66.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 08:59:37,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.93ms. Allocated memory is still 230.7MB. Free memory was 174.5MB in the beginning and 201.5MB in the end (delta: -27.0MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-04-15 08:59:37,362 INFO L158 Benchmark]: Boogie Preprocessor took 19.23ms. Allocated memory is still 230.7MB. Free memory was 201.5MB in the beginning and 200.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 08:59:37,362 INFO L158 Benchmark]: RCFGBuilder took 223.18ms. Allocated memory is still 230.7MB. Free memory was 200.1MB in the beginning and 187.6MB in the end (delta: 12.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 08:59:37,362 INFO L158 Benchmark]: TraceAbstraction took 121008.56ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 186.9MB in the beginning and 179.3MB in the end (delta: 7.6MB). Peak memory consumption was 54.9MB. Max. memory is 8.0GB. [2022-04-15 08:59:37,363 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 230.7MB. Free memory was 190.8MB in the beginning and 190.7MB in the end (delta: 66.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.93ms. Allocated memory is still 230.7MB. Free memory was 174.5MB in the beginning and 201.5MB in the end (delta: -27.0MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.23ms. Allocated memory is still 230.7MB. Free memory was 201.5MB in the beginning and 200.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 223.18ms. Allocated memory is still 230.7MB. Free memory was 200.1MB in the beginning and 187.6MB in the end (delta: 12.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 121008.56ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 186.9MB in the beginning and 179.3MB in the end (delta: 7.6MB). Peak memory consumption was 54.9MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) [L9] COND FALSE !(!cond) [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) [L27] CALL assume_abort_if_not(A % 2 == 1) [L9] COND FALSE !(!cond) [L27] RET assume_abort_if_not(A % 2 == 1) [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND TRUE !(r > 0) [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND TRUE !(r < 0) [L34] EXPR counter++ [L34] COND TRUE counter++<10 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 [L39] EXPR counter++ [L39] COND TRUE counter++<10 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L41] COND TRUE !(r > 0) [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 [L47] EXPR counter++ [L47] COND TRUE counter++<10 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L49] COND TRUE !(r < 0) [L34] EXPR counter++ [L34] COND FALSE !(counter++<10) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 121.0s, OverallIterations: 31, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.1s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1484 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 4800 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3376 mSDsCounter, 1106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1106 mSolverCounterUnsat, 1424 mSDtfsCounter, 1698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3562 GetRequests, 3201 SyntacticMatches, 16 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=30, InterpolantAutomatonStates: 323, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 112 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 08:59:37,390 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...