/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-fb4f59a-m [2022-04-28 05:55:21,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:55:21,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:55:21,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:55:21,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:55:21,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:55:21,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:55:21,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:55:21,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:55:21,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:55:21,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:55:21,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:55:21,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:55:21,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:55:21,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:55:21,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:55:21,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:55:21,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:55:21,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:55:21,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:55:21,337 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:55:21,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:55:21,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:55:21,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:55:21,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:55:21,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:55:21,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:55:21,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:55:21,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:55:21,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:55:21,345 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:55:21,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:55:21,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:55:21,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:55:21,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:55:21,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:55:21,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:55:21,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:55:21,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:55:21,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:55:21,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:55:21,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:55:21,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:55:21,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:55:21,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:55:21,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:55:21,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:55:21,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:55:21,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:55:21,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:55:21,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:55:21,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:55:21,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:55:21,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:55:21,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:55:21,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:55:21,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:55:21,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:55:21,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:55:21,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:55:21,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:55:21,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:55:21,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:55:21,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:55:21,362 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:55:21,362 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:55:21,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:55:21,362 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:55:21,362 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 05:55:21,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:55:21,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:55:21,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:55:21,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:55:21,613 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:55:21,614 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-28 05:55:21,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8062880a/29f342897d9a408a8edf9014f48c8291/FLAGa85725ec1 [2022-04-28 05:55:22,032 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:55:22,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound10.c [2022-04-28 05:55:22,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8062880a/29f342897d9a408a8edf9014f48c8291/FLAGa85725ec1 [2022-04-28 05:55:22,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8062880a/29f342897d9a408a8edf9014f48c8291 [2022-04-28 05:55:22,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:55:22,053 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:55:22,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:55:22,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:55:22,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:55:22,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50069885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22, skipping insertion in model container [2022-04-28 05:55:22,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:55:22,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:55:22,220 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-28 05:55:22,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:55:22,253 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:55:22,264 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-28 05:55:22,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:55:22,287 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:55:22,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22 WrapperNode [2022-04-28 05:55:22,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:55:22,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:55:22,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:55:22,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:55:22,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:55:22,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:55:22,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:55:22,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:55:22,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (1/1) ... [2022-04-28 05:55:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:55:22,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:22,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 05:55:22,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 05:55:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:55:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:55:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:55:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:55:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:55:22,386 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:55:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:55:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:55:22,434 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:55:22,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:55:22,574 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:55:22,580 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:55:22,580 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 05:55:22,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:55:22 BoogieIcfgContainer [2022-04-28 05:55:22,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:55:22,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:55:22,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:55:22,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:55:22,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:55:22" (1/3) ... [2022-04-28 05:55:22,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2fe9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:55:22, skipping insertion in model container [2022-04-28 05:55:22,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:55:22" (2/3) ... [2022-04-28 05:55:22,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2fe9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:55:22, skipping insertion in model container [2022-04-28 05:55:22,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:55:22" (3/3) ... [2022-04-28 05:55:22,589 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound10.c [2022-04-28 05:55:22,600 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:55:22,601 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:55:22,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:55:22,645 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@559f3d0b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@af6672d [2022-04-28 05:55:22,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:55:22,653 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-28 05:55:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 05:55:22,659 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:22,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:22,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-28 05:55:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:22,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132002456] [2022-04-28 05:55:22,680 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-28 05:55:22,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:22,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833537663] [2022-04-28 05:55:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:22,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:22,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826264970] [2022-04-28 05:55:22,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:22,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:55:22,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 05:55:22,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:55:22,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:22,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 05:55:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:22,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:23,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-28 05:55:23,038 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-28 05:55:23,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:55:23,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-28 05:55:23,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-28 05:55:23,039 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-28 05:55:23,040 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-28 05:55:23,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:55:23,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-28 05:55:23,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 05:55:23,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-28 05:55:23,042 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-28 05:55:23,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 05:55:23,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 05:55:23,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 05:55:23,045 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-28 05:55:23,045 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-28 05:55:23,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 05:55:23,046 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-28 05:55:23,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 05:55:23,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 05:55:23,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 05:55:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 05:55:23,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:55:23,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:23,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833537663] [2022-04-28 05:55:23,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:23,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826264970] [2022-04-28 05:55:23,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826264970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:23,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:23,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:55:23,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:23,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2132002456] [2022-04-28 05:55:23,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2132002456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:23,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:23,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 05:55:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111653479] [2022-04-28 05:55:23,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 05:55:23,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:23,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:23,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 05:55:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 05:55:23,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:55:23,136 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-28 05:55:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:23,215 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-28 05:55:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 05:55:23,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 05:55:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:23,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:55:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 05:55:23,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-28 05:55:23,337 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-28 05:55:23,345 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:55:23,346 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 05:55:23,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 05:55:23,351 INFO L413 NwaCegarLoop]: 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-28 05:55:23,352 INFO L414 NwaCegarLoop]: 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-28 05:55:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 05:55:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 05:55:23,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:23,376 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-28 05:55:23,377 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-28 05:55:23,377 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-28 05:55:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:23,382 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:55:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:55:23,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:23,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:23,383 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-28 05:55:23,384 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-28 05:55:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:23,388 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 05:55:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:55:23,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:23,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:23,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:23,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:23,393 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-28 05:55:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 05:55:23,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-28 05:55:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:23,397 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 05:55:23,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:23,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 05:55:23,438 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-28 05:55:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 05:55:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:55:23,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:23,439 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:23,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:55:23,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 05:55:23,656 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-28 05:55:23,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979103226] [2022-04-28 05:55:23,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-28 05:55:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:23,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058051052] [2022-04-28 05:55:23,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:23,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:23,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710468568] [2022-04-28 05:55:23,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:23,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:55:23,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 05:55:23,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:55:23,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:23,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:55:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:23,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:23,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-28 05:55:23,897 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-28 05:55:23,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,899 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-28 05:55:23,900 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-28 05:55:23,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,902 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-28 05:55:23,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 05:55:23,905 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-28 05:55:23,906 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-28 05:55:23,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {370#false} is VALID [2022-04-28 05:55:23,907 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-28 05:55:23,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-28 05:55:23,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-28 05:55:23,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-28 05:55:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:55:23,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:55:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058051052] [2022-04-28 05:55:23,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:23,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710468568] [2022-04-28 05:55:23,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710468568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:23,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:23,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:55:23,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:23,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979103226] [2022-04-28 05:55:23,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979103226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:23,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:23,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:55:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41109419] [2022-04-28 05:55:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:23,912 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-28 05:55:23,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:23,912 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-28 05:55:23,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:23,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:55:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:55:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:55:23,932 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-28 05:55:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:24,018 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 05:55:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:55:24,019 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-28 05:55:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:24,020 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-28 05:55:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:55:24,032 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-28 05:55:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 05:55:24,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 05:55:24,085 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-28 05:55:24,090 INFO L225 Difference]: With dead ends: 41 [2022-04-28 05:55:24,090 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 05:55:24,091 INFO L412 NwaCegarLoop]: 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-28 05:55:24,097 INFO L413 NwaCegarLoop]: 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-28 05:55:24,097 INFO L414 NwaCegarLoop]: 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-28 05:55:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 05:55:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 05:55:24,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:24,119 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-28 05:55:24,120 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-28 05:55:24,121 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-28 05:55:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:24,124 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:55:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:55:24,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:24,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:24,125 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-28 05:55:24,127 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-28 05:55:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:24,132 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 05:55:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:55:24,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:24,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:24,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:24,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:24,133 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-28 05:55:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 05:55:24,140 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-28 05:55:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:24,140 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 05:55:24,140 INFO L496 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-28 05:55:24,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 05:55:24,191 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-28 05:55:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 05:55:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:55:24,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:24,193 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:24,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 05:55:24,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 05:55:24,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-28 05:55:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:24,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74070802] [2022-04-28 05:55:24,414 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-28 05:55:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:24,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581483364] [2022-04-28 05:55:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:24,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:24,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557329126] [2022-04-28 05:55:24,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:24,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:24,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:55:24,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 05:55:24,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:55:24,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:24,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:55:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:24,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:26,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-28 05:55:26,105 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-28 05:55:26,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:55:26,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-28 05:55:26,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-28 05:55:26,106 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-28 05:55:26,106 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-28 05:55:26,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:55:26,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:55:26,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:55:26,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-28 05:55:26,107 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-28 05:55:26,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 05:55:26,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 05:55:26,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 05:55:26,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-28 05:55:28,111 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-28 05:55:28,113 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-28 05:55:28,113 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-28 05:55:30,117 WARN 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 UNKNOWN [2022-04-28 05:55:30,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:30,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-28 05:55:30,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 05:55:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:55:30,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:55:30,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:30,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581483364] [2022-04-28 05:55:30,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:30,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557329126] [2022-04-28 05:55:30,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557329126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:30,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:30,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:55:30,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:30,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74070802] [2022-04-28 05:55:30,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74070802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:30,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:30,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:55:30,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504440373] [2022-04-28 05:55:30,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 05:55:30,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:30,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:31,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:31,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:55:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:31,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:55:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:55:31,967 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-28 05:55:37,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:43,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:45,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 05:55:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:45,616 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 05:55:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:55:45,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 05:55:45,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:55:45,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 05:55:45,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-28 05:55:51,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:51,759 INFO L225 Difference]: With dead ends: 53 [2022-04-28 05:55:51,759 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 05:55:51,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:55:51,760 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-28 05:55:51,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-04-28 05:55:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 05:55:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 05:55:51,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:51,783 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-28 05:55:51,783 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-28 05:55:51,784 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-28 05:55:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:51,786 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:55:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:55:51,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:51,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:51,788 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-28 05:55:51,788 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-28 05:55:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:51,791 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 05:55:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 05:55:51,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:51,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:51,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:51,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:51,792 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-28 05:55:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 05:55:51,794 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-28 05:55:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:51,795 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 05:55:51,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:55:51,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 05:55:56,190 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-28 05:55:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 05:55:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 05:55:56,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:56,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:56,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 05:55:56,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:56,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-28 05:55:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:56,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281833998] [2022-04-28 05:55:56,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-28 05:55:56,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:56,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996172509] [2022-04-28 05:55:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:56,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:56,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806384371] [2022-04-28 05:55:56,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:56,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:56,408 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-28 05:55:56,436 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-28 05:55:56,467 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:55:56,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:56,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:55:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:56,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:56,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:55:56,732 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-28 05:55:56,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:55:56,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:55:56,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:55:56,733 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-28 05:55:56,733 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-28 05:55:56,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:55:56,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:55:56,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:55:56,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:55:56,734 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-28 05:55:56,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:55:56,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:55:56,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:55:56,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:55:56,736 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-28 05:55:56,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:55:56,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 10);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:55:56,737 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-28 05:55:56,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:56,738 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-28 05:55:56,739 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-28 05:55:56,740 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-28 05:55:56,741 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-28 05:55:56,741 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-28 05:55:56,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:56,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:55:56,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:55:56,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:55:56,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:55:57,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 05:55:57,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 05:55:57,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:57,231 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-28 05:55:57,235 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-28 05:55:57,236 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-28 05:55:57,236 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-28 05:55:57,241 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-28 05:55:57,242 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-28 05:55:57,242 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-28 05:55:57,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 10);havoc #t~post6; {1042#true} is VALID [2022-04-28 05:55:57,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 05:55:57,243 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-28 05:55:57,243 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 05:55:57,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:55:57,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:55:57,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:55:57,246 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-28 05:55:57,247 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 05:55:57,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:55:57,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 05:55:57,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 05:55:57,259 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-28 05:55:57,260 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-28 05:55:57,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 05:55:57,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 05:55:57,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 05:55:57,260 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-28 05:55:57,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 05:55:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:55:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:57,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996172509] [2022-04-28 05:55:57,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:57,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806384371] [2022-04-28 05:55:57,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806384371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:55:57,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:55:57,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 05:55:57,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:57,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281833998] [2022-04-28 05:55:57,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281833998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:57,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:57,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:55:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954587791] [2022-04-28 05:55:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:57,263 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-28 05:55:57,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:57,263 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-28 05:55:57,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:57,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:55:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:57,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:55:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:55:57,289 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-28 05:55:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:57,804 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 05:55:57,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:55:57,804 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-28 05:55:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:57,805 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-28 05:55:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:55:57,807 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-28 05:55:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 05:55:57,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 05:55:57,859 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-28 05:55:57,860 INFO L225 Difference]: With dead ends: 57 [2022-04-28 05:55:57,860 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 05:55:57,861 INFO L412 NwaCegarLoop]: 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-28 05:55:57,862 INFO L413 NwaCegarLoop]: 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-28 05:55:57,862 INFO L414 NwaCegarLoop]: 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-28 05:55:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 05:55:57,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-28 05:55:57,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:57,882 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-28 05:55:57,883 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-28 05:55:57,883 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-28 05:55:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:57,885 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:55:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:55:57,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:57,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:57,886 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-28 05:55:57,887 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-28 05:55:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:57,889 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 05:55:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 05:55:57,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:57,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:57,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:57,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:57,890 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-28 05:55:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-28 05:55:57,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-28 05:55:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:57,892 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-28 05:55:57,892 INFO L496 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-28 05:55:57,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-28 05:55:59,940 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-28 05:55:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 05:55:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:55:59,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:59,942 INFO L195 NwaCegarLoop]: 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-28 05:55:59,958 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-28 05:56:00,147 WARN L477 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-28 05:56:00,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-28 05:56:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28915739] [2022-04-28 05:56:00,149 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:00,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-28 05:56:00,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:00,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035796653] [2022-04-28 05:56:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:00,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641823316] [2022-04-28 05:56:00,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:00,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:00,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:00,200 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-28 05:56:00,215 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-28 05:56:00,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:00,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:00,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:56:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:00,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:00,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 05:56:00,587 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-28 05:56:00,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,588 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-28 05:56:00,589 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-28 05:56:00,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,591 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,591 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-28 05:56:00,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:00,594 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-28 05:56:00,594 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-28 05:56:00,595 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-28 05:56:00,595 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-28 05:56:00,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:00,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:00,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:00,598 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:00,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:00,599 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-28 05:56:00,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1522#false} is VALID [2022-04-28 05:56:00,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-28 05:56:00,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 10);havoc #t~post8; {1522#false} is VALID [2022-04-28 05:56:00,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-28 05:56:00,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 10);havoc #t~post6; {1522#false} is VALID [2022-04-28 05:56:00,601 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-28 05:56:00,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-28 05:56:00,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 05:56:00,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 05:56:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:56:00,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:00,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035796653] [2022-04-28 05:56:00,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:00,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641823316] [2022-04-28 05:56:00,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641823316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:00,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:00,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:56:00,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28915739] [2022-04-28 05:56:00,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28915739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:00,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:00,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:56:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108889952] [2022-04-28 05:56:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:00,603 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-28 05:56:00,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:00,604 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-28 05:56:00,636 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-28 05:56:00,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:56:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:00,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:56:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:56:00,637 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-28 05:56:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:00,784 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 05:56:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:56:00,787 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-28 05:56:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:00,788 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-28 05:56:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:56:00,791 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-28 05:56:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 05:56:00,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 05:56:00,860 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-28 05:56:00,861 INFO L225 Difference]: With dead ends: 65 [2022-04-28 05:56:00,861 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 05:56:00,861 INFO L412 NwaCegarLoop]: 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-28 05:56:00,862 INFO L413 NwaCegarLoop]: 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-28 05:56:00,862 INFO L414 NwaCegarLoop]: 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-28 05:56:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 05:56:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 05:56:00,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:00,895 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-28 05:56:00,895 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-28 05:56:00,895 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-28 05:56:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:00,897 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:56:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:56:00,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:00,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:00,898 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-28 05:56:00,898 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-28 05:56:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:00,900 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 05:56:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:56:00,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:00,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:00,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:00,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:00,901 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-28 05:56:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-28 05:56:00,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-28 05:56:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:00,903 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-28 05:56:00,903 INFO L496 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-28 05:56:00,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-28 05:56:02,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 05:56:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 05:56:02,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:02,972 INFO L195 NwaCegarLoop]: 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-28 05:56:02,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:03,173 WARN L477 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-28 05:56:03,173 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:03,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-28 05:56:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:03,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003445731] [2022-04-28 05:56:03,174 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-28 05:56:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:03,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186362905] [2022-04-28 05:56:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:03,191 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:03,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174953153] [2022-04-28 05:56:03,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:03,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:03,193 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-28 05:56:03,194 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-28 05:56:03,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:03,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:03,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:56:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:03,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:03,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:56:03,502 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-28 05:56:03,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,504 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-28 05:56:03,505 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-28 05:56:03,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,508 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,508 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-28 05:56:03,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,510 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:03,510 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-28 05:56:03,511 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-28 05:56:03,511 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-28 05:56:03,512 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-28 05:56:03,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:03,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:03,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:03,514 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:03,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:03,516 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-28 05:56:03,516 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-28 05:56:03,517 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-28 05:56:03,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:03,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:03,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:03,519 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:03,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:03,520 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-28 05:56:03,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 10);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:56:03,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:56:03,521 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 10);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:56:03,525 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-28 05:56:03,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:56:03,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:56:03,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:56:03,526 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-28 05:56:03,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:03,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 05:56:03,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 05:56:03,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 05:56:03,795 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-28 05:56:03,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 10);havoc #t~post6; {1937#false} is VALID [2022-04-28 05:56:03,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 05:56:03,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {1937#false} is VALID [2022-04-28 05:56:03,796 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-28 05:56:03,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 10)} assume !(~r~0 > 0); {2087#(< ~counter~0 10)} is VALID [2022-04-28 05:56:03,797 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 10)} #96#return; {2087#(< ~counter~0 10)} is VALID [2022-04-28 05:56:03,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:03,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:03,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:03,798 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-28 05:56:03,798 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-28 05:56:03,799 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-28 05:56:03,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 9)} assume !!(0 != ~r~0); {2112#(< ~counter~0 9)} is VALID [2022-04-28 05:56:03,800 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 9)} #94#return; {2112#(< ~counter~0 9)} is VALID [2022-04-28 05:56:03,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:03,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:03,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:03,800 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-28 05:56:03,800 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-28 05:56:03,801 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-28 05:56:03,801 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-28 05:56:03,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2137#(< ~counter~0 8)} #92#return; {2137#(< ~counter~0 8)} is VALID [2022-04-28 05:56:03,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:03,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:03,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:03,802 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-28 05:56:03,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2137#(< ~counter~0 8)} #90#return; {2137#(< ~counter~0 8)} is VALID [2022-04-28 05:56:03,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 05:56:03,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 05:56:03,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 05:56:03,803 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-28 05:56:03,803 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-28 05:56:03,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#(< ~counter~0 8)} call #t~ret9 := main(); {2137#(< ~counter~0 8)} is VALID [2022-04-28 05:56:03,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#(< ~counter~0 8)} {1936#true} #102#return; {2137#(< ~counter~0 8)} is VALID [2022-04-28 05:56:03,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#(< ~counter~0 8)} assume true; {2137#(< ~counter~0 8)} is VALID [2022-04-28 05:56:03,810 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-28 05:56:03,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 05:56:03,811 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-28 05:56:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:03,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186362905] [2022-04-28 05:56:03,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:03,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174953153] [2022-04-28 05:56:03,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174953153] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:56:03,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:56:03,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-28 05:56:03,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003445731] [2022-04-28 05:56:03,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003445731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:03,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:03,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:56:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623147340] [2022-04-28 05:56:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:03,813 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-28 05:56:03,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:03,813 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-28 05:56:03,844 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-28 05:56:03,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:56:03,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:56:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:56:03,845 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-28 05:56:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:04,022 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-28 05:56:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:56:04,023 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-28 05:56:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:04,023 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-28 05:56:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:56:04,025 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-28 05:56:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 05:56:04,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-28 05:56:04,102 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-28 05:56:04,104 INFO L225 Difference]: With dead ends: 74 [2022-04-28 05:56:04,104 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 05:56:04,104 INFO L412 NwaCegarLoop]: 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-28 05:56:04,105 INFO L413 NwaCegarLoop]: 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-28 05:56:04,105 INFO L414 NwaCegarLoop]: 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-28 05:56:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 05:56:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 05:56:04,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:04,160 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-28 05:56:04,160 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-28 05:56:04,160 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-28 05:56:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:04,162 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:56:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:56:04,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:04,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:04,163 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-28 05:56:04,163 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-28 05:56:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:04,165 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 05:56:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 05:56:04,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:04,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:04,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:04,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:04,166 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-28 05:56:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-28 05:56:04,167 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-28 05:56:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:04,168 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-28 05:56:04,168 INFO L496 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-28 05:56:04,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-28 05:56:06,061 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-28 05:56:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 05:56:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 05:56:06,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:06,062 INFO L195 NwaCegarLoop]: 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-28 05:56:06,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:06,263 WARN L477 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-28 05:56:06,264 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-28 05:56:06,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:06,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [609168210] [2022-04-28 05:56:06,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-28 05:56:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:06,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676829791] [2022-04-28 05:56:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:06,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:06,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:06,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972398467] [2022-04-28 05:56:06,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:06,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:06,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:06,282 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-28 05:56:06,283 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-28 05:56:06,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:06,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:06,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:56:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:06,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:06,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-28 05:56:06,597 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-28 05:56:06,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2557#(<= ~counter~0 0)} {2549#true} #102#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {2557#(<= ~counter~0 0)} call #t~ret9 := main(); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,600 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-28 05:56:06,601 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-28 05:56:06,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #90#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,604 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-28 05:56:06,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {2557#(<= ~counter~0 0)} ~cond := #in~cond; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {2557#(<= ~counter~0 0)} assume !(0 == ~cond); {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= ~counter~0 0)} assume true; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,608 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2557#(<= ~counter~0 0)} {2557#(<= ~counter~0 0)} #92#return; {2557#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:06,608 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-28 05:56:06,609 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-28 05:56:06,609 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-28 05:56:06,610 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-28 05:56:06,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {2606#(<= ~counter~0 1)} ~cond := #in~cond; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:06,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {2606#(<= ~counter~0 1)} assume !(0 == ~cond); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:06,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {2606#(<= ~counter~0 1)} assume true; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:06,612 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2606#(<= ~counter~0 1)} {2606#(<= ~counter~0 1)} #94#return; {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:06,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {2606#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2606#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:06,613 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-28 05:56:06,613 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-28 05:56:06,614 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-28 05:56:06,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {2631#(<= ~counter~0 2)} ~cond := #in~cond; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:06,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {2631#(<= ~counter~0 2)} assume !(0 == ~cond); {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:06,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {2631#(<= ~counter~0 2)} assume true; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:06,615 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2631#(<= ~counter~0 2)} {2631#(<= ~counter~0 2)} #96#return; {2631#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:06,616 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-28 05:56:06,616 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-28 05:56:06,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {2656#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {2550#false} is VALID [2022-04-28 05:56:06,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-28 05:56:06,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 10);havoc #t~post8; {2550#false} is VALID [2022-04-28 05:56:06,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-28 05:56:06,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 10);havoc #t~post6; {2550#false} is VALID [2022-04-28 05:56:06,617 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-28 05:56:06,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-28 05:56:06,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-28 05:56:06,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-28 05:56:06,618 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-28 05:56:06,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:06,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {2550#false} assume !false; {2550#false} is VALID [2022-04-28 05:56:06,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {2550#false} assume 0 == ~cond; {2550#false} is VALID [2022-04-28 05:56:06,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {2550#false} ~cond := #in~cond; {2550#false} is VALID [2022-04-28 05:56:06,872 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-28 05:56:06,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {2550#false} assume !(#t~post6 < 10);havoc #t~post6; {2550#false} is VALID [2022-04-28 05:56:06,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {2550#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2550#false} is VALID [2022-04-28 05:56:06,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {2550#false} assume !(#t~post8 < 10);havoc #t~post8; {2550#false} is VALID [2022-04-28 05:56:06,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {2550#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2550#false} is VALID [2022-04-28 05:56:06,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {2708#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {2550#false} is VALID [2022-04-28 05:56:06,873 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-28 05:56:06,873 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-28 05:56:06,874 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2549#true} {2712#(< ~counter~0 10)} #96#return; {2712#(< ~counter~0 10)} is VALID [2022-04-28 05:56:06,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:06,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:06,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:06,874 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-28 05:56:06,875 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-28 05:56:06,875 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-28 05:56:06,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {2737#(< ~counter~0 9)} assume !!(0 != ~r~0); {2737#(< ~counter~0 9)} is VALID [2022-04-28 05:56:06,876 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2549#true} {2737#(< ~counter~0 9)} #94#return; {2737#(< ~counter~0 9)} is VALID [2022-04-28 05:56:06,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:06,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:06,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:06,877 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-28 05:56:06,878 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-28 05:56:06,878 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-28 05:56:06,879 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-28 05:56:06,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2549#true} {2762#(< ~counter~0 8)} #92#return; {2762#(< ~counter~0 8)} is VALID [2022-04-28 05:56:06,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:06,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:06,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:06,880 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-28 05:56:06,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2549#true} {2762#(< ~counter~0 8)} #90#return; {2762#(< ~counter~0 8)} is VALID [2022-04-28 05:56:06,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {2549#true} assume true; {2549#true} is VALID [2022-04-28 05:56:06,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {2549#true} assume !(0 == ~cond); {2549#true} is VALID [2022-04-28 05:56:06,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#true} ~cond := #in~cond; {2549#true} is VALID [2022-04-28 05:56:06,881 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-28 05:56:06,881 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-28 05:56:06,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {2762#(< ~counter~0 8)} call #t~ret9 := main(); {2762#(< ~counter~0 8)} is VALID [2022-04-28 05:56:06,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2762#(< ~counter~0 8)} {2549#true} #102#return; {2762#(< ~counter~0 8)} is VALID [2022-04-28 05:56:06,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {2762#(< ~counter~0 8)} assume true; {2762#(< ~counter~0 8)} is VALID [2022-04-28 05:56:06,882 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-28 05:56:06,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {2549#true} call ULTIMATE.init(); {2549#true} is VALID [2022-04-28 05:56:06,883 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-28 05:56:06,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:06,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676829791] [2022-04-28 05:56:06,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:06,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972398467] [2022-04-28 05:56:06,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972398467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:06,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:56:06,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:06,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [609168210] [2022-04-28 05:56:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [609168210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:06,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:56:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869909680] [2022-04-28 05:56:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:06,885 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-28 05:56:06,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:06,885 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-28 05:56:06,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:06,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:56:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:56:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:56:06,914 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-28 05:56:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:07,125 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-28 05:56:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:56:07,126 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-28 05:56:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:07,126 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-28 05:56:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:56:07,128 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-28 05:56:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 05:56:07,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 05:56:07,195 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-28 05:56:07,196 INFO L225 Difference]: With dead ends: 75 [2022-04-28 05:56:07,196 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 05:56:07,196 INFO L412 NwaCegarLoop]: 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-28 05:56:07,197 INFO L413 NwaCegarLoop]: 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-28 05:56:07,197 INFO L414 NwaCegarLoop]: 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-28 05:56:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 05:56:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 05:56:07,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:07,252 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-28 05:56:07,252 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-28 05:56:07,252 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-28 05:56:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:07,255 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:56:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:56:07,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:07,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:07,256 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-28 05:56:07,257 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-28 05:56:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:07,258 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 05:56:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:56:07,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:07,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:07,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:07,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:07,259 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-28 05:56:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-28 05:56:07,261 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-28 05:56:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:07,261 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-28 05:56:07,261 INFO L496 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-28 05:56:07,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-28 05:56:07,479 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-28 05:56:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 05:56:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 05:56:07,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:07,479 INFO L195 NwaCegarLoop]: 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-28 05:56:07,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:07,683 WARN L477 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-28 05:56:07,683 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:07,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-28 05:56:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:07,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703240217] [2022-04-28 05:56:07,684 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-28 05:56:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:07,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256488317] [2022-04-28 05:56:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:07,705 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932194644] [2022-04-28 05:56:07,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:07,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:07,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:07,707 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-28 05:56:07,708 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-28 05:56:07,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:07,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:07,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:56:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:07,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:07,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {3184#true} call ULTIMATE.init(); {3184#true} is VALID [2022-04-28 05:56:07,919 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-28 05:56:07,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:07,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3184#true} {3184#true} #102#return; {3184#true} is VALID [2022-04-28 05:56:07,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {3184#true} call #t~ret9 := main(); {3184#true} is VALID [2022-04-28 05:56:07,920 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-28 05:56:07,920 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-28 05:56:07,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:07,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:07,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:07,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3184#true} {3184#true} #90#return; {3184#true} is VALID [2022-04-28 05:56:07,920 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-28 05:56:07,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:07,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:07,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:07,921 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3184#true} {3184#true} #92#return; {3184#true} is VALID [2022-04-28 05:56:07,921 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-28 05:56:07,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {3184#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3184#true} is VALID [2022-04-28 05:56:07,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {3184#true} assume !!(#t~post6 < 10);havoc #t~post6; {3184#true} is VALID [2022-04-28 05:56:07,921 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-28 05:56:07,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:07,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:07,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:07,922 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3184#true} {3184#true} #94#return; {3184#true} is VALID [2022-04-28 05:56:07,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {3184#true} assume !!(0 != ~r~0); {3261#(not (= main_~r~0 0))} is VALID [2022-04-28 05:56:07,922 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-28 05:56:07,923 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-28 05:56:07,923 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-28 05:56:07,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:07,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:07,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:07,924 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-28 05:56:07,924 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-28 05:56:07,925 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-28 05:56:07,925 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-28 05:56:07,931 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-28 05:56:07,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {3184#true} ~cond := #in~cond; {3184#true} is VALID [2022-04-28 05:56:07,931 INFO L290 TraceCheckUtils]: 37: Hoare triple {3184#true} assume !(0 == ~cond); {3184#true} is VALID [2022-04-28 05:56:07,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {3184#true} assume true; {3184#true} is VALID [2022-04-28 05:56:07,933 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-28 05:56:07,933 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-28 05:56:07,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {3185#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3185#false} is VALID [2022-04-28 05:56:07,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {3185#false} assume !(#t~post6 < 10);havoc #t~post6; {3185#false} is VALID [2022-04-28 05:56:07,938 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-28 05:56:07,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {3185#false} ~cond := #in~cond; {3185#false} is VALID [2022-04-28 05:56:07,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {3185#false} assume 0 == ~cond; {3185#false} is VALID [2022-04-28 05:56:07,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {3185#false} assume !false; {3185#false} is VALID [2022-04-28 05:56:07,938 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-28 05:56:07,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:07,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256488317] [2022-04-28 05:56:07,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:07,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932194644] [2022-04-28 05:56:07,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932194644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:07,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:07,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:07,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:07,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703240217] [2022-04-28 05:56:07,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703240217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:07,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:07,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451263406] [2022-04-28 05:56:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:07,943 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-28 05:56:07,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:07,944 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-28 05:56:07,973 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-28 05:56:07,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:56:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:56:07,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:07,974 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-28 05:56:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:08,140 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 05:56:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:56:08,140 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-28 05:56:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:08,141 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-28 05:56:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:56:08,142 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-28 05:56:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 05:56:08,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 05:56:08,233 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-28 05:56:08,235 INFO L225 Difference]: With dead ends: 101 [2022-04-28 05:56:08,235 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 05:56:08,236 INFO L412 NwaCegarLoop]: 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-28 05:56:08,236 INFO L413 NwaCegarLoop]: 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-28 05:56:08,236 INFO L414 NwaCegarLoop]: 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-28 05:56:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 05:56:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-28 05:56:08,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:08,300 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-28 05:56:08,300 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-28 05:56:08,301 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-28 05:56:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:08,304 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:56:08,304 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:56:08,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:08,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:08,304 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-28 05:56:08,305 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-28 05:56:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:08,307 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 05:56:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 05:56:08,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:08,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:08,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:08,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:08,308 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-28 05:56:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-28 05:56:08,310 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-28 05:56:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:08,311 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-28 05:56:08,311 INFO L496 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-28 05:56:08,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-28 05:56:10,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-28 05:56:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 05:56:10,455 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:10,455 INFO L195 NwaCegarLoop]: 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-28 05:56:10,478 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-28 05:56:10,655 WARN L477 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-28 05:56:10,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:10,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-28 05:56:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:10,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532097042] [2022-04-28 05:56:10,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-28 05:56:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:10,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699400186] [2022-04-28 05:56:10,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:10,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:10,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243169213] [2022-04-28 05:56:10,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:10,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:10,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:10,679 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-28 05:56:10,680 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-28 05:56:10,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:10,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:10,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:56:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:10,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:10,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 05:56:10,992 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-28 05:56:10,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#(<= ~counter~0 0)} {3830#true} #102#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#(<= ~counter~0 0)} call #t~ret9 := main(); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,993 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-28 05:56:10,994 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-28 05:56:10,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,995 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #90#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,996 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-28 05:56:10,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {3838#(<= ~counter~0 0)} ~cond := #in~cond; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {3838#(<= ~counter~0 0)} assume !(0 == ~cond); {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {3838#(<= ~counter~0 0)} assume true; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,997 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3838#(<= ~counter~0 0)} {3838#(<= ~counter~0 0)} #92#return; {3838#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:10,997 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-28 05:56:10,998 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-28 05:56:10,998 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-28 05:56:10,998 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-28 05:56:10,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {3887#(<= ~counter~0 1)} ~cond := #in~cond; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:10,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {3887#(<= ~counter~0 1)} assume !(0 == ~cond); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:10,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {3887#(<= ~counter~0 1)} assume true; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,000 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3887#(<= ~counter~0 1)} {3887#(<= ~counter~0 1)} #94#return; {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {3887#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3887#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:11,001 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-28 05:56:11,001 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-28 05:56:11,002 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-28 05:56:11,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {3912#(<= ~counter~0 2)} ~cond := #in~cond; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {3912#(<= ~counter~0 2)} assume !(0 == ~cond); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {3912#(<= ~counter~0 2)} assume true; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,003 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3912#(<= ~counter~0 2)} {3912#(<= ~counter~0 2)} #96#return; {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {3912#(<= ~counter~0 2)} assume !(~r~0 > 0); {3912#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:11,004 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-28 05:56:11,004 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-28 05:56:11,005 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-28 05:56:11,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {3937#(<= ~counter~0 3)} ~cond := #in~cond; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:11,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {3937#(<= ~counter~0 3)} assume !(0 == ~cond); {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:11,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {3937#(<= ~counter~0 3)} assume true; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:11,006 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3937#(<= ~counter~0 3)} {3937#(<= ~counter~0 3)} #98#return; {3937#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:11,007 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-28 05:56:11,007 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-28 05:56:11,007 INFO L290 TraceCheckUtils]: 42: Hoare triple {3962#(<= |main_#t~post8| 3)} assume !(#t~post8 < 10);havoc #t~post8; {3831#false} is VALID [2022-04-28 05:56:11,007 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-28 05:56:11,007 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 10);havoc #t~post6; {3831#false} is VALID [2022-04-28 05:56:11,007 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-28 05:56:11,008 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-28 05:56:11,008 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 05:56:11,008 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 05:56:11,008 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-28 05:56:11,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:11,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 05:56:11,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#false} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 05:56:11,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {3831#false} ~cond := #in~cond; {3831#false} is VALID [2022-04-28 05:56:11,250 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-28 05:56:11,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {3831#false} assume !(#t~post6 < 10);havoc #t~post6; {3831#false} is VALID [2022-04-28 05:56:11,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {3831#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#false} is VALID [2022-04-28 05:56:11,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {4002#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {3831#false} is VALID [2022-04-28 05:56:11,251 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-28 05:56:11,252 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-28 05:56:11,253 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3830#true} {4006#(< ~counter~0 10)} #98#return; {4006#(< ~counter~0 10)} is VALID [2022-04-28 05:56:11,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:11,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:11,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:11,253 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-28 05:56:11,254 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-28 05:56:11,254 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-28 05:56:11,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {4031#(< ~counter~0 9)} assume !(~r~0 > 0); {4031#(< ~counter~0 9)} is VALID [2022-04-28 05:56:11,255 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3830#true} {4031#(< ~counter~0 9)} #96#return; {4031#(< ~counter~0 9)} is VALID [2022-04-28 05:56:11,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:11,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:11,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:11,256 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-28 05:56:11,256 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-28 05:56:11,257 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-28 05:56:11,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {4056#(< ~counter~0 8)} assume !!(0 != ~r~0); {4056#(< ~counter~0 8)} is VALID [2022-04-28 05:56:11,258 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3830#true} {4056#(< ~counter~0 8)} #94#return; {4056#(< ~counter~0 8)} is VALID [2022-04-28 05:56:11,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:11,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:11,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:11,258 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-28 05:56:11,259 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-28 05:56:11,259 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-28 05:56:11,260 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-28 05:56:11,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3830#true} {4081#(< ~counter~0 7)} #92#return; {4081#(< ~counter~0 7)} is VALID [2022-04-28 05:56:11,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:11,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:11,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:11,261 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-28 05:56:11,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3830#true} {4081#(< ~counter~0 7)} #90#return; {4081#(< ~counter~0 7)} is VALID [2022-04-28 05:56:11,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 05:56:11,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 05:56:11,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 05:56:11,261 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-28 05:56:11,262 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-28 05:56:11,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {4081#(< ~counter~0 7)} call #t~ret9 := main(); {4081#(< ~counter~0 7)} is VALID [2022-04-28 05:56:11,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4081#(< ~counter~0 7)} {3830#true} #102#return; {4081#(< ~counter~0 7)} is VALID [2022-04-28 05:56:11,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {4081#(< ~counter~0 7)} assume true; {4081#(< ~counter~0 7)} is VALID [2022-04-28 05:56:11,263 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-28 05:56:11,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 05:56:11,263 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-28 05:56:11,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:11,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699400186] [2022-04-28 05:56:11,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:11,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243169213] [2022-04-28 05:56:11,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243169213] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:11,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:11,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:56:11,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:11,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532097042] [2022-04-28 05:56:11,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532097042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:11,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:11,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:56:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753322137] [2022-04-28 05:56:11,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:11,265 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-28 05:56:11,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:11,266 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-28 05:56:11,301 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-28 05:56:11,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:56:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:11,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:56:11,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:56:11,302 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-28 05:56:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:11,569 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-28 05:56:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:56:11,569 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-28 05:56:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:11,570 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-28 05:56:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:56:11,572 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-28 05:56:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 05:56:11,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 05:56:11,657 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-28 05:56:11,659 INFO L225 Difference]: With dead ends: 118 [2022-04-28 05:56:11,659 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 05:56:11,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:56:11,660 INFO L413 NwaCegarLoop]: 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-28 05:56:11,660 INFO L414 NwaCegarLoop]: 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-28 05:56:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 05:56:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 05:56:11,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:11,747 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-28 05:56:11,747 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-28 05:56:11,748 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-28 05:56:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:11,751 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:56:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:56:11,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:11,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:11,751 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-28 05:56:11,752 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-28 05:56:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:11,754 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 05:56:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 05:56:11,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:11,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:11,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:11,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:11,755 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-28 05:56:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-28 05:56:11,757 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-28 05:56:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:11,757 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-28 05:56:11,758 INFO L496 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-28 05:56:11,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-28 05:56:13,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-28 05:56:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 05:56:13,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:13,787 INFO L195 NwaCegarLoop]: 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-28 05:56:13,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 05:56:13,988 WARN L477 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-28 05:56:13,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-28 05:56:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:13,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939927790] [2022-04-28 05:56:13,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-28 05:56:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:13,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061360409] [2022-04-28 05:56:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:13,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:14,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [495934170] [2022-04-28 05:56:14,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:14,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:14,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:14,001 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-28 05:56:14,002 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-28 05:56:14,067 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:14,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:14,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:56:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:14,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:14,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-28 05:56:14,301 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-28 05:56:14,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4703#(<= ~counter~0 0)} {4695#true} #102#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {4703#(<= ~counter~0 0)} call #t~ret9 := main(); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,303 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-28 05:56:14,303 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-28 05:56:14,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #90#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,305 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-28 05:56:14,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {4703#(<= ~counter~0 0)} ~cond := #in~cond; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {4703#(<= ~counter~0 0)} assume !(0 == ~cond); {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {4703#(<= ~counter~0 0)} assume true; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4703#(<= ~counter~0 0)} {4703#(<= ~counter~0 0)} #92#return; {4703#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:14,306 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-28 05:56:14,307 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-28 05:56:14,307 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-28 05:56:14,308 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-28 05:56:14,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {4752#(<= ~counter~0 1)} ~cond := #in~cond; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:14,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {4752#(<= ~counter~0 1)} assume !(0 == ~cond); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:14,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {4752#(<= ~counter~0 1)} assume true; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:14,309 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4752#(<= ~counter~0 1)} {4752#(<= ~counter~0 1)} #94#return; {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:14,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {4752#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4752#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:14,312 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-28 05:56:14,312 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-28 05:56:14,312 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-28 05:56:14,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {4777#(<= ~counter~0 2)} ~cond := #in~cond; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:14,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {4777#(<= ~counter~0 2)} assume !(0 == ~cond); {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:14,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {4777#(<= ~counter~0 2)} assume true; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:14,314 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4777#(<= ~counter~0 2)} {4777#(<= ~counter~0 2)} #96#return; {4777#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:14,314 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-28 05:56:14,315 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-28 05:56:14,315 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-28 05:56:14,315 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-28 05:56:14,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {4802#(<= ~counter~0 3)} ~cond := #in~cond; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:14,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {4802#(<= ~counter~0 3)} assume !(0 == ~cond); {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:14,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {4802#(<= ~counter~0 3)} assume true; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:14,317 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4802#(<= ~counter~0 3)} {4802#(<= ~counter~0 3)} #96#return; {4802#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:14,317 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-28 05:56:14,317 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-28 05:56:14,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {4827#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {4696#false} is VALID [2022-04-28 05:56:14,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-28 05:56:14,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 10);havoc #t~post8; {4696#false} is VALID [2022-04-28 05:56:14,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-28 05:56:14,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 10);havoc #t~post6; {4696#false} is VALID [2022-04-28 05:56:14,318 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-28 05:56:14,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-28 05:56:14,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-28 05:56:14,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-28 05:56:14,319 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-28 05:56:14,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:14,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {4696#false} assume !false; {4696#false} is VALID [2022-04-28 05:56:14,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {4696#false} assume 0 == ~cond; {4696#false} is VALID [2022-04-28 05:56:14,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {4696#false} ~cond := #in~cond; {4696#false} is VALID [2022-04-28 05:56:14,617 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-28 05:56:14,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {4696#false} assume !(#t~post6 < 10);havoc #t~post6; {4696#false} is VALID [2022-04-28 05:56:14,617 INFO L290 TraceCheckUtils]: 45: Hoare triple {4696#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4696#false} is VALID [2022-04-28 05:56:14,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {4696#false} assume !(#t~post8 < 10);havoc #t~post8; {4696#false} is VALID [2022-04-28 05:56:14,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {4696#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4696#false} is VALID [2022-04-28 05:56:14,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {4879#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {4696#false} is VALID [2022-04-28 05:56:14,618 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-28 05:56:14,618 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-28 05:56:14,619 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4695#true} {4883#(< ~counter~0 10)} #96#return; {4883#(< ~counter~0 10)} is VALID [2022-04-28 05:56:14,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:14,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:14,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:14,620 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-28 05:56:14,620 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-28 05:56:14,621 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-28 05:56:14,622 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-28 05:56:14,623 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4695#true} {4908#(< ~counter~0 9)} #96#return; {4908#(< ~counter~0 9)} is VALID [2022-04-28 05:56:14,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:14,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:14,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:14,623 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-28 05:56:14,624 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-28 05:56:14,624 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-28 05:56:14,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 8)} assume !!(0 != ~r~0); {4933#(< ~counter~0 8)} is VALID [2022-04-28 05:56:14,625 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4695#true} {4933#(< ~counter~0 8)} #94#return; {4933#(< ~counter~0 8)} is VALID [2022-04-28 05:56:14,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:14,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:14,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:14,626 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-28 05:56:14,626 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-28 05:56:14,626 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-28 05:56:14,627 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-28 05:56:14,627 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4695#true} {4958#(< ~counter~0 7)} #92#return; {4958#(< ~counter~0 7)} is VALID [2022-04-28 05:56:14,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:14,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:14,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:14,628 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-28 05:56:14,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4695#true} {4958#(< ~counter~0 7)} #90#return; {4958#(< ~counter~0 7)} is VALID [2022-04-28 05:56:14,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {4695#true} assume true; {4695#true} is VALID [2022-04-28 05:56:14,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {4695#true} assume !(0 == ~cond); {4695#true} is VALID [2022-04-28 05:56:14,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {4695#true} ~cond := #in~cond; {4695#true} is VALID [2022-04-28 05:56:14,629 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-28 05:56:14,629 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-28 05:56:14,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {4958#(< ~counter~0 7)} call #t~ret9 := main(); {4958#(< ~counter~0 7)} is VALID [2022-04-28 05:56:14,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4958#(< ~counter~0 7)} {4695#true} #102#return; {4958#(< ~counter~0 7)} is VALID [2022-04-28 05:56:14,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {4958#(< ~counter~0 7)} assume true; {4958#(< ~counter~0 7)} is VALID [2022-04-28 05:56:14,631 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-28 05:56:14,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {4695#true} call ULTIMATE.init(); {4695#true} is VALID [2022-04-28 05:56:14,631 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-28 05:56:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061360409] [2022-04-28 05:56:14,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495934170] [2022-04-28 05:56:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495934170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:14,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:14,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:56:14,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939927790] [2022-04-28 05:56:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939927790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:14,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:14,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:56:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743352813] [2022-04-28 05:56:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:14,634 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-28 05:56:14,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:14,634 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-28 05:56:14,674 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-28 05:56:14,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:56:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:56:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:56:14,675 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-28 05:56:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:14,920 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-28 05:56:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:56:14,921 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-28 05:56:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:14,921 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-28 05:56:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:56:14,923 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-28 05:56:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 05:56:14,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 05:56:15,010 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-28 05:56:15,011 INFO L225 Difference]: With dead ends: 119 [2022-04-28 05:56:15,011 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 05:56:15,012 INFO L412 NwaCegarLoop]: 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-28 05:56:15,012 INFO L413 NwaCegarLoop]: 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-28 05:56:15,012 INFO L414 NwaCegarLoop]: 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-28 05:56:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 05:56:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 05:56:15,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:15,119 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-28 05:56:15,120 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-28 05:56:15,120 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-28 05:56:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:15,123 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:56:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:56:15,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:15,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:15,123 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-28 05:56:15,124 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-28 05:56:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:15,126 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 05:56:15,126 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:56:15,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:15,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:15,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:15,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:15,127 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-28 05:56:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-28 05:56:15,129 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-28 05:56:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:15,129 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-28 05:56:15,129 INFO L496 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-28 05:56:15,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-28 05:56:17,223 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-28 05:56:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 05:56:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 05:56:17,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:17,223 INFO L195 NwaCegarLoop]: 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-28 05:56:17,227 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-28 05:56:17,424 WARN L477 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-28 05:56:17,424 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-28 05:56:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:17,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797862411] [2022-04-28 05:56:17,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-28 05:56:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:17,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477182566] [2022-04-28 05:56:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:17,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:17,438 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:17,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749538480] [2022-04-28 05:56:17,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:17,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:17,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:17,439 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-28 05:56:17,444 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-28 05:56:17,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:17,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:17,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:17,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:17,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-28 05:56:17,808 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-28 05:56:17,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5590#(<= ~counter~0 0)} {5582#true} #102#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {5590#(<= ~counter~0 0)} call #t~ret9 := main(); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,810 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-28 05:56:17,810 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-28 05:56:17,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #90#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,812 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-28 05:56:17,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {5590#(<= ~counter~0 0)} ~cond := #in~cond; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {5590#(<= ~counter~0 0)} assume !(0 == ~cond); {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {5590#(<= ~counter~0 0)} assume true; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5590#(<= ~counter~0 0)} {5590#(<= ~counter~0 0)} #92#return; {5590#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:17,814 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-28 05:56:17,814 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-28 05:56:17,815 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-28 05:56:17,815 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-28 05:56:17,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {5639#(<= ~counter~0 1)} ~cond := #in~cond; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:17,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {5639#(<= ~counter~0 1)} assume !(0 == ~cond); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:17,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(<= ~counter~0 1)} assume true; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:17,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5639#(<= ~counter~0 1)} {5639#(<= ~counter~0 1)} #94#return; {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:17,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {5639#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5639#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:17,818 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-28 05:56:17,818 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-28 05:56:17,819 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-28 05:56:17,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {5664#(<= ~counter~0 2)} ~cond := #in~cond; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:17,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {5664#(<= ~counter~0 2)} assume !(0 == ~cond); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:17,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {5664#(<= ~counter~0 2)} assume true; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:17,820 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5664#(<= ~counter~0 2)} {5664#(<= ~counter~0 2)} #96#return; {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:17,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {5664#(<= ~counter~0 2)} assume !(~r~0 > 0); {5664#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:17,821 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-28 05:56:17,821 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-28 05:56:17,822 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-28 05:56:17,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:17,823 INFO L290 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:17,823 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:17,824 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #98#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:17,824 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-28 05:56:17,824 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-28 05:56:17,825 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-28 05:56:17,825 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-28 05:56:17,826 INFO L290 TraceCheckUtils]: 44: Hoare triple {5714#(<= ~counter~0 4)} ~cond := #in~cond; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:17,826 INFO L290 TraceCheckUtils]: 45: Hoare triple {5714#(<= ~counter~0 4)} assume !(0 == ~cond); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:17,826 INFO L290 TraceCheckUtils]: 46: Hoare triple {5714#(<= ~counter~0 4)} assume true; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:17,827 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5714#(<= ~counter~0 4)} {5714#(<= ~counter~0 4)} #98#return; {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:17,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {5714#(<= ~counter~0 4)} assume !(~r~0 < 0); {5714#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:17,828 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-28 05:56:17,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {5739#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {5583#false} is VALID [2022-04-28 05:56:17,828 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-28 05:56:17,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-28 05:56:17,828 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-28 05:56:17,828 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-28 05:56:17,829 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-28 05:56:17,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:18,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {5583#false} assume !false; {5583#false} is VALID [2022-04-28 05:56:18,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {5583#false} assume 0 == ~cond; {5583#false} is VALID [2022-04-28 05:56:18,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {5583#false} ~cond := #in~cond; {5583#false} is VALID [2022-04-28 05:56:18,126 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-28 05:56:18,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {5767#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {5583#false} is VALID [2022-04-28 05:56:18,127 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-28 05:56:18,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {5771#(< ~counter~0 10)} assume !(~r~0 < 0); {5771#(< ~counter~0 10)} is VALID [2022-04-28 05:56:18,128 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5582#true} {5771#(< ~counter~0 10)} #98#return; {5771#(< ~counter~0 10)} is VALID [2022-04-28 05:56:18,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:18,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:18,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:18,128 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-28 05:56:18,129 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-28 05:56:18,129 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-28 05:56:18,130 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-28 05:56:18,131 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5582#true} {5796#(< ~counter~0 9)} #98#return; {5796#(< ~counter~0 9)} is VALID [2022-04-28 05:56:18,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:18,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:18,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:18,131 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-28 05:56:18,131 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-28 05:56:18,132 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-28 05:56:18,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {5821#(< ~counter~0 8)} assume !(~r~0 > 0); {5821#(< ~counter~0 8)} is VALID [2022-04-28 05:56:18,133 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5582#true} {5821#(< ~counter~0 8)} #96#return; {5821#(< ~counter~0 8)} is VALID [2022-04-28 05:56:18,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:18,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:18,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:18,133 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-28 05:56:18,134 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-28 05:56:18,134 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-28 05:56:18,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {5846#(< ~counter~0 7)} assume !!(0 != ~r~0); {5846#(< ~counter~0 7)} is VALID [2022-04-28 05:56:18,136 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5582#true} {5846#(< ~counter~0 7)} #94#return; {5846#(< ~counter~0 7)} is VALID [2022-04-28 05:56:18,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:18,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:18,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:18,136 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-28 05:56:18,136 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-28 05:56:18,137 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-28 05:56:18,137 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-28 05:56:18,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#true} {5871#(< ~counter~0 6)} #92#return; {5871#(< ~counter~0 6)} is VALID [2022-04-28 05:56:18,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:18,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:18,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:18,138 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-28 05:56:18,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#true} {5871#(< ~counter~0 6)} #90#return; {5871#(< ~counter~0 6)} is VALID [2022-04-28 05:56:18,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#true} assume true; {5582#true} is VALID [2022-04-28 05:56:18,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#true} assume !(0 == ~cond); {5582#true} is VALID [2022-04-28 05:56:18,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#true} ~cond := #in~cond; {5582#true} is VALID [2022-04-28 05:56:18,139 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-28 05:56:18,140 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-28 05:56:18,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {5871#(< ~counter~0 6)} call #t~ret9 := main(); {5871#(< ~counter~0 6)} is VALID [2022-04-28 05:56:18,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5871#(< ~counter~0 6)} {5582#true} #102#return; {5871#(< ~counter~0 6)} is VALID [2022-04-28 05:56:18,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {5871#(< ~counter~0 6)} assume true; {5871#(< ~counter~0 6)} is VALID [2022-04-28 05:56:18,142 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-28 05:56:18,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {5582#true} call ULTIMATE.init(); {5582#true} is VALID [2022-04-28 05:56:18,142 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-28 05:56:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477182566] [2022-04-28 05:56:18,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749538480] [2022-04-28 05:56:18,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749538480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:18,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:18,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:56:18,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797862411] [2022-04-28 05:56:18,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797862411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:18,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:18,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739428058] [2022-04-28 05:56:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:18,144 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-28 05:56:18,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:18,144 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-28 05:56:18,192 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-28 05:56:18,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:18,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:18,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:18,193 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-28 05:56:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:18,482 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-28 05:56:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:56:18,482 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-28 05:56:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:18,483 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-28 05:56:18,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:56:18,484 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-28 05:56:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 05:56:18,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 05:56:18,559 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-28 05:56:18,560 INFO L225 Difference]: With dead ends: 99 [2022-04-28 05:56:18,560 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 05:56:18,561 INFO L412 NwaCegarLoop]: 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-28 05:56:18,561 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:18,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:56:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 05:56:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-28 05:56:18,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:18,659 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-28 05:56:18,659 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-28 05:56:18,660 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-28 05:56:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:18,662 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:56:18,662 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:56:18,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:18,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:18,663 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-28 05:56:18,663 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-28 05:56:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:18,665 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 05:56:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:56:18,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:18,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:18,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:18,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:18,666 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-28 05:56:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-28 05:56:18,668 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-28 05:56:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:18,668 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-28 05:56:18,668 INFO L496 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-28 05:56:18,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-28 05:56:19,514 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-28 05:56:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-28 05:56:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 05:56:19,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:19,515 INFO L195 NwaCegarLoop]: 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-28 05:56:19,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-28 05:56:19,719 WARN L477 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-28 05:56:19,719 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-28 05:56:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:19,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [578008196] [2022-04-28 05:56:19,720 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-28 05:56:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:19,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397880018] [2022-04-28 05:56:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:19,730 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:19,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894913361] [2022-04-28 05:56:19,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:19,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:19,732 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-28 05:56:19,744 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-28 05:56:19,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:19,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:19,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:19,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:20,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-28 05:56:20,120 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-28 05:56:20,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6503#(<= ~counter~0 0)} {6495#true} #102#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {6503#(<= ~counter~0 0)} call #t~ret9 := main(); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,121 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-28 05:56:20,122 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-28 05:56:20,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,123 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #90#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,124 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-28 05:56:20,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {6503#(<= ~counter~0 0)} ~cond := #in~cond; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {6503#(<= ~counter~0 0)} assume !(0 == ~cond); {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {6503#(<= ~counter~0 0)} assume true; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6503#(<= ~counter~0 0)} {6503#(<= ~counter~0 0)} #92#return; {6503#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:20,125 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-28 05:56:20,126 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-28 05:56:20,126 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-28 05:56:20,126 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-28 05:56:20,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {6552#(<= ~counter~0 1)} ~cond := #in~cond; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:20,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {6552#(<= ~counter~0 1)} assume !(0 == ~cond); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:20,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {6552#(<= ~counter~0 1)} assume true; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:20,128 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6552#(<= ~counter~0 1)} {6552#(<= ~counter~0 1)} #94#return; {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:20,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {6552#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6552#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:20,129 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-28 05:56:20,129 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-28 05:56:20,129 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-28 05:56:20,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {6577#(<= ~counter~0 2)} ~cond := #in~cond; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:20,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {6577#(<= ~counter~0 2)} assume !(0 == ~cond); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:20,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {6577#(<= ~counter~0 2)} assume true; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:20,131 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6577#(<= ~counter~0 2)} {6577#(<= ~counter~0 2)} #96#return; {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:20,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(<= ~counter~0 2)} assume !(~r~0 > 0); {6577#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:20,131 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-28 05:56:20,132 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-28 05:56:20,132 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-28 05:56:20,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {6602#(<= ~counter~0 3)} ~cond := #in~cond; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:20,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {6602#(<= ~counter~0 3)} assume !(0 == ~cond); {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:20,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {6602#(<= ~counter~0 3)} assume true; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:20,134 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6602#(<= ~counter~0 3)} {6602#(<= ~counter~0 3)} #98#return; {6602#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:20,134 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-28 05:56:20,134 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-28 05:56:20,135 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-28 05:56:20,135 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-28 05:56:20,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {6627#(<= ~counter~0 4)} ~cond := #in~cond; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:20,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {6627#(<= ~counter~0 4)} assume !(0 == ~cond); {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:20,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {6627#(<= ~counter~0 4)} assume true; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:20,136 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6627#(<= ~counter~0 4)} {6627#(<= ~counter~0 4)} #98#return; {6627#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:20,137 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-28 05:56:20,137 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-28 05:56:20,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {6652#(<= |main_#t~post8| 4)} assume !(#t~post8 < 10);havoc #t~post8; {6496#false} is VALID [2022-04-28 05:56:20,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-28 05:56:20,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 10);havoc #t~post6; {6496#false} is VALID [2022-04-28 05:56:20,138 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-28 05:56:20,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-28 05:56:20,138 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-28 05:56:20,138 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-28 05:56:20,138 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-28 05:56:20,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:20,445 INFO L290 TraceCheckUtils]: 56: Hoare triple {6496#false} assume !false; {6496#false} is VALID [2022-04-28 05:56:20,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {6496#false} assume 0 == ~cond; {6496#false} is VALID [2022-04-28 05:56:20,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {6496#false} ~cond := #in~cond; {6496#false} is VALID [2022-04-28 05:56:20,446 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-28 05:56:20,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#false} assume !(#t~post6 < 10);havoc #t~post6; {6496#false} is VALID [2022-04-28 05:56:20,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6496#false} is VALID [2022-04-28 05:56:20,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {6692#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {6496#false} is VALID [2022-04-28 05:56:20,447 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-28 05:56:20,447 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-28 05:56:20,448 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6495#true} {6696#(< ~counter~0 10)} #98#return; {6696#(< ~counter~0 10)} is VALID [2022-04-28 05:56:20,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:20,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:20,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:20,448 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-28 05:56:20,449 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-28 05:56:20,449 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-28 05:56:20,450 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-28 05:56:20,450 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6495#true} {6721#(< ~counter~0 9)} #98#return; {6721#(< ~counter~0 9)} is VALID [2022-04-28 05:56:20,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:20,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:20,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:20,451 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-28 05:56:20,451 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-28 05:56:20,452 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-28 05:56:20,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {6746#(< ~counter~0 8)} assume !(~r~0 > 0); {6746#(< ~counter~0 8)} is VALID [2022-04-28 05:56:20,453 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6495#true} {6746#(< ~counter~0 8)} #96#return; {6746#(< ~counter~0 8)} is VALID [2022-04-28 05:56:20,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:20,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:20,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:20,453 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-28 05:56:20,454 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-28 05:56:20,454 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-28 05:56:20,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {6771#(< ~counter~0 7)} assume !!(0 != ~r~0); {6771#(< ~counter~0 7)} is VALID [2022-04-28 05:56:20,456 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6495#true} {6771#(< ~counter~0 7)} #94#return; {6771#(< ~counter~0 7)} is VALID [2022-04-28 05:56:20,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:20,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:20,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:20,456 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-28 05:56:20,456 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-28 05:56:20,457 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-28 05:56:20,457 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-28 05:56:20,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6495#true} {6796#(< ~counter~0 6)} #92#return; {6796#(< ~counter~0 6)} is VALID [2022-04-28 05:56:20,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:20,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:20,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:20,458 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-28 05:56:20,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6495#true} {6796#(< ~counter~0 6)} #90#return; {6796#(< ~counter~0 6)} is VALID [2022-04-28 05:56:20,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {6495#true} assume true; {6495#true} is VALID [2022-04-28 05:56:20,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {6495#true} assume !(0 == ~cond); {6495#true} is VALID [2022-04-28 05:56:20,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {6495#true} ~cond := #in~cond; {6495#true} is VALID [2022-04-28 05:56:20,460 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-28 05:56:20,460 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-28 05:56:20,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {6796#(< ~counter~0 6)} call #t~ret9 := main(); {6796#(< ~counter~0 6)} is VALID [2022-04-28 05:56:20,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6796#(< ~counter~0 6)} {6495#true} #102#return; {6796#(< ~counter~0 6)} is VALID [2022-04-28 05:56:20,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {6796#(< ~counter~0 6)} assume true; {6796#(< ~counter~0 6)} is VALID [2022-04-28 05:56:20,462 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-28 05:56:20,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {6495#true} call ULTIMATE.init(); {6495#true} is VALID [2022-04-28 05:56:20,462 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-28 05:56:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:20,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397880018] [2022-04-28 05:56:20,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:20,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894913361] [2022-04-28 05:56:20,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894913361] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:20,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:20,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:56:20,463 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:20,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [578008196] [2022-04-28 05:56:20,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [578008196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:20,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:20,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822464688] [2022-04-28 05:56:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:20,465 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-28 05:56:20,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:20,466 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-28 05:56:20,515 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-28 05:56:20,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:20,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:20,516 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-28 05:56:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:20,839 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-28 05:56:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:56:20,840 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-28 05:56:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:20,840 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-28 05:56:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:56:20,842 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-28 05:56:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 05:56:20,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-28 05:56:20,936 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-28 05:56:20,938 INFO L225 Difference]: With dead ends: 132 [2022-04-28 05:56:20,938 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 05:56:20,939 INFO L412 NwaCegarLoop]: 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-28 05:56:20,939 INFO L413 NwaCegarLoop]: 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-28 05:56:20,939 INFO L414 NwaCegarLoop]: 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-28 05:56:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 05:56:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-28 05:56:21,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:21,021 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-28 05:56:21,021 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-28 05:56:21,022 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-28 05:56:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:21,024 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:56:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:56:21,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:21,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:21,025 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-28 05:56:21,025 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-28 05:56:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:21,027 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 05:56:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 05:56:21,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:21,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:21,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:21,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:21,028 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-28 05:56:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-28 05:56:21,030 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-28 05:56:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:21,030 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-28 05:56:21,030 INFO L496 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-28 05:56:21,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-28 05:56:22,767 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-28 05:56:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 05:56:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 05:56:22,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:22,768 INFO L195 NwaCegarLoop]: 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-28 05:56:22,785 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-28 05:56:22,971 WARN L477 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-28 05:56:22,971 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-28 05:56:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:22,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [374148858] [2022-04-28 05:56:22,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-28 05:56:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:22,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260578387] [2022-04-28 05:56:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:22,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:22,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:22,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095506504] [2022-04-28 05:56:22,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:56:22,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:22,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:22,999 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-28 05:56:23,000 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-28 05:56:23,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:56:23,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:23,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 05:56:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:23,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:23,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-28 05:56:23,360 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-28 05:56:23,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7504#(<= ~counter~0 0)} {7496#true} #102#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {7504#(<= ~counter~0 0)} call #t~ret9 := main(); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,361 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-28 05:56:23,362 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-28 05:56:23,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #90#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,364 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-28 05:56:23,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {7504#(<= ~counter~0 0)} ~cond := #in~cond; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {7504#(<= ~counter~0 0)} assume !(0 == ~cond); {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {7504#(<= ~counter~0 0)} assume true; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,365 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7504#(<= ~counter~0 0)} {7504#(<= ~counter~0 0)} #92#return; {7504#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:23,365 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-28 05:56:23,366 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-28 05:56:23,366 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-28 05:56:23,366 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-28 05:56:23,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {7553#(<= ~counter~0 1)} ~cond := #in~cond; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:23,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {7553#(<= ~counter~0 1)} assume !(0 == ~cond); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:23,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {7553#(<= ~counter~0 1)} assume true; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:23,368 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7553#(<= ~counter~0 1)} {7553#(<= ~counter~0 1)} #94#return; {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:23,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {7553#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7553#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:23,369 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-28 05:56:23,369 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-28 05:56:23,369 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-28 05:56:23,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {7578#(<= ~counter~0 2)} ~cond := #in~cond; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:23,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {7578#(<= ~counter~0 2)} assume !(0 == ~cond); {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:23,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {7578#(<= ~counter~0 2)} assume true; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:23,385 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7578#(<= ~counter~0 2)} {7578#(<= ~counter~0 2)} #96#return; {7578#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:23,385 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-28 05:56:23,386 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-28 05:56:23,387 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-28 05:56:23,388 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-28 05:56:23,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {7603#(<= ~counter~0 3)} ~cond := #in~cond; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:23,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {7603#(<= ~counter~0 3)} assume !(0 == ~cond); {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:23,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {7603#(<= ~counter~0 3)} assume true; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:23,391 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7603#(<= ~counter~0 3)} {7603#(<= ~counter~0 3)} #96#return; {7603#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:23,391 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-28 05:56:23,392 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-28 05:56:23,392 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-28 05:56:23,393 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-28 05:56:23,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {7628#(<= ~counter~0 4)} ~cond := #in~cond; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:23,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {7628#(<= ~counter~0 4)} assume !(0 == ~cond); {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:23,395 INFO L290 TraceCheckUtils]: 46: Hoare triple {7628#(<= ~counter~0 4)} assume true; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:23,396 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7628#(<= ~counter~0 4)} {7628#(<= ~counter~0 4)} #96#return; {7628#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:23,397 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-28 05:56:23,397 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-28 05:56:23,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {7653#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {7497#false} is VALID [2022-04-28 05:56:23,398 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-28 05:56:23,398 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 10);havoc #t~post8; {7497#false} is VALID [2022-04-28 05:56:23,398 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-28 05:56:23,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 10);havoc #t~post6; {7497#false} is VALID [2022-04-28 05:56:23,399 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-28 05:56:23,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-28 05:56:23,399 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-28 05:56:23,399 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-28 05:56:23,399 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-28 05:56:23,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:23,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {7497#false} assume !false; {7497#false} is VALID [2022-04-28 05:56:23,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {7497#false} assume 0 == ~cond; {7497#false} is VALID [2022-04-28 05:56:23,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {7497#false} ~cond := #in~cond; {7497#false} is VALID [2022-04-28 05:56:23,692 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-28 05:56:23,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {7497#false} assume !(#t~post6 < 10);havoc #t~post6; {7497#false} is VALID [2022-04-28 05:56:23,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {7497#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7497#false} is VALID [2022-04-28 05:56:23,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {7497#false} assume !(#t~post8 < 10);havoc #t~post8; {7497#false} is VALID [2022-04-28 05:56:23,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {7497#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7497#false} is VALID [2022-04-28 05:56:23,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {7705#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {7497#false} is VALID [2022-04-28 05:56:23,703 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-28 05:56:23,704 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-28 05:56:23,704 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7496#true} {7709#(< ~counter~0 10)} #96#return; {7709#(< ~counter~0 10)} is VALID [2022-04-28 05:56:23,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:23,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:23,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:23,705 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-28 05:56:23,705 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-28 05:56:23,705 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-28 05:56:23,706 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-28 05:56:23,706 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7496#true} {7734#(< ~counter~0 9)} #96#return; {7734#(< ~counter~0 9)} is VALID [2022-04-28 05:56:23,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:23,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:23,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:23,707 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-28 05:56:23,707 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-28 05:56:23,707 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-28 05:56:23,708 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-28 05:56:23,708 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7496#true} {7759#(< ~counter~0 8)} #96#return; {7759#(< ~counter~0 8)} is VALID [2022-04-28 05:56:23,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:23,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:23,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:23,708 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-28 05:56:23,709 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-28 05:56:23,709 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-28 05:56:23,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {7784#(< ~counter~0 7)} assume !!(0 != ~r~0); {7784#(< ~counter~0 7)} is VALID [2022-04-28 05:56:23,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7496#true} {7784#(< ~counter~0 7)} #94#return; {7784#(< ~counter~0 7)} is VALID [2022-04-28 05:56:23,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:23,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:23,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:23,710 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-28 05:56:23,710 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-28 05:56:23,711 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-28 05:56:23,711 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-28 05:56:23,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7496#true} {7809#(< ~counter~0 6)} #92#return; {7809#(< ~counter~0 6)} is VALID [2022-04-28 05:56:23,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:23,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:23,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:23,712 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-28 05:56:23,712 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7496#true} {7809#(< ~counter~0 6)} #90#return; {7809#(< ~counter~0 6)} is VALID [2022-04-28 05:56:23,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {7496#true} assume true; {7496#true} is VALID [2022-04-28 05:56:23,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {7496#true} assume !(0 == ~cond); {7496#true} is VALID [2022-04-28 05:56:23,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {7496#true} ~cond := #in~cond; {7496#true} is VALID [2022-04-28 05:56:23,713 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-28 05:56:23,713 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-28 05:56:23,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {7809#(< ~counter~0 6)} call #t~ret9 := main(); {7809#(< ~counter~0 6)} is VALID [2022-04-28 05:56:23,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7809#(< ~counter~0 6)} {7496#true} #102#return; {7809#(< ~counter~0 6)} is VALID [2022-04-28 05:56:23,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {7809#(< ~counter~0 6)} assume true; {7809#(< ~counter~0 6)} is VALID [2022-04-28 05:56:23,714 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-28 05:56:23,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {7496#true} call ULTIMATE.init(); {7496#true} is VALID [2022-04-28 05:56:23,715 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-28 05:56:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:23,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260578387] [2022-04-28 05:56:23,715 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:23,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095506504] [2022-04-28 05:56:23,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095506504] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:23,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:23,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 05:56:23,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:23,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [374148858] [2022-04-28 05:56:23,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [374148858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:23,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:23,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:56:23,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131018351] [2022-04-28 05:56:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:23,717 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-28 05:56:23,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:23,717 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-28 05:56:23,756 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-28 05:56:23,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:56:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:23,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:56:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:23,757 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-28 05:56:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:24,072 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-28 05:56:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:56:24,072 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-28 05:56:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:24,072 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-28 05:56:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:56:24,074 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-28 05:56:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 05:56:24,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-28 05:56:24,177 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-28 05:56:24,179 INFO L225 Difference]: With dead ends: 133 [2022-04-28 05:56:24,179 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 05:56:24,180 INFO L412 NwaCegarLoop]: 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-28 05:56:24,180 INFO L413 NwaCegarLoop]: 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-28 05:56:24,181 INFO L414 NwaCegarLoop]: 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-28 05:56:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 05:56:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 05:56:24,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:24,268 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-28 05:56:24,268 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-28 05:56:24,268 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-28 05:56:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:24,270 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:56:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:56:24,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:24,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:24,271 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-28 05:56:24,271 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-28 05:56:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:24,273 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 05:56:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:56:24,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:24,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:24,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:24,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:24,274 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-28 05:56:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-28 05:56:24,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-28 05:56:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:24,276 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-28 05:56:24,277 INFO L496 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-28 05:56:24,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-28 05:56:24,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 05:56:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 05:56:24,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:24,835 INFO L195 NwaCegarLoop]: 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-28 05:56:24,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:25,039 WARN L477 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-28 05:56:25,039 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-28 05:56:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:25,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [980755885] [2022-04-28 05:56:25,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-28 05:56:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:25,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417860688] [2022-04-28 05:56:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:25,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460747961] [2022-04-28 05:56:25,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:25,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:25,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:25,053 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-28 05:56:25,057 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-28 05:56:25,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:25,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:25,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:56:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:25,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:25,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:56:25,414 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-28 05:56:25,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #102#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret9 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,416 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-28 05:56:25,416 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-28 05:56:25,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #90#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,420 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-28 05:56:25,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,421 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #92#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:25,422 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-28 05:56:25,422 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-28 05:56:25,423 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-28 05:56:25,424 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-28 05:56:25,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {8576#(<= ~counter~0 1)} ~cond := #in~cond; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {8576#(<= ~counter~0 1)} assume !(0 == ~cond); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {8576#(<= ~counter~0 1)} assume true; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,425 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8576#(<= ~counter~0 1)} {8576#(<= ~counter~0 1)} #94#return; {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {8576#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:25,426 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-28 05:56:25,427 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-28 05:56:25,427 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-28 05:56:25,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {8601#(<= ~counter~0 2)} ~cond := #in~cond; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {8601#(<= ~counter~0 2)} assume !(0 == ~cond); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {8601#(<= ~counter~0 2)} assume true; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,429 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8601#(<= ~counter~0 2)} {8601#(<= ~counter~0 2)} #96#return; {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,430 INFO L290 TraceCheckUtils]: 32: Hoare triple {8601#(<= ~counter~0 2)} assume !(~r~0 > 0); {8601#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:25,430 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-28 05:56:25,431 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-28 05:56:25,431 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-28 05:56:25,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {8626#(<= ~counter~0 3)} ~cond := #in~cond; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {8626#(<= ~counter~0 3)} assume !(0 == ~cond); {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {8626#(<= ~counter~0 3)} assume true; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,433 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8626#(<= ~counter~0 3)} {8626#(<= ~counter~0 3)} #98#return; {8626#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:25,433 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-28 05:56:25,434 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-28 05:56:25,434 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-28 05:56:25,435 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-28 05:56:25,435 INFO L290 TraceCheckUtils]: 44: Hoare triple {8651#(<= ~counter~0 4)} ~cond := #in~cond; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {8651#(<= ~counter~0 4)} assume !(0 == ~cond); {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,436 INFO L290 TraceCheckUtils]: 46: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,437 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8651#(<= ~counter~0 4)} {8651#(<= ~counter~0 4)} #98#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,437 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-28 05:56:25,438 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-28 05:56:25,438 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-28 05:56:25,438 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-28 05:56:25,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {8676#(<= ~counter~0 5)} ~cond := #in~cond; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {8676#(<= ~counter~0 5)} assume !(0 == ~cond); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {8676#(<= ~counter~0 5)} assume true; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,440 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8676#(<= ~counter~0 5)} {8676#(<= ~counter~0 5)} #98#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {8676#(<= ~counter~0 5)} assume !(~r~0 < 0); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,441 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-28 05:56:25,441 INFO L290 TraceCheckUtils]: 58: Hoare triple {8701#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:56:25,441 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-28 05:56:25,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:56:25,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:56:25,442 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:56:25,442 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-28 05:56:25,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:25,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-28 05:56:25,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-28 05:56:25,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-28 05:56:25,772 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-28 05:56:25,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {8729#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-28 05:56:25,772 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-28 05:56:25,773 INFO L290 TraceCheckUtils]: 56: Hoare triple {8733#(< ~counter~0 10)} assume !(~r~0 < 0); {8733#(< ~counter~0 10)} is VALID [2022-04-28 05:56:25,773 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8519#true} {8733#(< ~counter~0 10)} #98#return; {8733#(< ~counter~0 10)} is VALID [2022-04-28 05:56:25,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,774 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-28 05:56:25,774 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-28 05:56:25,774 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-28 05:56:25,775 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-28 05:56:25,775 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8519#true} {8758#(< ~counter~0 9)} #98#return; {8758#(< ~counter~0 9)} is VALID [2022-04-28 05:56:25,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,776 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-28 05:56:25,776 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-28 05:56:25,776 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-28 05:56:25,777 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-28 05:56:25,777 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8519#true} {8783#(< ~counter~0 8)} #98#return; {8783#(< ~counter~0 8)} is VALID [2022-04-28 05:56:25,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,777 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-28 05:56:25,778 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-28 05:56:25,778 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-28 05:56:25,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {8808#(< ~counter~0 7)} assume !(~r~0 > 0); {8808#(< ~counter~0 7)} is VALID [2022-04-28 05:56:25,779 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8519#true} {8808#(< ~counter~0 7)} #96#return; {8808#(< ~counter~0 7)} is VALID [2022-04-28 05:56:25,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,780 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-28 05:56:25,780 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-28 05:56:25,780 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-28 05:56:25,781 INFO L290 TraceCheckUtils]: 24: Hoare triple {8676#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,781 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8519#true} {8676#(<= ~counter~0 5)} #94#return; {8676#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:25,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,781 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-28 05:56:25,782 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-28 05:56:25,782 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-28 05:56:25,782 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-28 05:56:25,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8651#(<= ~counter~0 4)} #92#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,783 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-28 05:56:25,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8651#(<= ~counter~0 4)} #90#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-28 05:56:25,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-28 05:56:25,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-28 05:56:25,784 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-28 05:56:25,784 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-28 05:56:25,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {8651#(<= ~counter~0 4)} call #t~ret9 := main(); {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8651#(<= ~counter~0 4)} {8519#true} #102#return; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {8651#(<= ~counter~0 4)} assume true; {8651#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:25,786 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-28 05:56:25,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-28 05:56:25,786 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-28 05:56:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:25,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417860688] [2022-04-28 05:56:25,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:25,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460747961] [2022-04-28 05:56:25,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460747961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:25,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:25,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:56:25,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [980755885] [2022-04-28 05:56:25,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [980755885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:25,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:25,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:56:25,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584218190] [2022-04-28 05:56:25,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:25,788 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-28 05:56:25,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:25,788 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-28 05:56:25,829 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-28 05:56:25,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:56:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:56:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:25,830 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-28 05:56:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:26,173 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-04-28 05:56:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 05:56:26,173 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-28 05:56:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:26,174 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-28 05:56:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:56:26,176 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-28 05:56:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-28 05:56:26,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-28 05:56:26,273 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-28 05:56:26,275 INFO L225 Difference]: With dead ends: 116 [2022-04-28 05:56:26,275 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 05:56:26,276 INFO L412 NwaCegarLoop]: 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-28 05:56:26,276 INFO L413 NwaCegarLoop]: 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-28 05:56:26,277 INFO L414 NwaCegarLoop]: 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-28 05:56:26,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 05:56:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-04-28 05:56:26,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:26,371 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-28 05:56:26,372 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-28 05:56:26,372 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-28 05:56:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:26,375 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 05:56:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 05:56:26,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:26,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:26,376 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-28 05:56:26,376 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-28 05:56:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:26,378 INFO L93 Difference]: Finished difference Result 111 states and 137 transitions. [2022-04-28 05:56:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2022-04-28 05:56:26,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:26,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:26,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:26,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:26,379 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-28 05:56:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2022-04-28 05:56:26,382 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 63 [2022-04-28 05:56:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:26,382 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2022-04-28 05:56:26,382 INFO L496 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-28 05:56:26,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 131 transitions. [2022-04-28 05:56:27,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2022-04-28 05:56:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 05:56:27,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:27,354 INFO L195 NwaCegarLoop]: 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-28 05:56:27,370 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-28 05:56:27,554 WARN L477 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-28 05:56:27,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:27,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-28 05:56:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:27,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1971223261] [2022-04-28 05:56:27,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-28 05:56:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:27,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581950065] [2022-04-28 05:56:27,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:27,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:27,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:27,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943045387] [2022-04-28 05:56:27,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:56:27,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:27,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:27,571 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-28 05:56:27,578 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-28 05:56:27,636 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:56:27,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:27,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:56:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:27,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:27,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {9580#true} call ULTIMATE.init(); {9580#true} is VALID [2022-04-28 05:56:27,952 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-28 05:56:27,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9588#(<= ~counter~0 0)} {9580#true} #102#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {9588#(<= ~counter~0 0)} call #t~ret9 := main(); {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,953 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-28 05:56:27,954 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-28 05:56:27,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {9588#(<= ~counter~0 0)} ~cond := #in~cond; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {9588#(<= ~counter~0 0)} assume !(0 == ~cond); {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9588#(<= ~counter~0 0)} {9588#(<= ~counter~0 0)} #90#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,956 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-28 05:56:27,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {9588#(<= ~counter~0 0)} ~cond := #in~cond; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {9588#(<= ~counter~0 0)} assume !(0 == ~cond); {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {9588#(<= ~counter~0 0)} assume true; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9588#(<= ~counter~0 0)} {9588#(<= ~counter~0 0)} #92#return; {9588#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:27,957 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-28 05:56:27,958 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-28 05:56:27,958 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-28 05:56:27,958 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-28 05:56:27,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {9637#(<= ~counter~0 1)} ~cond := #in~cond; {9637#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:27,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {9637#(<= ~counter~0 1)} assume !(0 == ~cond); {9637#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:27,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {9637#(<= ~counter~0 1)} assume true; {9637#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:27,960 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9637#(<= ~counter~0 1)} {9637#(<= ~counter~0 1)} #94#return; {9637#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:27,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {9637#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9637#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:27,961 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-28 05:56:27,961 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-28 05:56:27,961 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-28 05:56:27,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {9662#(<= ~counter~0 2)} ~cond := #in~cond; {9662#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:27,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {9662#(<= ~counter~0 2)} assume !(0 == ~cond); {9662#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:27,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {9662#(<= ~counter~0 2)} assume true; {9662#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:27,963 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9662#(<= ~counter~0 2)} {9662#(<= ~counter~0 2)} #96#return; {9662#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:27,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {9662#(<= ~counter~0 2)} assume !(~r~0 > 0); {9662#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:27,963 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-28 05:56:27,964 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-28 05:56:27,964 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-28 05:56:27,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {9687#(<= ~counter~0 3)} ~cond := #in~cond; {9687#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:27,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {9687#(<= ~counter~0 3)} assume !(0 == ~cond); {9687#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:27,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {9687#(<= ~counter~0 3)} assume true; {9687#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:27,966 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9687#(<= ~counter~0 3)} {9687#(<= ~counter~0 3)} #98#return; {9687#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:27,966 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-28 05:56:27,966 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-28 05:56:27,967 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-28 05:56:27,967 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-28 05:56:27,967 INFO L290 TraceCheckUtils]: 44: Hoare triple {9712#(<= ~counter~0 4)} ~cond := #in~cond; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:27,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {9712#(<= ~counter~0 4)} assume !(0 == ~cond); {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:27,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {9712#(<= ~counter~0 4)} assume true; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:27,972 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9712#(<= ~counter~0 4)} {9712#(<= ~counter~0 4)} #98#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:27,972 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-28 05:56:27,975 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-28 05:56:27,976 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-28 05:56:27,976 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-28 05:56:27,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {9737#(<= ~counter~0 5)} ~cond := #in~cond; {9737#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:27,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {9737#(<= ~counter~0 5)} assume !(0 == ~cond); {9737#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:27,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {9737#(<= ~counter~0 5)} assume true; {9737#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:27,978 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9737#(<= ~counter~0 5)} {9737#(<= ~counter~0 5)} #98#return; {9737#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:27,978 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-28 05:56:27,979 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-28 05:56:27,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {9762#(<= |main_#t~post8| 5)} assume !(#t~post8 < 10);havoc #t~post8; {9581#false} is VALID [2022-04-28 05:56:27,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {9581#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9581#false} is VALID [2022-04-28 05:56:27,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {9581#false} assume !(#t~post6 < 10);havoc #t~post6; {9581#false} is VALID [2022-04-28 05:56:27,980 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-28 05:56:27,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {9581#false} ~cond := #in~cond; {9581#false} is VALID [2022-04-28 05:56:27,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {9581#false} assume 0 == ~cond; {9581#false} is VALID [2022-04-28 05:56:27,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {9581#false} assume !false; {9581#false} is VALID [2022-04-28 05:56:27,980 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-28 05:56:27,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {9581#false} assume !false; {9581#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 63: Hoare triple {9581#false} assume 0 == ~cond; {9581#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {9581#false} ~cond := #in~cond; {9581#false} is VALID [2022-04-28 05:56:28,292 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-28 05:56:28,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {9581#false} assume !(#t~post6 < 10);havoc #t~post6; {9581#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {9581#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9581#false} is VALID [2022-04-28 05:56:28,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {9802#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {9581#false} is VALID [2022-04-28 05:56:28,293 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-28 05:56:28,293 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-28 05:56:28,294 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9580#true} {9806#(< ~counter~0 10)} #98#return; {9806#(< ~counter~0 10)} is VALID [2022-04-28 05:56:28,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,294 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-28 05:56:28,294 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-28 05:56:28,295 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-28 05:56:28,295 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-28 05:56:28,296 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9580#true} {9831#(< ~counter~0 9)} #98#return; {9831#(< ~counter~0 9)} is VALID [2022-04-28 05:56:28,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,296 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-28 05:56:28,296 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-28 05:56:28,297 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-28 05:56:28,297 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-28 05:56:28,297 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9580#true} {9856#(< ~counter~0 8)} #98#return; {9856#(< ~counter~0 8)} is VALID [2022-04-28 05:56:28,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,298 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-28 05:56:28,298 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-28 05:56:28,298 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-28 05:56:28,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {9881#(< ~counter~0 7)} assume !(~r~0 > 0); {9881#(< ~counter~0 7)} is VALID [2022-04-28 05:56:28,299 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9580#true} {9881#(< ~counter~0 7)} #96#return; {9881#(< ~counter~0 7)} is VALID [2022-04-28 05:56:28,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,299 INFO L290 TraceCheckUtils]: 29: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,300 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-28 05:56:28,300 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-28 05:56:28,300 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-28 05:56:28,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {9737#(<= ~counter~0 5)} assume !!(0 != ~r~0); {9737#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:28,301 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9580#true} {9737#(<= ~counter~0 5)} #94#return; {9737#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:28,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,301 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-28 05:56:28,302 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-28 05:56:28,302 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-28 05:56:28,302 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-28 05:56:28,303 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9580#true} {9712#(<= ~counter~0 4)} #92#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,303 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-28 05:56:28,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9580#true} {9712#(<= ~counter~0 4)} #90#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {9580#true} assume true; {9580#true} is VALID [2022-04-28 05:56:28,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {9580#true} assume !(0 == ~cond); {9580#true} is VALID [2022-04-28 05:56:28,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {9580#true} ~cond := #in~cond; {9580#true} is VALID [2022-04-28 05:56:28,304 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-28 05:56:28,304 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-28 05:56:28,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {9712#(<= ~counter~0 4)} call #t~ret9 := main(); {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9712#(<= ~counter~0 4)} {9580#true} #102#return; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {9712#(<= ~counter~0 4)} assume true; {9712#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:28,305 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-28 05:56:28,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {9580#true} call ULTIMATE.init(); {9580#true} is VALID [2022-04-28 05:56:28,306 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-28 05:56:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581950065] [2022-04-28 05:56:28,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943045387] [2022-04-28 05:56:28,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943045387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:28,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:28,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:56:28,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:28,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1971223261] [2022-04-28 05:56:28,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1971223261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:28,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:28,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:56:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369239938] [2022-04-28 05:56:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:28,307 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-28 05:56:28,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:28,308 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-28 05:56:28,350 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-28 05:56:28,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:56:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:56:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:28,351 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-28 05:56:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:28,721 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-04-28 05:56:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:56:28,722 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-28 05:56:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:28,722 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-28 05:56:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 05:56:28,724 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-28 05:56:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-28 05:56:28,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-28 05:56:28,821 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-28 05:56:28,822 INFO L225 Difference]: With dead ends: 149 [2022-04-28 05:56:28,822 INFO L226 Difference]: Without dead ends: 112 [2022-04-28 05:56:28,823 INFO L412 NwaCegarLoop]: 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-28 05:56:28,823 INFO L413 NwaCegarLoop]: 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-28 05:56:28,824 INFO L414 NwaCegarLoop]: 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-28 05:56:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-28 05:56:28,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-04-28 05:56:28,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:28,940 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-28 05:56:28,940 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-28 05:56:28,940 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-28 05:56:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:28,943 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-28 05:56:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:56:28,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:28,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:28,943 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-28 05:56:28,944 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-28 05:56:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:28,946 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-28 05:56:28,946 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2022-04-28 05:56:28,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:28,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:28,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:28,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:28,947 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-28 05:56:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2022-04-28 05:56:28,950 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 65 [2022-04-28 05:56:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:28,950 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2022-04-28 05:56:28,950 INFO L496 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-28 05:56:28,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 135 transitions. [2022-04-28 05:56:31,172 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-28 05:56:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 05:56:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 05:56:31,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:31,173 INFO L195 NwaCegarLoop]: 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-28 05:56:31,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 05:56:31,383 WARN L477 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-28 05:56:31,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-28 05:56:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:31,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1357943190] [2022-04-28 05:56:31,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-28 05:56:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:31,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072780197] [2022-04-28 05:56:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:31,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:31,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961043618] [2022-04-28 05:56:31,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:31,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:31,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:31,398 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-28 05:56:31,401 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-28 05:56:31,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:31,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:31,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:56:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:31,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:31,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-28 05:56:31,747 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-28 05:56:31,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10737#(<= ~counter~0 0)} {10729#true} #102#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {10737#(<= ~counter~0 0)} call #t~ret9 := main(); {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,748 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-28 05:56:31,749 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-28 05:56:31,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(<= ~counter~0 0)} ~cond := #in~cond; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {10737#(<= ~counter~0 0)} assume !(0 == ~cond); {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10737#(<= ~counter~0 0)} {10737#(<= ~counter~0 0)} #90#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,750 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-28 05:56:31,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {10737#(<= ~counter~0 0)} ~cond := #in~cond; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {10737#(<= ~counter~0 0)} assume !(0 == ~cond); {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {10737#(<= ~counter~0 0)} assume true; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10737#(<= ~counter~0 0)} {10737#(<= ~counter~0 0)} #92#return; {10737#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:31,752 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-28 05:56:31,753 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-28 05:56:31,753 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-28 05:56:31,753 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-28 05:56:31,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {10786#(<= ~counter~0 1)} ~cond := #in~cond; {10786#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:31,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {10786#(<= ~counter~0 1)} assume !(0 == ~cond); {10786#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:31,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {10786#(<= ~counter~0 1)} assume true; {10786#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:31,755 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10786#(<= ~counter~0 1)} {10786#(<= ~counter~0 1)} #94#return; {10786#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:31,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {10786#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10786#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:31,755 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-28 05:56:31,756 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-28 05:56:31,756 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-28 05:56:31,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {10811#(<= ~counter~0 2)} ~cond := #in~cond; {10811#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:31,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {10811#(<= ~counter~0 2)} assume !(0 == ~cond); {10811#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:31,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {10811#(<= ~counter~0 2)} assume true; {10811#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:31,758 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10811#(<= ~counter~0 2)} {10811#(<= ~counter~0 2)} #96#return; {10811#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:31,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {10811#(<= ~counter~0 2)} assume !(~r~0 > 0); {10811#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:31,758 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-28 05:56:31,759 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-28 05:56:31,759 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-28 05:56:31,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {10836#(<= ~counter~0 3)} ~cond := #in~cond; {10836#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:31,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {10836#(<= ~counter~0 3)} assume !(0 == ~cond); {10836#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:31,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {10836#(<= ~counter~0 3)} assume true; {10836#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:31,760 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10836#(<= ~counter~0 3)} {10836#(<= ~counter~0 3)} #98#return; {10836#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:31,761 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-28 05:56:31,761 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-28 05:56:31,761 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-28 05:56:31,762 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-28 05:56:31,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {10861#(<= ~counter~0 4)} ~cond := #in~cond; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:31,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {10861#(<= ~counter~0 4)} assume !(0 == ~cond); {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:31,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {10861#(<= ~counter~0 4)} assume true; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:31,763 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10861#(<= ~counter~0 4)} {10861#(<= ~counter~0 4)} #98#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:31,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {10861#(<= ~counter~0 4)} assume !(~r~0 < 0); {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:31,764 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-28 05:56:31,764 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-28 05:56:31,765 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-28 05:56:31,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {10886#(<= ~counter~0 5)} ~cond := #in~cond; {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:31,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {10886#(<= ~counter~0 5)} assume !(0 == ~cond); {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:31,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {10886#(<= ~counter~0 5)} assume true; {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:31,766 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10886#(<= ~counter~0 5)} {10886#(<= ~counter~0 5)} #94#return; {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:31,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {10886#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:31,767 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-28 05:56:31,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {10911#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {10730#false} is VALID [2022-04-28 05:56:31,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10730#false} is VALID [2022-04-28 05:56:31,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !(#t~post8 < 10);havoc #t~post8; {10730#false} is VALID [2022-04-28 05:56:31,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10730#false} is VALID [2022-04-28 05:56:31,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} assume !(#t~post6 < 10);havoc #t~post6; {10730#false} is VALID [2022-04-28 05:56:31,768 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-28 05:56:31,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-28 05:56:31,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-28 05:56:31,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-28 05:56:31,768 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-28 05:56:31,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:32,078 INFO L290 TraceCheckUtils]: 66: Hoare triple {10730#false} assume !false; {10730#false} is VALID [2022-04-28 05:56:32,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {10730#false} assume 0 == ~cond; {10730#false} is VALID [2022-04-28 05:56:32,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {10730#false} ~cond := #in~cond; {10730#false} is VALID [2022-04-28 05:56:32,078 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-28 05:56:32,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {10730#false} assume !(#t~post6 < 10);havoc #t~post6; {10730#false} is VALID [2022-04-28 05:56:32,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {10730#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10730#false} is VALID [2022-04-28 05:56:32,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {10730#false} assume !(#t~post8 < 10);havoc #t~post8; {10730#false} is VALID [2022-04-28 05:56:32,078 INFO L290 TraceCheckUtils]: 59: Hoare triple {10730#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10730#false} is VALID [2022-04-28 05:56:32,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {10963#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {10730#false} is VALID [2022-04-28 05:56:32,079 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-28 05:56:32,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {10967#(< ~counter~0 10)} assume !!(0 != ~r~0); {10967#(< ~counter~0 10)} is VALID [2022-04-28 05:56:32,080 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10729#true} {10967#(< ~counter~0 10)} #94#return; {10967#(< ~counter~0 10)} is VALID [2022-04-28 05:56:32,080 INFO L290 TraceCheckUtils]: 54: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,080 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-28 05:56:32,081 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-28 05:56:32,081 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-28 05:56:32,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {10992#(< ~counter~0 9)} assume !(~r~0 < 0); {10992#(< ~counter~0 9)} is VALID [2022-04-28 05:56:32,082 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10729#true} {10992#(< ~counter~0 9)} #98#return; {10992#(< ~counter~0 9)} is VALID [2022-04-28 05:56:32,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,082 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-28 05:56:32,083 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-28 05:56:32,083 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-28 05:56:32,083 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-28 05:56:32,084 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10729#true} {11017#(< ~counter~0 8)} #98#return; {11017#(< ~counter~0 8)} is VALID [2022-04-28 05:56:32,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,084 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-28 05:56:32,084 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-28 05:56:32,085 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-28 05:56:32,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {11042#(< ~counter~0 7)} assume !(~r~0 > 0); {11042#(< ~counter~0 7)} is VALID [2022-04-28 05:56:32,086 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10729#true} {11042#(< ~counter~0 7)} #96#return; {11042#(< ~counter~0 7)} is VALID [2022-04-28 05:56:32,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,086 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-28 05:56:32,087 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-28 05:56:32,087 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-28 05:56:32,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {10886#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:32,088 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10729#true} {10886#(<= ~counter~0 5)} #94#return; {10886#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:32,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,088 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-28 05:56:32,088 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-28 05:56:32,089 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-28 05:56:32,089 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-28 05:56:32,090 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10729#true} {10861#(<= ~counter~0 4)} #92#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,090 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-28 05:56:32,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10729#true} {10861#(<= ~counter~0 4)} #90#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {10729#true} assume true; {10729#true} is VALID [2022-04-28 05:56:32,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {10729#true} assume !(0 == ~cond); {10729#true} is VALID [2022-04-28 05:56:32,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {10729#true} ~cond := #in~cond; {10729#true} is VALID [2022-04-28 05:56:32,093 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-28 05:56:32,094 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-28 05:56:32,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {10861#(<= ~counter~0 4)} call #t~ret9 := main(); {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10861#(<= ~counter~0 4)} {10729#true} #102#return; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {10861#(<= ~counter~0 4)} assume true; {10861#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:32,095 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-28 05:56:32,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {10729#true} call ULTIMATE.init(); {10729#true} is VALID [2022-04-28 05:56:32,095 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-28 05:56:32,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:32,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072780197] [2022-04-28 05:56:32,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:32,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961043618] [2022-04-28 05:56:32,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961043618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:32,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:32,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:56:32,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:32,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1357943190] [2022-04-28 05:56:32,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1357943190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:32,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:32,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:56:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216508533] [2022-04-28 05:56:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:32,097 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-28 05:56:32,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:32,097 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-28 05:56:32,142 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-28 05:56:32,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:56:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:32,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:56:32,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:32,143 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-28 05:56:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:32,544 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2022-04-28 05:56:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:56:32,544 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-28 05:56:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:32,545 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-28 05:56:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 05:56:32,547 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-28 05:56:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-28 05:56:32,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-28 05:56:32,669 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-28 05:56:32,671 INFO L225 Difference]: With dead ends: 151 [2022-04-28 05:56:32,671 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 05:56:32,672 INFO L412 NwaCegarLoop]: 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-28 05:56:32,672 INFO L413 NwaCegarLoop]: 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-28 05:56:32,673 INFO L414 NwaCegarLoop]: 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-28 05:56:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 05:56:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-28 05:56:32,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:32,787 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-28 05:56:32,787 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-28 05:56:32,787 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-28 05:56:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:32,790 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 05:56:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:56:32,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:32,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:32,791 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-28 05:56:32,791 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-28 05:56:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:32,793 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 05:56:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:56:32,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:32,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:32,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:32,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:32,794 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-28 05:56:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2022-04-28 05:56:32,797 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 67 [2022-04-28 05:56:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:32,797 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2022-04-28 05:56:32,797 INFO L496 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-28 05:56:32,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 140 transitions. [2022-04-28 05:56:34,891 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-28 05:56:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 05:56:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 05:56:34,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:34,894 INFO L195 NwaCegarLoop]: 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-28 05:56:34,916 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-28 05:56:35,110 WARN L477 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-28 05:56:35,110 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:35,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-28 05:56:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:35,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989307410] [2022-04-28 05:56:35,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:35,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-28 05:56:35,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:35,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202632120] [2022-04-28 05:56:35,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:35,127 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:35,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788797490] [2022-04-28 05:56:35,128 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:56:35,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:35,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:35,130 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-28 05:56:35,134 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-28 05:56:35,201 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 05:56:35,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:35,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:56:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:35,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:35,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {11910#true} call ULTIMATE.init(); {11910#true} is VALID [2022-04-28 05:56:35,560 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-28 05:56:35,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11918#(<= ~counter~0 0)} {11910#true} #102#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {11918#(<= ~counter~0 0)} call #t~ret9 := main(); {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,562 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-28 05:56:35,562 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-28 05:56:35,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {11918#(<= ~counter~0 0)} ~cond := #in~cond; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {11918#(<= ~counter~0 0)} assume !(0 == ~cond); {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11918#(<= ~counter~0 0)} {11918#(<= ~counter~0 0)} #90#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,564 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-28 05:56:35,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {11918#(<= ~counter~0 0)} ~cond := #in~cond; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {11918#(<= ~counter~0 0)} assume !(0 == ~cond); {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {11918#(<= ~counter~0 0)} assume true; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,565 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11918#(<= ~counter~0 0)} {11918#(<= ~counter~0 0)} #92#return; {11918#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:35,565 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-28 05:56:35,567 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-28 05:56:35,568 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-28 05:56:35,568 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-28 05:56:35,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {11967#(<= ~counter~0 1)} ~cond := #in~cond; {11967#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:35,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {11967#(<= ~counter~0 1)} assume !(0 == ~cond); {11967#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:35,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {11967#(<= ~counter~0 1)} assume true; {11967#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:35,570 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11967#(<= ~counter~0 1)} {11967#(<= ~counter~0 1)} #94#return; {11967#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:35,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {11967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11967#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:35,570 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-28 05:56:35,571 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-28 05:56:35,571 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-28 05:56:35,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {11992#(<= ~counter~0 2)} ~cond := #in~cond; {11992#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:35,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {11992#(<= ~counter~0 2)} assume !(0 == ~cond); {11992#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:35,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {11992#(<= ~counter~0 2)} assume true; {11992#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:35,572 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11992#(<= ~counter~0 2)} {11992#(<= ~counter~0 2)} #96#return; {11992#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:35,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {11992#(<= ~counter~0 2)} assume !(~r~0 > 0); {11992#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:35,573 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-28 05:56:35,573 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-28 05:56:35,574 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-28 05:56:35,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {12017#(<= ~counter~0 3)} ~cond := #in~cond; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {12017#(<= ~counter~0 3)} assume !(0 == ~cond); {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {12017#(<= ~counter~0 3)} assume true; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,575 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12017#(<= ~counter~0 3)} {12017#(<= ~counter~0 3)} #98#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,576 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-28 05:56:35,576 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-28 05:56:35,576 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-28 05:56:35,577 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-28 05:56:35,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {12042#(<= ~counter~0 4)} ~cond := #in~cond; {12042#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:35,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {12042#(<= ~counter~0 4)} assume !(0 == ~cond); {12042#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:35,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {12042#(<= ~counter~0 4)} assume true; {12042#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:35,578 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12042#(<= ~counter~0 4)} {12042#(<= ~counter~0 4)} #98#return; {12042#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:35,578 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-28 05:56:35,579 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-28 05:56:35,579 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-28 05:56:35,580 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-28 05:56:35,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {12067#(<= ~counter~0 5)} ~cond := #in~cond; {12067#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:35,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {12067#(<= ~counter~0 5)} assume !(0 == ~cond); {12067#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:35,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {12067#(<= ~counter~0 5)} assume true; {12067#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:35,581 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12067#(<= ~counter~0 5)} {12067#(<= ~counter~0 5)} #98#return; {12067#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:35,581 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-28 05:56:35,587 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-28 05:56:35,588 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-28 05:56:35,589 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-28 05:56:35,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {12092#(<= ~counter~0 6)} ~cond := #in~cond; {12092#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:35,589 INFO L290 TraceCheckUtils]: 61: Hoare triple {12092#(<= ~counter~0 6)} assume !(0 == ~cond); {12092#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:35,590 INFO L290 TraceCheckUtils]: 62: Hoare triple {12092#(<= ~counter~0 6)} assume true; {12092#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:35,590 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12092#(<= ~counter~0 6)} {12092#(<= ~counter~0 6)} #98#return; {12092#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:35,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {12092#(<= ~counter~0 6)} assume !(~r~0 < 0); {12092#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:35,591 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-28 05:56:35,592 INFO L290 TraceCheckUtils]: 66: Hoare triple {12117#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {11911#false} is VALID [2022-04-28 05:56:35,592 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-28 05:56:35,592 INFO L290 TraceCheckUtils]: 68: Hoare triple {11911#false} ~cond := #in~cond; {11911#false} is VALID [2022-04-28 05:56:35,592 INFO L290 TraceCheckUtils]: 69: Hoare triple {11911#false} assume 0 == ~cond; {11911#false} is VALID [2022-04-28 05:56:35,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-04-28 05:56:35,593 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-28 05:56:35,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:35,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {11911#false} assume !false; {11911#false} is VALID [2022-04-28 05:56:35,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {11911#false} assume 0 == ~cond; {11911#false} is VALID [2022-04-28 05:56:35,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {11911#false} ~cond := #in~cond; {11911#false} is VALID [2022-04-28 05:56:35,957 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-28 05:56:35,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {12145#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {11911#false} is VALID [2022-04-28 05:56:35,958 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-28 05:56:35,958 INFO L290 TraceCheckUtils]: 64: Hoare triple {12149#(< ~counter~0 10)} assume !(~r~0 < 0); {12149#(< ~counter~0 10)} is VALID [2022-04-28 05:56:35,959 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11910#true} {12149#(< ~counter~0 10)} #98#return; {12149#(< ~counter~0 10)} is VALID [2022-04-28 05:56:35,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,959 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-28 05:56:35,959 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-28 05:56:35,960 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-28 05:56:35,960 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-28 05:56:35,961 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11910#true} {12174#(< ~counter~0 9)} #98#return; {12174#(< ~counter~0 9)} is VALID [2022-04-28 05:56:35,961 INFO L290 TraceCheckUtils]: 54: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,961 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-28 05:56:35,961 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-28 05:56:35,962 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-28 05:56:35,962 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-28 05:56:35,963 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11910#true} {12199#(< ~counter~0 8)} #98#return; {12199#(< ~counter~0 8)} is VALID [2022-04-28 05:56:35,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,963 INFO L290 TraceCheckUtils]: 45: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,963 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-28 05:56:35,963 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-28 05:56:35,964 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-28 05:56:35,964 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-28 05:56:35,964 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11910#true} {12092#(<= ~counter~0 6)} #98#return; {12092#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:35,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,965 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-28 05:56:35,965 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-28 05:56:35,965 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-28 05:56:35,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {12067#(<= ~counter~0 5)} assume !(~r~0 > 0); {12067#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:35,966 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11910#true} {12067#(<= ~counter~0 5)} #96#return; {12067#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:35,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,966 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-28 05:56:35,967 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-28 05:56:35,967 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-28 05:56:35,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {12042#(<= ~counter~0 4)} assume !!(0 != ~r~0); {12042#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:35,968 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11910#true} {12042#(<= ~counter~0 4)} #94#return; {12042#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:35,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,968 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-28 05:56:35,968 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-28 05:56:35,969 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-28 05:56:35,969 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-28 05:56:35,970 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11910#true} {12017#(<= ~counter~0 3)} #92#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,970 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-28 05:56:35,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11910#true} {12017#(<= ~counter~0 3)} #90#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {11910#true} assume true; {11910#true} is VALID [2022-04-28 05:56:35,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {11910#true} assume !(0 == ~cond); {11910#true} is VALID [2022-04-28 05:56:35,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {11910#true} ~cond := #in~cond; {11910#true} is VALID [2022-04-28 05:56:35,971 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-28 05:56:35,971 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-28 05:56:35,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {12017#(<= ~counter~0 3)} call #t~ret9 := main(); {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12017#(<= ~counter~0 3)} {11910#true} #102#return; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {12017#(<= ~counter~0 3)} assume true; {12017#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:35,972 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-28 05:56:35,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {11910#true} call ULTIMATE.init(); {11910#true} is VALID [2022-04-28 05:56:35,973 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-28 05:56:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202632120] [2022-04-28 05:56:35,973 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:35,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788797490] [2022-04-28 05:56:35,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788797490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:35,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:35,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:56:35,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:35,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989307410] [2022-04-28 05:56:35,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989307410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:35,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:35,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:56:35,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460889009] [2022-04-28 05:56:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:35,977 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-28 05:56:35,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:35,978 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-28 05:56:36,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:36,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:56:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:36,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:56:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:36,024 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-28 05:56:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:36,481 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2022-04-28 05:56:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 05:56:36,481 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-28 05:56:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:36,481 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-28 05:56:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 05:56:36,484 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-28 05:56:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-28 05:56:36,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-28 05:56:36,589 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-28 05:56:36,591 INFO L225 Difference]: With dead ends: 137 [2022-04-28 05:56:36,591 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 05:56:36,592 INFO L412 NwaCegarLoop]: 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-28 05:56:36,592 INFO L413 NwaCegarLoop]: 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-28 05:56:36,592 INFO L414 NwaCegarLoop]: 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-28 05:56:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 05:56:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2022-04-28 05:56:36,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:36,723 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-28 05:56:36,723 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-28 05:56:36,723 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-28 05:56:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:36,726 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:56:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:56:36,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:36,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:36,727 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-28 05:56:36,727 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-28 05:56:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:36,730 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-04-28 05:56:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 164 transitions. [2022-04-28 05:56:36,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:36,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:36,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:36,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:36,731 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-28 05:56:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-04-28 05:56:36,734 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 71 [2022-04-28 05:56:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:36,734 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-04-28 05:56:36,734 INFO L496 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-28 05:56:36,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 155 transitions. [2022-04-28 05:56:38,369 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-28 05:56:38,369 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-28 05:56:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:56:38,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:38,370 INFO L195 NwaCegarLoop]: 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-28 05:56:38,386 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-28 05:56:38,570 WARN L477 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-28 05:56:38,571 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-28 05:56:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:38,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527114007] [2022-04-28 05:56:38,572 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-28 05:56:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:38,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392459643] [2022-04-28 05:56:38,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:38,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860794743] [2022-04-28 05:56:38,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:38,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:38,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:38,584 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-28 05:56:38,586 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-28 05:56:38,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:38,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:38,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:56:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:38,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:38,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {13143#true} call ULTIMATE.init(); {13143#true} is VALID [2022-04-28 05:56:38,837 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-28 05:56:38,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13143#true} {13143#true} #102#return; {13143#true} is VALID [2022-04-28 05:56:38,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {13143#true} call #t~ret9 := main(); {13143#true} is VALID [2022-04-28 05:56:38,837 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-28 05:56:38,837 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-28 05:56:38,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13143#true} {13143#true} #90#return; {13143#true} is VALID [2022-04-28 05:56:38,838 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-28 05:56:38,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13143#true} {13143#true} #92#return; {13143#true} is VALID [2022-04-28 05:56:38,838 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-28 05:56:38,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {13143#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {13143#true} assume !!(#t~post6 < 10);havoc #t~post6; {13143#true} is VALID [2022-04-28 05:56:38,838 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-28 05:56:38,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13143#true} {13143#true} #94#return; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {13143#true} assume !!(0 != ~r~0); {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {13143#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {13143#true} assume !!(#t~post7 < 10);havoc #t~post7; {13143#true} is VALID [2022-04-28 05:56:38,839 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-28 05:56:38,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13143#true} {13143#true} #96#return; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {13143#true} assume !(~r~0 > 0); {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {13143#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13143#true} is VALID [2022-04-28 05:56:38,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {13143#true} assume !!(#t~post8 < 10);havoc #t~post8; {13143#true} is VALID [2022-04-28 05:56:38,839 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-28 05:56:38,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,840 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13143#true} {13143#true} #98#return; {13143#true} is VALID [2022-04-28 05:56:38,840 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-28 05:56:38,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {13143#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13143#true} is VALID [2022-04-28 05:56:38,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {13143#true} assume !!(#t~post8 < 10);havoc #t~post8; {13143#true} is VALID [2022-04-28 05:56:38,840 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-28 05:56:38,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,841 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13143#true} {13143#true} #98#return; {13143#true} is VALID [2022-04-28 05:56:38,847 INFO L290 TraceCheckUtils]: 48: Hoare triple {13143#true} assume !(~r~0 < 0); {13292#(not (< main_~r~0 0))} is VALID [2022-04-28 05:56:38,848 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-28 05:56:38,848 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-28 05:56:38,848 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-28 05:56:38,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,849 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-28 05:56:38,849 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-28 05:56:38,850 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-28 05:56:38,850 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-28 05:56:38,850 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-28 05:56:38,850 INFO L290 TraceCheckUtils]: 60: Hoare triple {13143#true} ~cond := #in~cond; {13143#true} is VALID [2022-04-28 05:56:38,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {13143#true} assume !(0 == ~cond); {13143#true} is VALID [2022-04-28 05:56:38,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {13143#true} assume true; {13143#true} is VALID [2022-04-28 05:56:38,851 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-28 05:56:38,852 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-28 05:56:38,852 INFO L290 TraceCheckUtils]: 65: Hoare triple {13144#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13144#false} is VALID [2022-04-28 05:56:38,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {13144#false} assume !(#t~post8 < 10);havoc #t~post8; {13144#false} is VALID [2022-04-28 05:56:38,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {13144#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13144#false} is VALID [2022-04-28 05:56:38,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {13144#false} assume !(#t~post6 < 10);havoc #t~post6; {13144#false} is VALID [2022-04-28 05:56:38,852 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-28 05:56:38,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {13144#false} ~cond := #in~cond; {13144#false} is VALID [2022-04-28 05:56:38,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {13144#false} assume 0 == ~cond; {13144#false} is VALID [2022-04-28 05:56:38,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {13144#false} assume !false; {13144#false} is VALID [2022-04-28 05:56:38,853 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-28 05:56:38,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:56:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392459643] [2022-04-28 05:56:38,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860794743] [2022-04-28 05:56:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860794743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:38,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:38,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:38,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527114007] [2022-04-28 05:56:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527114007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:38,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:38,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:56:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945502424] [2022-04-28 05:56:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:38,854 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-28 05:56:38,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:38,854 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-28 05:56:38,887 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-28 05:56:38,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:56:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:56:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:56:38,888 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-28 05:56:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:39,138 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2022-04-28 05:56:39,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:56:39,138 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-28 05:56:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:39,138 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-28 05:56:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:56:39,139 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-28 05:56:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:56:39,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 05:56:39,204 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-28 05:56:39,206 INFO L225 Difference]: With dead ends: 180 [2022-04-28 05:56:39,206 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 05:56:39,207 INFO L412 NwaCegarLoop]: 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-28 05:56:39,207 INFO L413 NwaCegarLoop]: 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-28 05:56:39,208 INFO L414 NwaCegarLoop]: 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-28 05:56:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 05:56:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-04-28 05:56:39,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:39,345 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-28 05:56:39,346 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-28 05:56:39,346 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-28 05:56:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:39,349 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-28 05:56:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 05:56:39,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:39,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:39,350 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-28 05:56:39,350 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-28 05:56:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:39,353 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2022-04-28 05:56:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 05:56:39,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:39,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:39,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:39,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:39,354 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-28 05:56:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-28 05:56:39,357 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 73 [2022-04-28 05:56:39,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:39,358 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-28 05:56:39,358 INFO L496 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-28 05:56:39,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-28 05:56:41,692 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-28 05:56:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-28 05:56:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 05:56:41,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:41,693 INFO L195 NwaCegarLoop]: 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-28 05:56:41,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 05:56:41,899 WARN L477 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-28 05:56:41,899 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-28 05:56:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:41,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [584047050] [2022-04-28 05:56:41,900 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-28 05:56:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:41,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357371694] [2022-04-28 05:56:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:41,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:41,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512923045] [2022-04-28 05:56:41,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:41,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:41,914 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-28 05:56:41,943 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-28 05:56:41,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:41,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:41,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:56:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:41,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:42,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {14285#true} call ULTIMATE.init(); {14285#true} is VALID [2022-04-28 05:56:42,398 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-28 05:56:42,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14293#(<= ~counter~0 0)} {14285#true} #102#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {14293#(<= ~counter~0 0)} call #t~ret9 := main(); {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,399 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-28 05:56:42,400 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-28 05:56:42,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {14293#(<= ~counter~0 0)} ~cond := #in~cond; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {14293#(<= ~counter~0 0)} assume !(0 == ~cond); {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,401 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14293#(<= ~counter~0 0)} {14293#(<= ~counter~0 0)} #90#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,402 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-28 05:56:42,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {14293#(<= ~counter~0 0)} ~cond := #in~cond; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {14293#(<= ~counter~0 0)} assume !(0 == ~cond); {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {14293#(<= ~counter~0 0)} assume true; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,404 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14293#(<= ~counter~0 0)} {14293#(<= ~counter~0 0)} #92#return; {14293#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:42,404 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-28 05:56:42,405 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-28 05:56:42,405 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-28 05:56:42,406 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-28 05:56:42,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {14342#(<= ~counter~0 1)} ~cond := #in~cond; {14342#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:42,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {14342#(<= ~counter~0 1)} assume !(0 == ~cond); {14342#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:42,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {14342#(<= ~counter~0 1)} assume true; {14342#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:42,407 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14342#(<= ~counter~0 1)} {14342#(<= ~counter~0 1)} #94#return; {14342#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:42,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {14342#(<= ~counter~0 1)} assume !!(0 != ~r~0); {14342#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:42,408 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-28 05:56:42,409 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-28 05:56:42,410 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-28 05:56:42,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {14367#(<= ~counter~0 2)} ~cond := #in~cond; {14367#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:42,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {14367#(<= ~counter~0 2)} assume !(0 == ~cond); {14367#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:42,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {14367#(<= ~counter~0 2)} assume true; {14367#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:42,411 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14367#(<= ~counter~0 2)} {14367#(<= ~counter~0 2)} #96#return; {14367#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:42,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {14367#(<= ~counter~0 2)} assume !(~r~0 > 0); {14367#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:42,413 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-28 05:56:42,413 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-28 05:56:42,414 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-28 05:56:42,414 INFO L290 TraceCheckUtils]: 36: Hoare triple {14392#(<= ~counter~0 3)} ~cond := #in~cond; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {14392#(<= ~counter~0 3)} assume !(0 == ~cond); {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {14392#(<= ~counter~0 3)} assume true; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,415 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14392#(<= ~counter~0 3)} {14392#(<= ~counter~0 3)} #98#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,416 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-28 05:56:42,416 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-28 05:56:42,417 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-28 05:56:42,417 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-28 05:56:42,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {14417#(<= ~counter~0 4)} ~cond := #in~cond; {14417#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:42,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {14417#(<= ~counter~0 4)} assume !(0 == ~cond); {14417#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:42,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {14417#(<= ~counter~0 4)} assume true; {14417#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:42,419 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14417#(<= ~counter~0 4)} {14417#(<= ~counter~0 4)} #98#return; {14417#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:42,419 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-28 05:56:42,420 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-28 05:56:42,420 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-28 05:56:42,421 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-28 05:56:42,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {14442#(<= ~counter~0 5)} ~cond := #in~cond; {14442#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:42,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {14442#(<= ~counter~0 5)} assume !(0 == ~cond); {14442#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:42,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {14442#(<= ~counter~0 5)} assume true; {14442#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:42,423 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14442#(<= ~counter~0 5)} {14442#(<= ~counter~0 5)} #98#return; {14442#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:42,423 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-28 05:56:42,424 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-28 05:56:42,424 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-28 05:56:42,425 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-28 05:56:42,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {14467#(<= ~counter~0 6)} ~cond := #in~cond; {14467#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:42,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {14467#(<= ~counter~0 6)} assume !(0 == ~cond); {14467#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:42,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {14467#(<= ~counter~0 6)} assume true; {14467#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:42,426 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14467#(<= ~counter~0 6)} {14467#(<= ~counter~0 6)} #98#return; {14467#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:42,427 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-28 05:56:42,427 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-28 05:56:42,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {14492#(<= |main_#t~post8| 6)} assume !(#t~post8 < 10);havoc #t~post8; {14286#false} is VALID [2022-04-28 05:56:42,428 INFO L290 TraceCheckUtils]: 67: Hoare triple {14286#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14286#false} is VALID [2022-04-28 05:56:42,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {14286#false} assume !(#t~post6 < 10);havoc #t~post6; {14286#false} is VALID [2022-04-28 05:56:42,428 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-28 05:56:42,428 INFO L290 TraceCheckUtils]: 70: Hoare triple {14286#false} ~cond := #in~cond; {14286#false} is VALID [2022-04-28 05:56:42,428 INFO L290 TraceCheckUtils]: 71: Hoare triple {14286#false} assume 0 == ~cond; {14286#false} is VALID [2022-04-28 05:56:42,428 INFO L290 TraceCheckUtils]: 72: Hoare triple {14286#false} assume !false; {14286#false} is VALID [2022-04-28 05:56:42,428 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-28 05:56:42,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:42,781 INFO L290 TraceCheckUtils]: 72: Hoare triple {14286#false} assume !false; {14286#false} is VALID [2022-04-28 05:56:42,781 INFO L290 TraceCheckUtils]: 71: Hoare triple {14286#false} assume 0 == ~cond; {14286#false} is VALID [2022-04-28 05:56:42,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {14286#false} ~cond := #in~cond; {14286#false} is VALID [2022-04-28 05:56:42,781 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-28 05:56:42,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {14286#false} assume !(#t~post6 < 10);havoc #t~post6; {14286#false} is VALID [2022-04-28 05:56:42,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {14286#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14286#false} is VALID [2022-04-28 05:56:42,781 INFO L290 TraceCheckUtils]: 66: Hoare triple {14532#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {14286#false} is VALID [2022-04-28 05:56:42,782 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-28 05:56:42,782 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-28 05:56:42,783 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14285#true} {14536#(< ~counter~0 10)} #98#return; {14536#(< ~counter~0 10)} is VALID [2022-04-28 05:56:42,783 INFO L290 TraceCheckUtils]: 62: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,783 INFO L290 TraceCheckUtils]: 61: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,783 INFO L290 TraceCheckUtils]: 60: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,783 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-28 05:56:42,783 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-28 05:56:42,784 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-28 05:56:42,784 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-28 05:56:42,785 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14285#true} {14561#(< ~counter~0 9)} #98#return; {14561#(< ~counter~0 9)} is VALID [2022-04-28 05:56:42,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,785 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-28 05:56:42,785 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-28 05:56:42,786 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-28 05:56:42,786 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-28 05:56:42,786 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14285#true} {14586#(< ~counter~0 8)} #98#return; {14586#(< ~counter~0 8)} is VALID [2022-04-28 05:56:42,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,787 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-28 05:56:42,787 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-28 05:56:42,788 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-28 05:56:42,788 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-28 05:56:42,788 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14285#true} {14467#(<= ~counter~0 6)} #98#return; {14467#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:42,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,789 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-28 05:56:42,789 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-28 05:56:42,789 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-28 05:56:42,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {14442#(<= ~counter~0 5)} assume !(~r~0 > 0); {14442#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:42,790 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14285#true} {14442#(<= ~counter~0 5)} #96#return; {14442#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:42,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,790 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-28 05:56:42,791 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-28 05:56:42,791 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-28 05:56:42,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {14417#(<= ~counter~0 4)} assume !!(0 != ~r~0); {14417#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:42,792 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14285#true} {14417#(<= ~counter~0 4)} #94#return; {14417#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:42,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,792 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-28 05:56:42,793 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-28 05:56:42,793 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-28 05:56:42,793 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-28 05:56:42,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14285#true} {14392#(<= ~counter~0 3)} #92#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,794 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-28 05:56:42,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14285#true} {14392#(<= ~counter~0 3)} #90#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {14285#true} assume true; {14285#true} is VALID [2022-04-28 05:56:42,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {14285#true} assume !(0 == ~cond); {14285#true} is VALID [2022-04-28 05:56:42,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {14285#true} ~cond := #in~cond; {14285#true} is VALID [2022-04-28 05:56:42,795 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-28 05:56:42,795 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-28 05:56:42,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {14392#(<= ~counter~0 3)} call #t~ret9 := main(); {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14392#(<= ~counter~0 3)} {14285#true} #102#return; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {14392#(<= ~counter~0 3)} assume true; {14392#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:42,796 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-28 05:56:42,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {14285#true} call ULTIMATE.init(); {14285#true} is VALID [2022-04-28 05:56:42,797 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-28 05:56:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:42,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357371694] [2022-04-28 05:56:42,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:42,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512923045] [2022-04-28 05:56:42,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512923045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:42,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:42,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:56:42,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:42,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [584047050] [2022-04-28 05:56:42,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [584047050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:42,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:42,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:56:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359377369] [2022-04-28 05:56:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:42,798 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-28 05:56:42,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:42,798 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-28 05:56:42,851 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-28 05:56:42,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:56:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:42,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:56:42,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:42,852 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-28 05:56:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:43,411 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2022-04-28 05:56:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:56:43,411 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-28 05:56:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:43,411 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-28 05:56:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 05:56:43,413 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-28 05:56:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-28 05:56:43,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-28 05:56:43,559 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-28 05:56:43,562 INFO L225 Difference]: With dead ends: 193 [2022-04-28 05:56:43,562 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 05:56:43,562 INFO L412 NwaCegarLoop]: 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-28 05:56:43,563 INFO L413 NwaCegarLoop]: 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-28 05:56:43,563 INFO L414 NwaCegarLoop]: 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-28 05:56:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 05:56:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2022-04-28 05:56:43,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:43,752 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-28 05:56:43,752 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-28 05:56:43,752 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-28 05:56:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:43,755 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-28 05:56:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-28 05:56:43,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:43,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:43,756 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-28 05:56:43,756 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-28 05:56:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:43,759 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2022-04-28 05:56:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2022-04-28 05:56:43,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:43,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:43,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:43,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:43,760 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-28 05:56:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2022-04-28 05:56:43,763 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 73 [2022-04-28 05:56:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:43,763 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2022-04-28 05:56:43,764 INFO L496 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-28 05:56:43,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 177 transitions. [2022-04-28 05:56:46,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 176 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2022-04-28 05:56:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 05:56:46,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:46,023 INFO L195 NwaCegarLoop]: 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-28 05:56:46,039 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-28 05:56:46,223 WARN L477 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-28 05:56:46,223 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-28 05:56:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536997350] [2022-04-28 05:56:46,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-28 05:56:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:46,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807555201] [2022-04-28 05:56:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:46,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036099631] [2022-04-28 05:56:46,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:46,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:46,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:46,236 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-28 05:56:46,237 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-28 05:56:46,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:46,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:46,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 05:56:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:46,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:46,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {15698#true} call ULTIMATE.init(); {15698#true} is VALID [2022-04-28 05:56:46,689 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-28 05:56:46,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15706#(<= ~counter~0 0)} {15698#true} #102#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {15706#(<= ~counter~0 0)} call #t~ret9 := main(); {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,692 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-28 05:56:46,693 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-28 05:56:46,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {15706#(<= ~counter~0 0)} ~cond := #in~cond; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {15706#(<= ~counter~0 0)} assume !(0 == ~cond); {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15706#(<= ~counter~0 0)} {15706#(<= ~counter~0 0)} #90#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,695 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-28 05:56:46,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {15706#(<= ~counter~0 0)} ~cond := #in~cond; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {15706#(<= ~counter~0 0)} assume !(0 == ~cond); {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {15706#(<= ~counter~0 0)} assume true; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,697 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15706#(<= ~counter~0 0)} {15706#(<= ~counter~0 0)} #92#return; {15706#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:46,697 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-28 05:56:46,698 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-28 05:56:46,698 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-28 05:56:46,699 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-28 05:56:46,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {15755#(<= ~counter~0 1)} ~cond := #in~cond; {15755#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:46,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {15755#(<= ~counter~0 1)} assume !(0 == ~cond); {15755#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:46,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {15755#(<= ~counter~0 1)} assume true; {15755#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:46,701 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15755#(<= ~counter~0 1)} {15755#(<= ~counter~0 1)} #94#return; {15755#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:46,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {15755#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15755#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:46,702 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-28 05:56:46,702 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-28 05:56:46,703 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-28 05:56:46,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {15780#(<= ~counter~0 2)} ~cond := #in~cond; {15780#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:46,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {15780#(<= ~counter~0 2)} assume !(0 == ~cond); {15780#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:46,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {15780#(<= ~counter~0 2)} assume true; {15780#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:46,704 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15780#(<= ~counter~0 2)} {15780#(<= ~counter~0 2)} #96#return; {15780#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:46,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {15780#(<= ~counter~0 2)} assume !(~r~0 > 0); {15780#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:46,705 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-28 05:56:46,706 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-28 05:56:46,706 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-28 05:56:46,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {15805#(<= ~counter~0 3)} ~cond := #in~cond; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:46,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {15805#(<= ~counter~0 3)} assume !(0 == ~cond); {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:46,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {15805#(<= ~counter~0 3)} assume true; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:46,708 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15805#(<= ~counter~0 3)} {15805#(<= ~counter~0 3)} #98#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:46,709 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-28 05:56:46,709 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-28 05:56:46,710 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-28 05:56:46,710 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-28 05:56:46,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {15830#(<= ~counter~0 4)} ~cond := #in~cond; {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:46,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {15830#(<= ~counter~0 4)} assume !(0 == ~cond); {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:46,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {15830#(<= ~counter~0 4)} assume true; {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:46,712 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15830#(<= ~counter~0 4)} {15830#(<= ~counter~0 4)} #98#return; {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:46,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {15830#(<= ~counter~0 4)} assume !(~r~0 < 0); {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:46,713 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-28 05:56:46,713 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-28 05:56:46,714 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-28 05:56:46,715 INFO L290 TraceCheckUtils]: 52: Hoare triple {15855#(<= ~counter~0 5)} ~cond := #in~cond; {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:46,715 INFO L290 TraceCheckUtils]: 53: Hoare triple {15855#(<= ~counter~0 5)} assume !(0 == ~cond); {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:46,715 INFO L290 TraceCheckUtils]: 54: Hoare triple {15855#(<= ~counter~0 5)} assume true; {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:46,716 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15855#(<= ~counter~0 5)} {15855#(<= ~counter~0 5)} #94#return; {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:46,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {15855#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:46,717 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-28 05:56:46,717 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-28 05:56:46,718 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-28 05:56:46,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {15880#(<= ~counter~0 6)} ~cond := #in~cond; {15880#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:46,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {15880#(<= ~counter~0 6)} assume !(0 == ~cond); {15880#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:46,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {15880#(<= ~counter~0 6)} assume true; {15880#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:46,720 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15880#(<= ~counter~0 6)} {15880#(<= ~counter~0 6)} #96#return; {15880#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:46,720 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-28 05:56:46,720 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-28 05:56:46,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {15905#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {15699#false} is VALID [2022-04-28 05:56:46,721 INFO L290 TraceCheckUtils]: 67: Hoare triple {15699#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15699#false} is VALID [2022-04-28 05:56:46,721 INFO L290 TraceCheckUtils]: 68: Hoare triple {15699#false} assume !(#t~post8 < 10);havoc #t~post8; {15699#false} is VALID [2022-04-28 05:56:46,721 INFO L290 TraceCheckUtils]: 69: Hoare triple {15699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15699#false} is VALID [2022-04-28 05:56:46,721 INFO L290 TraceCheckUtils]: 70: Hoare triple {15699#false} assume !(#t~post6 < 10);havoc #t~post6; {15699#false} is VALID [2022-04-28 05:56:46,721 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-28 05:56:46,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {15699#false} ~cond := #in~cond; {15699#false} is VALID [2022-04-28 05:56:46,722 INFO L290 TraceCheckUtils]: 73: Hoare triple {15699#false} assume 0 == ~cond; {15699#false} is VALID [2022-04-28 05:56:46,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {15699#false} assume !false; {15699#false} is VALID [2022-04-28 05:56:46,722 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-28 05:56:46,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:47,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {15699#false} assume !false; {15699#false} is VALID [2022-04-28 05:56:47,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {15699#false} assume 0 == ~cond; {15699#false} is VALID [2022-04-28 05:56:47,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {15699#false} ~cond := #in~cond; {15699#false} is VALID [2022-04-28 05:56:47,075 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-28 05:56:47,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {15699#false} assume !(#t~post6 < 10);havoc #t~post6; {15699#false} is VALID [2022-04-28 05:56:47,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {15699#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15699#false} is VALID [2022-04-28 05:56:47,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {15699#false} assume !(#t~post8 < 10);havoc #t~post8; {15699#false} is VALID [2022-04-28 05:56:47,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {15699#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15699#false} is VALID [2022-04-28 05:56:47,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {15957#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {15699#false} is VALID [2022-04-28 05:56:47,082 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-28 05:56:47,082 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-28 05:56:47,082 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15698#true} {15961#(< ~counter~0 10)} #96#return; {15961#(< ~counter~0 10)} is VALID [2022-04-28 05:56:47,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,083 INFO L290 TraceCheckUtils]: 61: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,083 INFO L290 TraceCheckUtils]: 60: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,083 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-28 05:56:47,083 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-28 05:56:47,084 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-28 05:56:47,084 INFO L290 TraceCheckUtils]: 56: Hoare triple {15986#(< ~counter~0 9)} assume !!(0 != ~r~0); {15986#(< ~counter~0 9)} is VALID [2022-04-28 05:56:47,084 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15698#true} {15986#(< ~counter~0 9)} #94#return; {15986#(< ~counter~0 9)} is VALID [2022-04-28 05:56:47,085 INFO L290 TraceCheckUtils]: 54: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,085 INFO L290 TraceCheckUtils]: 53: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,085 INFO L290 TraceCheckUtils]: 52: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,085 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-28 05:56:47,085 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-28 05:56:47,085 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-28 05:56:47,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {16011#(< ~counter~0 8)} assume !(~r~0 < 0); {16011#(< ~counter~0 8)} is VALID [2022-04-28 05:56:47,086 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15698#true} {16011#(< ~counter~0 8)} #98#return; {16011#(< ~counter~0 8)} is VALID [2022-04-28 05:56:47,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,087 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-28 05:56:47,087 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-28 05:56:47,087 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-28 05:56:47,088 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-28 05:56:47,088 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15698#true} {15880#(<= ~counter~0 6)} #98#return; {15880#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:47,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,088 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-28 05:56:47,089 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-28 05:56:47,089 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-28 05:56:47,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {15855#(<= ~counter~0 5)} assume !(~r~0 > 0); {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:47,090 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15698#true} {15855#(<= ~counter~0 5)} #96#return; {15855#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:47,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,090 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-28 05:56:47,091 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-28 05:56:47,091 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-28 05:56:47,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {15830#(<= ~counter~0 4)} assume !!(0 != ~r~0); {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:47,092 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15698#true} {15830#(<= ~counter~0 4)} #94#return; {15830#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:47,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,092 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-28 05:56:47,092 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-28 05:56:47,093 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-28 05:56:47,093 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-28 05:56:47,094 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15698#true} {15805#(<= ~counter~0 3)} #92#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:47,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,094 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-28 05:56:47,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15698#true} {15805#(<= ~counter~0 3)} #90#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:47,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {15698#true} assume true; {15698#true} is VALID [2022-04-28 05:56:47,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {15698#true} assume !(0 == ~cond); {15698#true} is VALID [2022-04-28 05:56:47,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {15698#true} ~cond := #in~cond; {15698#true} is VALID [2022-04-28 05:56:47,098 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-28 05:56:47,098 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-28 05:56:47,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {15805#(<= ~counter~0 3)} call #t~ret9 := main(); {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:47,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15805#(<= ~counter~0 3)} {15698#true} #102#return; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:47,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {15805#(<= ~counter~0 3)} assume true; {15805#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:47,099 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-28 05:56:47,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {15698#true} call ULTIMATE.init(); {15698#true} is VALID [2022-04-28 05:56:47,100 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-28 05:56:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807555201] [2022-04-28 05:56:47,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036099631] [2022-04-28 05:56:47,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036099631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:47,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:47,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 05:56:47,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536997350] [2022-04-28 05:56:47,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536997350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:47,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:47,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:56:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259493849] [2022-04-28 05:56:47,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:47,101 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-28 05:56:47,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:47,102 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-28 05:56:47,164 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-28 05:56:47,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:56:47,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:56:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:47,164 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-28 05:56:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:47,741 INFO L93 Difference]: Finished difference Result 195 states and 255 transitions. [2022-04-28 05:56:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:56:47,741 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-28 05:56:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:47,742 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-28 05:56:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 05:56:47,744 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-28 05:56:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-28 05:56:47,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-28 05:56:47,882 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-28 05:56:47,885 INFO L225 Difference]: With dead ends: 195 [2022-04-28 05:56:47,885 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 05:56:47,886 INFO L412 NwaCegarLoop]: 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-28 05:56:47,886 INFO L413 NwaCegarLoop]: 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-28 05:56:47,887 INFO L414 NwaCegarLoop]: 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-28 05:56:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 05:56:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 05:56:48,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:48,094 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-28 05:56:48,094 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-28 05:56:48,095 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-28 05:56:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:48,098 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-28 05:56:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:56:48,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:48,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:48,099 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-28 05:56:48,099 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-28 05:56:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:48,103 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2022-04-28 05:56:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:56:48,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:48,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:48,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:48,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:48,104 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-28 05:56:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 183 transitions. [2022-04-28 05:56:48,108 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 183 transitions. Word has length 75 [2022-04-28 05:56:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:48,108 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 183 transitions. [2022-04-28 05:56:48,108 INFO L496 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-28 05:56:48,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 183 transitions. [2022-04-28 05:56:48,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 183 transitions. [2022-04-28 05:56:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 05:56:48,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:48,554 INFO L195 NwaCegarLoop]: 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-28 05:56:48,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 05:56:48,754 WARN L477 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-28 05:56:48,754 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-28 05:56:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:48,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794707543] [2022-04-28 05:56:48,755 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-28 05:56:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:48,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057498391] [2022-04-28 05:56:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:48,765 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:48,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658765226] [2022-04-28 05:56:48,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:48,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:48,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:48,766 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-28 05:56:48,773 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-28 05:56:48,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:48,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:48,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:56:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:48,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:49,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {17145#true} call ULTIMATE.init(); {17145#true} is VALID [2022-04-28 05:56:49,217 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-28 05:56:49,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17153#(<= ~counter~0 0)} {17145#true} #102#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {17153#(<= ~counter~0 0)} call #t~ret9 := main(); {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,218 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-28 05:56:49,219 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-28 05:56:49,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {17153#(<= ~counter~0 0)} ~cond := #in~cond; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {17153#(<= ~counter~0 0)} assume !(0 == ~cond); {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,220 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17153#(<= ~counter~0 0)} {17153#(<= ~counter~0 0)} #90#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,221 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-28 05:56:49,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {17153#(<= ~counter~0 0)} ~cond := #in~cond; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {17153#(<= ~counter~0 0)} assume !(0 == ~cond); {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {17153#(<= ~counter~0 0)} assume true; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,222 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17153#(<= ~counter~0 0)} {17153#(<= ~counter~0 0)} #92#return; {17153#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:49,222 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-28 05:56:49,223 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-28 05:56:49,223 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-28 05:56:49,224 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-28 05:56:49,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {17202#(<= ~counter~0 1)} ~cond := #in~cond; {17202#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:49,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {17202#(<= ~counter~0 1)} assume !(0 == ~cond); {17202#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:49,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {17202#(<= ~counter~0 1)} assume true; {17202#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:49,225 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17202#(<= ~counter~0 1)} {17202#(<= ~counter~0 1)} #94#return; {17202#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:49,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {17202#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17202#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:49,226 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-28 05:56:49,226 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-28 05:56:49,227 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-28 05:56:49,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {17227#(<= ~counter~0 2)} ~cond := #in~cond; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {17227#(<= ~counter~0 2)} assume !(0 == ~cond); {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {17227#(<= ~counter~0 2)} assume true; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,228 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17227#(<= ~counter~0 2)} {17227#(<= ~counter~0 2)} #96#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {17227#(<= ~counter~0 2)} assume !(~r~0 > 0); {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,229 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-28 05:56:49,229 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-28 05:56:49,230 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-28 05:56:49,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {17252#(<= ~counter~0 3)} ~cond := #in~cond; {17252#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:49,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {17252#(<= ~counter~0 3)} assume !(0 == ~cond); {17252#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:49,230 INFO L290 TraceCheckUtils]: 38: Hoare triple {17252#(<= ~counter~0 3)} assume true; {17252#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:49,231 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17252#(<= ~counter~0 3)} {17252#(<= ~counter~0 3)} #98#return; {17252#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:49,231 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-28 05:56:49,232 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-28 05:56:49,232 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-28 05:56:49,232 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-28 05:56:49,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {17277#(<= ~counter~0 4)} ~cond := #in~cond; {17277#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:49,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {17277#(<= ~counter~0 4)} assume !(0 == ~cond); {17277#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:49,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {17277#(<= ~counter~0 4)} assume true; {17277#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:49,234 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17277#(<= ~counter~0 4)} {17277#(<= ~counter~0 4)} #98#return; {17277#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:49,234 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-28 05:56:49,235 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-28 05:56:49,235 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-28 05:56:49,235 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-28 05:56:49,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {17302#(<= ~counter~0 5)} ~cond := #in~cond; {17302#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:49,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {17302#(<= ~counter~0 5)} assume !(0 == ~cond); {17302#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:49,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {17302#(<= ~counter~0 5)} assume true; {17302#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:49,237 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17302#(<= ~counter~0 5)} {17302#(<= ~counter~0 5)} #98#return; {17302#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:49,237 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-28 05:56:49,238 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-28 05:56:49,238 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-28 05:56:49,238 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-28 05:56:49,239 INFO L290 TraceCheckUtils]: 60: Hoare triple {17327#(<= ~counter~0 6)} ~cond := #in~cond; {17327#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:49,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {17327#(<= ~counter~0 6)} assume !(0 == ~cond); {17327#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:49,239 INFO L290 TraceCheckUtils]: 62: Hoare triple {17327#(<= ~counter~0 6)} assume true; {17327#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:49,240 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17327#(<= ~counter~0 6)} {17327#(<= ~counter~0 6)} #98#return; {17327#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:49,240 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-28 05:56:49,241 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-28 05:56:49,241 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-28 05:56:49,241 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-28 05:56:49,242 INFO L290 TraceCheckUtils]: 68: Hoare triple {17352#(<= ~counter~0 7)} ~cond := #in~cond; {17352#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:49,242 INFO L290 TraceCheckUtils]: 69: Hoare triple {17352#(<= ~counter~0 7)} assume !(0 == ~cond); {17352#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:49,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {17352#(<= ~counter~0 7)} assume true; {17352#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:49,243 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17352#(<= ~counter~0 7)} {17352#(<= ~counter~0 7)} #98#return; {17352#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:49,243 INFO L290 TraceCheckUtils]: 72: Hoare triple {17352#(<= ~counter~0 7)} assume !(~r~0 < 0); {17352#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:49,243 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-28 05:56:49,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {17377#(<= |main_#t~post6| 7)} assume !(#t~post6 < 10);havoc #t~post6; {17146#false} is VALID [2022-04-28 05:56:49,244 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-28 05:56:49,244 INFO L290 TraceCheckUtils]: 76: Hoare triple {17146#false} ~cond := #in~cond; {17146#false} is VALID [2022-04-28 05:56:49,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {17146#false} assume 0 == ~cond; {17146#false} is VALID [2022-04-28 05:56:49,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {17146#false} assume !false; {17146#false} is VALID [2022-04-28 05:56:49,244 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-28 05:56:49,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:49,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {17146#false} assume !false; {17146#false} is VALID [2022-04-28 05:56:49,617 INFO L290 TraceCheckUtils]: 77: Hoare triple {17146#false} assume 0 == ~cond; {17146#false} is VALID [2022-04-28 05:56:49,617 INFO L290 TraceCheckUtils]: 76: Hoare triple {17146#false} ~cond := #in~cond; {17146#false} is VALID [2022-04-28 05:56:49,617 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-28 05:56:49,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {17405#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {17146#false} is VALID [2022-04-28 05:56:49,617 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-28 05:56:49,618 INFO L290 TraceCheckUtils]: 72: Hoare triple {17409#(< ~counter~0 10)} assume !(~r~0 < 0); {17409#(< ~counter~0 10)} is VALID [2022-04-28 05:56:49,618 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17145#true} {17409#(< ~counter~0 10)} #98#return; {17409#(< ~counter~0 10)} is VALID [2022-04-28 05:56:49,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,618 INFO L290 TraceCheckUtils]: 69: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,618 INFO L290 TraceCheckUtils]: 68: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,619 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-28 05:56:49,619 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-28 05:56:49,619 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-28 05:56:49,620 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-28 05:56:49,620 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17145#true} {17434#(< ~counter~0 9)} #98#return; {17434#(< ~counter~0 9)} is VALID [2022-04-28 05:56:49,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,621 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-28 05:56:49,621 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-28 05:56:49,621 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-28 05:56:49,628 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-28 05:56:49,629 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17145#true} {17352#(<= ~counter~0 7)} #98#return; {17352#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:49,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,629 INFO L290 TraceCheckUtils]: 52: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,629 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-28 05:56:49,629 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-28 05:56:49,630 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-28 05:56:49,630 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-28 05:56:49,631 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17145#true} {17327#(<= ~counter~0 6)} #98#return; {17327#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:49,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,631 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-28 05:56:49,631 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-28 05:56:49,632 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-28 05:56:49,632 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-28 05:56:49,632 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17145#true} {17302#(<= ~counter~0 5)} #98#return; {17302#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:49,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,633 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-28 05:56:49,633 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-28 05:56:49,633 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-28 05:56:49,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {17277#(<= ~counter~0 4)} assume !(~r~0 > 0); {17277#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:49,634 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17145#true} {17277#(<= ~counter~0 4)} #96#return; {17277#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:49,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,635 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-28 05:56:49,635 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-28 05:56:49,635 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-28 05:56:49,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {17252#(<= ~counter~0 3)} assume !!(0 != ~r~0); {17252#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:49,636 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17145#true} {17252#(<= ~counter~0 3)} #94#return; {17252#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:49,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,636 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-28 05:56:49,637 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-28 05:56:49,637 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-28 05:56:49,637 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-28 05:56:49,638 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17145#true} {17227#(<= ~counter~0 2)} #92#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,638 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-28 05:56:49,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17145#true} {17227#(<= ~counter~0 2)} #90#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {17145#true} assume true; {17145#true} is VALID [2022-04-28 05:56:49,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {17145#true} assume !(0 == ~cond); {17145#true} is VALID [2022-04-28 05:56:49,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {17145#true} ~cond := #in~cond; {17145#true} is VALID [2022-04-28 05:56:49,639 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-28 05:56:49,639 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-28 05:56:49,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {17227#(<= ~counter~0 2)} call #t~ret9 := main(); {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17227#(<= ~counter~0 2)} {17145#true} #102#return; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {17227#(<= ~counter~0 2)} assume true; {17227#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:49,641 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-28 05:56:49,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {17145#true} call ULTIMATE.init(); {17145#true} is VALID [2022-04-28 05:56:49,641 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-28 05:56:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057498391] [2022-04-28 05:56:49,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:49,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658765226] [2022-04-28 05:56:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658765226] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:49,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:49,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 05:56:49,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:49,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794707543] [2022-04-28 05:56:49,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794707543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:49,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:49,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:56:49,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323182944] [2022-04-28 05:56:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:49,643 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-28 05:56:49,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:49,643 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-28 05:56:49,724 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-28 05:56:49,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:56:49,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:56:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:49,725 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-28 05:56:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:50,344 INFO L93 Difference]: Finished difference Result 168 states and 210 transitions. [2022-04-28 05:56:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:56:50,345 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-28 05:56:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:50,345 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-28 05:56:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 05:56:50,347 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-28 05:56:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-28 05:56:50,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-28 05:56:50,494 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-28 05:56:50,497 INFO L225 Difference]: With dead ends: 168 [2022-04-28 05:56:50,497 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 05:56:50,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:56:50,498 INFO L413 NwaCegarLoop]: 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-28 05:56:50,498 INFO L414 NwaCegarLoop]: 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-28 05:56:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 05:56:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-28 05:56:50,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:50,721 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-28 05:56:50,722 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-28 05:56:50,722 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-28 05:56:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:50,726 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 05:56:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 05:56:50,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:50,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:50,727 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-28 05:56:50,728 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-28 05:56:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:50,730 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-28 05:56:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-28 05:56:50,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:50,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:50,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:50,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:50,731 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-28 05:56:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2022-04-28 05:56:50,735 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 79 [2022-04-28 05:56:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:50,735 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2022-04-28 05:56:50,735 INFO L496 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-28 05:56:50,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 198 transitions. [2022-04-28 05:56:51,487 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-28 05:56:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2022-04-28 05:56:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 05:56:51,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:51,488 INFO L195 NwaCegarLoop]: 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-28 05:56:51,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 05:56:51,695 WARN L477 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-28 05:56:51,695 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-28 05:56:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117992728] [2022-04-28 05:56:51,696 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-28 05:56:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:51,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223151802] [2022-04-28 05:56:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:51,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:51,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197320985] [2022-04-28 05:56:51,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:56:51,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:51,715 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-28 05:56:51,716 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-28 05:56:51,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:56:51,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:51,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:56:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:51,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:52,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {18616#true} call ULTIMATE.init(); {18616#true} is VALID [2022-04-28 05:56:52,154 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-28 05:56:52,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18624#(<= ~counter~0 0)} {18616#true} #102#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {18624#(<= ~counter~0 0)} call #t~ret9 := main(); {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,155 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-28 05:56:52,156 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-28 05:56:52,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {18624#(<= ~counter~0 0)} ~cond := #in~cond; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {18624#(<= ~counter~0 0)} assume !(0 == ~cond); {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18624#(<= ~counter~0 0)} {18624#(<= ~counter~0 0)} #90#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,157 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-28 05:56:52,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {18624#(<= ~counter~0 0)} ~cond := #in~cond; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {18624#(<= ~counter~0 0)} assume !(0 == ~cond); {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {18624#(<= ~counter~0 0)} assume true; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18624#(<= ~counter~0 0)} {18624#(<= ~counter~0 0)} #92#return; {18624#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:52,159 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-28 05:56:52,160 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-28 05:56:52,160 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-28 05:56:52,160 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-28 05:56:52,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {18673#(<= ~counter~0 1)} ~cond := #in~cond; {18673#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {18673#(<= ~counter~0 1)} assume !(0 == ~cond); {18673#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {18673#(<= ~counter~0 1)} assume true; {18673#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,162 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18673#(<= ~counter~0 1)} {18673#(<= ~counter~0 1)} #94#return; {18673#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {18673#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18673#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:52,162 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-28 05:56:52,163 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-28 05:56:52,163 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-28 05:56:52,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {18698#(<= ~counter~0 2)} ~cond := #in~cond; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {18698#(<= ~counter~0 2)} assume !(0 == ~cond); {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {18698#(<= ~counter~0 2)} assume true; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,165 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18698#(<= ~counter~0 2)} {18698#(<= ~counter~0 2)} #96#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {18698#(<= ~counter~0 2)} assume !(~r~0 > 0); {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,165 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-28 05:56:52,166 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-28 05:56:52,166 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-28 05:56:52,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {18723#(<= ~counter~0 3)} ~cond := #in~cond; {18723#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {18723#(<= ~counter~0 3)} assume !(0 == ~cond); {18723#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {18723#(<= ~counter~0 3)} assume true; {18723#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,168 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18723#(<= ~counter~0 3)} {18723#(<= ~counter~0 3)} #98#return; {18723#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,168 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-28 05:56:52,168 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-28 05:56:52,169 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-28 05:56:52,169 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-28 05:56:52,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {18748#(<= ~counter~0 4)} ~cond := #in~cond; {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {18748#(<= ~counter~0 4)} assume !(0 == ~cond); {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {18748#(<= ~counter~0 4)} assume true; {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,171 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18748#(<= ~counter~0 4)} {18748#(<= ~counter~0 4)} #98#return; {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {18748#(<= ~counter~0 4)} assume !(~r~0 < 0); {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,171 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-28 05:56:52,172 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-28 05:56:52,172 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-28 05:56:52,172 INFO L290 TraceCheckUtils]: 52: Hoare triple {18773#(<= ~counter~0 5)} ~cond := #in~cond; {18773#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {18773#(<= ~counter~0 5)} assume !(0 == ~cond); {18773#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {18773#(<= ~counter~0 5)} assume true; {18773#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,173 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18773#(<= ~counter~0 5)} {18773#(<= ~counter~0 5)} #94#return; {18773#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {18773#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18773#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,174 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-28 05:56:52,175 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-28 05:56:52,175 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-28 05:56:52,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {18798#(<= ~counter~0 6)} ~cond := #in~cond; {18798#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {18798#(<= ~counter~0 6)} assume !(0 == ~cond); {18798#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {18798#(<= ~counter~0 6)} assume true; {18798#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,176 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18798#(<= ~counter~0 6)} {18798#(<= ~counter~0 6)} #96#return; {18798#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,177 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-28 05:56:52,177 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-28 05:56:52,177 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-28 05:56:52,178 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-28 05:56:52,178 INFO L290 TraceCheckUtils]: 68: Hoare triple {18823#(<= ~counter~0 7)} ~cond := #in~cond; {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {18823#(<= ~counter~0 7)} assume !(0 == ~cond); {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,179 INFO L290 TraceCheckUtils]: 70: Hoare triple {18823#(<= ~counter~0 7)} assume true; {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,179 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18823#(<= ~counter~0 7)} {18823#(<= ~counter~0 7)} #96#return; {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {18823#(<= ~counter~0 7)} assume !(~r~0 > 0); {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,180 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-28 05:56:52,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {18848#(<= |main_#t~post8| 7)} assume !(#t~post8 < 10);havoc #t~post8; {18617#false} is VALID [2022-04-28 05:56:52,180 INFO L290 TraceCheckUtils]: 75: Hoare triple {18617#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#false} is VALID [2022-04-28 05:56:52,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {18617#false} assume !(#t~post6 < 10);havoc #t~post6; {18617#false} is VALID [2022-04-28 05:56:52,181 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-28 05:56:52,181 INFO L290 TraceCheckUtils]: 78: Hoare triple {18617#false} ~cond := #in~cond; {18617#false} is VALID [2022-04-28 05:56:52,181 INFO L290 TraceCheckUtils]: 79: Hoare triple {18617#false} assume 0 == ~cond; {18617#false} is VALID [2022-04-28 05:56:52,181 INFO L290 TraceCheckUtils]: 80: Hoare triple {18617#false} assume !false; {18617#false} is VALID [2022-04-28 05:56:52,181 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-28 05:56:52,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:52,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {18617#false} assume !false; {18617#false} is VALID [2022-04-28 05:56:52,582 INFO L290 TraceCheckUtils]: 79: Hoare triple {18617#false} assume 0 == ~cond; {18617#false} is VALID [2022-04-28 05:56:52,582 INFO L290 TraceCheckUtils]: 78: Hoare triple {18617#false} ~cond := #in~cond; {18617#false} is VALID [2022-04-28 05:56:52,582 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-28 05:56:52,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {18617#false} assume !(#t~post6 < 10);havoc #t~post6; {18617#false} is VALID [2022-04-28 05:56:52,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {18617#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18617#false} is VALID [2022-04-28 05:56:52,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {18888#(< |main_#t~post8| 10)} assume !(#t~post8 < 10);havoc #t~post8; {18617#false} is VALID [2022-04-28 05:56:52,583 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-28 05:56:52,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {18892#(< ~counter~0 10)} assume !(~r~0 > 0); {18892#(< ~counter~0 10)} is VALID [2022-04-28 05:56:52,583 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18616#true} {18892#(< ~counter~0 10)} #96#return; {18892#(< ~counter~0 10)} is VALID [2022-04-28 05:56:52,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,584 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-28 05:56:52,584 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-28 05:56:52,585 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-28 05:56:52,585 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-28 05:56:52,586 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18616#true} {18917#(< ~counter~0 9)} #96#return; {18917#(< ~counter~0 9)} is VALID [2022-04-28 05:56:52,586 INFO L290 TraceCheckUtils]: 62: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,586 INFO L290 TraceCheckUtils]: 61: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,586 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-28 05:56:52,586 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-28 05:56:52,587 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-28 05:56:52,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {18823#(<= ~counter~0 7)} assume !!(0 != ~r~0); {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,588 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18616#true} {18823#(<= ~counter~0 7)} #94#return; {18823#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:52,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,588 INFO L290 TraceCheckUtils]: 53: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,588 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-28 05:56:52,588 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-28 05:56:52,589 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-28 05:56:52,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {18798#(<= ~counter~0 6)} assume !(~r~0 < 0); {18798#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,590 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18616#true} {18798#(<= ~counter~0 6)} #98#return; {18798#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:52,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,590 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-28 05:56:52,590 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-28 05:56:52,591 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-28 05:56:52,591 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-28 05:56:52,591 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18616#true} {18773#(<= ~counter~0 5)} #98#return; {18773#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:52,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,592 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-28 05:56:52,592 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-28 05:56:52,593 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-28 05:56:52,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {18748#(<= ~counter~0 4)} assume !(~r~0 > 0); {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,593 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18616#true} {18748#(<= ~counter~0 4)} #96#return; {18748#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:52,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,594 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-28 05:56:52,594 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-28 05:56:52,594 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-28 05:56:52,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {18723#(<= ~counter~0 3)} assume !!(0 != ~r~0); {18723#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,595 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18616#true} {18723#(<= ~counter~0 3)} #94#return; {18723#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:52,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,596 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-28 05:56:52,596 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-28 05:56:52,596 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-28 05:56:52,597 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-28 05:56:52,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18616#true} {18698#(<= ~counter~0 2)} #92#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,597 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-28 05:56:52,598 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18616#true} {18698#(<= ~counter~0 2)} #90#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {18616#true} assume true; {18616#true} is VALID [2022-04-28 05:56:52,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {18616#true} assume !(0 == ~cond); {18616#true} is VALID [2022-04-28 05:56:52,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {18616#true} ~cond := #in~cond; {18616#true} is VALID [2022-04-28 05:56:52,598 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-28 05:56:52,598 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-28 05:56:52,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {18698#(<= ~counter~0 2)} call #t~ret9 := main(); {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18698#(<= ~counter~0 2)} {18616#true} #102#return; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {18698#(<= ~counter~0 2)} assume true; {18698#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:52,600 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-28 05:56:52,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {18616#true} call ULTIMATE.init(); {18616#true} is VALID [2022-04-28 05:56:52,604 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-28 05:56:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:52,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223151802] [2022-04-28 05:56:52,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:52,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197320985] [2022-04-28 05:56:52,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197320985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:52,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:52,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 05:56:52,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:52,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117992728] [2022-04-28 05:56:52,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117992728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:52,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:52,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:56:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020583066] [2022-04-28 05:56:52,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:52,606 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-28 05:56:52,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:52,606 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-28 05:56:52,662 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-28 05:56:52,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:56:52,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:52,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:56:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:52,663 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-28 05:56:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:53,300 INFO L93 Difference]: Finished difference Result 213 states and 277 transitions. [2022-04-28 05:56:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:56:53,300 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-28 05:56:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:53,300 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-28 05:56:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 05:56:53,302 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-28 05:56:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-28 05:56:53,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-28 05:56:53,462 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-28 05:56:53,465 INFO L225 Difference]: With dead ends: 213 [2022-04-28 05:56:53,465 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 05:56:53,465 INFO L412 NwaCegarLoop]: 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-28 05:56:53,466 INFO L413 NwaCegarLoop]: 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-28 05:56:53,466 INFO L414 NwaCegarLoop]: 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-28 05:56:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 05:56:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-04-28 05:56:53,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:53,646 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-28 05:56:53,646 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-28 05:56:53,646 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-28 05:56:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:53,650 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-28 05:56:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-28 05:56:53,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:53,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:53,650 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-28 05:56:53,651 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-28 05:56:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:53,654 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-04-28 05:56:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 206 transitions. [2022-04-28 05:56:53,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:53,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:53,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:53,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:53,655 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-28 05:56:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-28 05:56:53,658 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 81 [2022-04-28 05:56:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:53,658 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-28 05:56:53,658 INFO L496 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-28 05:56:53,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-28 05:56:56,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 201 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-28 05:56:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 05:56:56,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:56,072 INFO L195 NwaCegarLoop]: 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-28 05:56:56,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 05:56:56,272 WARN L477 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-28 05:56:56,273 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-28 05:56:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:56,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [869215058] [2022-04-28 05:56:56,274 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-28 05:56:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:56,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20731831] [2022-04-28 05:56:56,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:56,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:56,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335457844] [2022-04-28 05:56:56,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:56,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:56,296 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-28 05:56:56,297 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-28 05:56:56,354 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:56,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:56,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 05:56:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:56,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:56,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {20199#true} call ULTIMATE.init(); {20199#true} is VALID [2022-04-28 05:56:56,829 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-28 05:56:56,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20207#(<= ~counter~0 0)} {20199#true} #102#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {20207#(<= ~counter~0 0)} call #t~ret9 := main(); {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,830 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-28 05:56:56,831 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-28 05:56:56,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {20207#(<= ~counter~0 0)} ~cond := #in~cond; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {20207#(<= ~counter~0 0)} assume !(0 == ~cond); {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20207#(<= ~counter~0 0)} {20207#(<= ~counter~0 0)} #90#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,832 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-28 05:56:56,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {20207#(<= ~counter~0 0)} ~cond := #in~cond; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {20207#(<= ~counter~0 0)} assume !(0 == ~cond); {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {20207#(<= ~counter~0 0)} assume true; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,834 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20207#(<= ~counter~0 0)} {20207#(<= ~counter~0 0)} #92#return; {20207#(<= ~counter~0 0)} is VALID [2022-04-28 05:56:56,834 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-28 05:56:56,835 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-28 05:56:56,835 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-28 05:56:56,835 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-28 05:56:56,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {20256#(<= ~counter~0 1)} ~cond := #in~cond; {20256#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {20256#(<= ~counter~0 1)} assume !(0 == ~cond); {20256#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {20256#(<= ~counter~0 1)} assume true; {20256#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,837 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20256#(<= ~counter~0 1)} {20256#(<= ~counter~0 1)} #94#return; {20256#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {20256#(<= ~counter~0 1)} assume !!(0 != ~r~0); {20256#(<= ~counter~0 1)} is VALID [2022-04-28 05:56:56,837 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-28 05:56:56,838 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-28 05:56:56,838 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-28 05:56:56,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {20281#(<= ~counter~0 2)} ~cond := #in~cond; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {20281#(<= ~counter~0 2)} assume !(0 == ~cond); {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {20281#(<= ~counter~0 2)} assume true; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,840 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20281#(<= ~counter~0 2)} {20281#(<= ~counter~0 2)} #96#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {20281#(<= ~counter~0 2)} assume !(~r~0 > 0); {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:56,840 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-28 05:56:56,841 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-28 05:56:56,841 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-28 05:56:56,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {20306#(<= ~counter~0 3)} ~cond := #in~cond; {20306#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {20306#(<= ~counter~0 3)} assume !(0 == ~cond); {20306#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {20306#(<= ~counter~0 3)} assume true; {20306#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,843 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20306#(<= ~counter~0 3)} {20306#(<= ~counter~0 3)} #98#return; {20306#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:56,843 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-28 05:56:56,843 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-28 05:56:56,844 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-28 05:56:56,844 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-28 05:56:56,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {20331#(<= ~counter~0 4)} ~cond := #in~cond; {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,845 INFO L290 TraceCheckUtils]: 45: Hoare triple {20331#(<= ~counter~0 4)} assume !(0 == ~cond); {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,845 INFO L290 TraceCheckUtils]: 46: Hoare triple {20331#(<= ~counter~0 4)} assume true; {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,846 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20331#(<= ~counter~0 4)} {20331#(<= ~counter~0 4)} #98#return; {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,846 INFO L290 TraceCheckUtils]: 48: Hoare triple {20331#(<= ~counter~0 4)} assume !(~r~0 < 0); {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:56,846 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-28 05:56:56,847 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-28 05:56:56,847 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-28 05:56:56,847 INFO L290 TraceCheckUtils]: 52: Hoare triple {20356#(<= ~counter~0 5)} ~cond := #in~cond; {20356#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {20356#(<= ~counter~0 5)} assume !(0 == ~cond); {20356#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {20356#(<= ~counter~0 5)} assume true; {20356#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,848 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20356#(<= ~counter~0 5)} {20356#(<= ~counter~0 5)} #94#return; {20356#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {20356#(<= ~counter~0 5)} assume !!(0 != ~r~0); {20356#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:56,849 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-28 05:56:56,849 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-28 05:56:56,850 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-28 05:56:56,850 INFO L290 TraceCheckUtils]: 60: Hoare triple {20381#(<= ~counter~0 6)} ~cond := #in~cond; {20381#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {20381#(<= ~counter~0 6)} assume !(0 == ~cond); {20381#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {20381#(<= ~counter~0 6)} assume true; {20381#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,851 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20381#(<= ~counter~0 6)} {20381#(<= ~counter~0 6)} #96#return; {20381#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:56,852 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-28 05:56:56,852 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-28 05:56:56,852 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-28 05:56:56,853 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-28 05:56:56,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {20406#(<= ~counter~0 7)} ~cond := #in~cond; {20406#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:56,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {20406#(<= ~counter~0 7)} assume !(0 == ~cond); {20406#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:56,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {20406#(<= ~counter~0 7)} assume true; {20406#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:56,854 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20406#(<= ~counter~0 7)} {20406#(<= ~counter~0 7)} #96#return; {20406#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:56,855 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-28 05:56:56,855 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-28 05:56:56,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {20431#(<= |main_#t~post7| 7)} assume !(#t~post7 < 10);havoc #t~post7; {20200#false} is VALID [2022-04-28 05:56:56,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {20200#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20200#false} is VALID [2022-04-28 05:56:56,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {20200#false} assume !(#t~post8 < 10);havoc #t~post8; {20200#false} is VALID [2022-04-28 05:56:56,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {20200#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20200#false} is VALID [2022-04-28 05:56:56,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {20200#false} assume !(#t~post6 < 10);havoc #t~post6; {20200#false} is VALID [2022-04-28 05:56:56,856 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-28 05:56:56,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {20200#false} ~cond := #in~cond; {20200#false} is VALID [2022-04-28 05:56:56,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {20200#false} assume 0 == ~cond; {20200#false} is VALID [2022-04-28 05:56:56,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {20200#false} assume !false; {20200#false} is VALID [2022-04-28 05:56:56,856 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-28 05:56:56,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:57,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {20200#false} assume !false; {20200#false} is VALID [2022-04-28 05:56:57,255 INFO L290 TraceCheckUtils]: 81: Hoare triple {20200#false} assume 0 == ~cond; {20200#false} is VALID [2022-04-28 05:56:57,255 INFO L290 TraceCheckUtils]: 80: Hoare triple {20200#false} ~cond := #in~cond; {20200#false} is VALID [2022-04-28 05:56:57,255 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-28 05:56:57,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {20200#false} assume !(#t~post6 < 10);havoc #t~post6; {20200#false} is VALID [2022-04-28 05:56:57,256 INFO L290 TraceCheckUtils]: 77: Hoare triple {20200#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20200#false} is VALID [2022-04-28 05:56:57,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {20200#false} assume !(#t~post8 < 10);havoc #t~post8; {20200#false} is VALID [2022-04-28 05:56:57,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {20200#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {20200#false} is VALID [2022-04-28 05:56:57,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {20483#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {20200#false} is VALID [2022-04-28 05:56:57,256 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-28 05:56:57,257 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-28 05:56:57,257 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20199#true} {20487#(< ~counter~0 10)} #96#return; {20487#(< ~counter~0 10)} is VALID [2022-04-28 05:56:57,257 INFO L290 TraceCheckUtils]: 70: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,257 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-28 05:56:57,258 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-28 05:56:57,258 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-28 05:56:57,259 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-28 05:56:57,259 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20199#true} {20512#(< ~counter~0 9)} #96#return; {20512#(< ~counter~0 9)} is VALID [2022-04-28 05:56:57,259 INFO L290 TraceCheckUtils]: 62: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,260 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-28 05:56:57,260 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-28 05:56:57,260 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-28 05:56:57,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {20406#(<= ~counter~0 7)} assume !!(0 != ~r~0); {20406#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:57,261 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20199#true} {20406#(<= ~counter~0 7)} #94#return; {20406#(<= ~counter~0 7)} is VALID [2022-04-28 05:56:57,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,261 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-28 05:56:57,262 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-28 05:56:57,262 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-28 05:56:57,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {20381#(<= ~counter~0 6)} assume !(~r~0 < 0); {20381#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:57,263 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {20199#true} {20381#(<= ~counter~0 6)} #98#return; {20381#(<= ~counter~0 6)} is VALID [2022-04-28 05:56:57,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,263 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-28 05:56:57,264 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-28 05:56:57,264 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-28 05:56:57,264 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-28 05:56:57,265 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20199#true} {20356#(<= ~counter~0 5)} #98#return; {20356#(<= ~counter~0 5)} is VALID [2022-04-28 05:56:57,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,265 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-28 05:56:57,265 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-28 05:56:57,266 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-28 05:56:57,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {20331#(<= ~counter~0 4)} assume !(~r~0 > 0); {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:57,267 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {20199#true} {20331#(<= ~counter~0 4)} #96#return; {20331#(<= ~counter~0 4)} is VALID [2022-04-28 05:56:57,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,267 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-28 05:56:57,267 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-28 05:56:57,268 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-28 05:56:57,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {20306#(<= ~counter~0 3)} assume !!(0 != ~r~0); {20306#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:57,269 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20199#true} {20306#(<= ~counter~0 3)} #94#return; {20306#(<= ~counter~0 3)} is VALID [2022-04-28 05:56:57,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,269 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-28 05:56:57,269 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-28 05:56:57,270 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-28 05:56:57,270 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-28 05:56:57,270 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20199#true} {20281#(<= ~counter~0 2)} #92#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:57,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,271 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-28 05:56:57,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20199#true} {20281#(<= ~counter~0 2)} #90#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:57,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {20199#true} assume true; {20199#true} is VALID [2022-04-28 05:56:57,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {20199#true} assume !(0 == ~cond); {20199#true} is VALID [2022-04-28 05:56:57,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {20199#true} ~cond := #in~cond; {20199#true} is VALID [2022-04-28 05:56:57,272 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-28 05:56:57,272 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-28 05:56:57,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {20281#(<= ~counter~0 2)} call #t~ret9 := main(); {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:57,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20281#(<= ~counter~0 2)} {20199#true} #102#return; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:57,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {20281#(<= ~counter~0 2)} assume true; {20281#(<= ~counter~0 2)} is VALID [2022-04-28 05:56:57,273 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-28 05:56:57,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {20199#true} call ULTIMATE.init(); {20199#true} is VALID [2022-04-28 05:56:57,273 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-28 05:56:57,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20731831] [2022-04-28 05:56:57,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335457844] [2022-04-28 05:56:57,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335457844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:56:57,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:56:57,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2022-04-28 05:56:57,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [869215058] [2022-04-28 05:56:57,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [869215058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:57,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:57,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 05:56:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516753328] [2022-04-28 05:56:57,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:57,275 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-28 05:56:57,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:57,275 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-28 05:56:57,331 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-28 05:56:57,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 05:56:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:57,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 05:56:57,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:56:57,332 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-28 05:56:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:57,967 INFO L93 Difference]: Finished difference Result 215 states and 280 transitions. [2022-04-28 05:56:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:56:57,967 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-28 05:56:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:57,967 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-28 05:56:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 05:56:57,969 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-28 05:56:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-28 05:56:57,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-28 05:56:58,106 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-28 05:56:58,109 INFO L225 Difference]: With dead ends: 215 [2022-04-28 05:56:58,109 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 05:56:58,109 INFO L412 NwaCegarLoop]: 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-28 05:56:58,109 INFO L413 NwaCegarLoop]: 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-28 05:56:58,110 INFO L414 NwaCegarLoop]: 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-28 05:56:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 05:56:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-28 05:56:58,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:58,338 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-28 05:56:58,338 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-28 05:56:58,338 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-28 05:56:58,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:58,341 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 05:56:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:56:58,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:58,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:58,342 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-28 05:56:58,342 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-28 05:56:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:58,345 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-28 05:56:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:56:58,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:58,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:58,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:58,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:58,346 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-28 05:56:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-04-28 05:56:58,349 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 83 [2022-04-28 05:56:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:58,349 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-04-28 05:56:58,350 INFO L496 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-28 05:56:58,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 208 transitions. [2022-04-28 05:57:00,703 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-28 05:57:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-04-28 05:57:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 05:57:00,704 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:00,704 INFO L195 NwaCegarLoop]: 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-28 05:57:00,727 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-28 05:57:00,919 WARN L477 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-28 05:57:00,919 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-28 05:57:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:00,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [347487070] [2022-04-28 05:57:00,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:00,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-28 05:57:00,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:00,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196732049] [2022-04-28 05:57:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:00,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:00,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:00,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553832297] [2022-04-28 05:57:00,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:00,933 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-28 05:57:00,937 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-28 05:57:00,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:00,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:00,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:57:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:01,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:01,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {21816#true} call ULTIMATE.init(); {21816#true} is VALID [2022-04-28 05:57:01,417 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-28 05:57:01,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21824#(<= ~counter~0 0)} {21816#true} #102#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {21824#(<= ~counter~0 0)} call #t~ret9 := main(); {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,418 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-28 05:57:01,418 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-28 05:57:01,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {21824#(<= ~counter~0 0)} ~cond := #in~cond; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {21824#(<= ~counter~0 0)} assume !(0 == ~cond); {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21824#(<= ~counter~0 0)} {21824#(<= ~counter~0 0)} #90#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,420 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-28 05:57:01,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {21824#(<= ~counter~0 0)} ~cond := #in~cond; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {21824#(<= ~counter~0 0)} assume !(0 == ~cond); {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {21824#(<= ~counter~0 0)} assume true; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,421 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21824#(<= ~counter~0 0)} {21824#(<= ~counter~0 0)} #92#return; {21824#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:01,422 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-28 05:57:01,422 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-28 05:57:01,423 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-28 05:57:01,423 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-28 05:57:01,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {21873#(<= ~counter~0 1)} ~cond := #in~cond; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {21873#(<= ~counter~0 1)} assume !(0 == ~cond); {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {21873#(<= ~counter~0 1)} assume true; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,425 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21873#(<= ~counter~0 1)} {21873#(<= ~counter~0 1)} #94#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {21873#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,425 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-28 05:57:01,426 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-28 05:57:01,426 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-28 05:57:01,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {21898#(<= ~counter~0 2)} ~cond := #in~cond; {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {21898#(<= ~counter~0 2)} assume !(0 == ~cond); {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {21898#(<= ~counter~0 2)} assume true; {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,428 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21898#(<= ~counter~0 2)} {21898#(<= ~counter~0 2)} #96#return; {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {21898#(<= ~counter~0 2)} assume !(~r~0 > 0); {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,428 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-28 05:57:01,429 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-28 05:57:01,429 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-28 05:57:01,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {21923#(<= ~counter~0 3)} ~cond := #in~cond; {21923#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:01,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {21923#(<= ~counter~0 3)} assume !(0 == ~cond); {21923#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:01,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {21923#(<= ~counter~0 3)} assume true; {21923#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:01,430 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21923#(<= ~counter~0 3)} {21923#(<= ~counter~0 3)} #98#return; {21923#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:01,431 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-28 05:57:01,431 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-28 05:57:01,432 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-28 05:57:01,432 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-28 05:57:01,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {21948#(<= ~counter~0 4)} ~cond := #in~cond; {21948#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:01,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {21948#(<= ~counter~0 4)} assume !(0 == ~cond); {21948#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:01,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {21948#(<= ~counter~0 4)} assume true; {21948#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:01,433 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21948#(<= ~counter~0 4)} {21948#(<= ~counter~0 4)} #98#return; {21948#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:01,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {21948#(<= ~counter~0 4)} assume !(~r~0 < 0); {21948#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:01,434 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-28 05:57:01,434 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-28 05:57:01,435 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-28 05:57:01,435 INFO L290 TraceCheckUtils]: 52: Hoare triple {21973#(<= ~counter~0 5)} ~cond := #in~cond; {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,436 INFO L290 TraceCheckUtils]: 53: Hoare triple {21973#(<= ~counter~0 5)} assume !(0 == ~cond); {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {21973#(<= ~counter~0 5)} assume true; {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,436 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21973#(<= ~counter~0 5)} {21973#(<= ~counter~0 5)} #94#return; {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {21973#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,437 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-28 05:57:01,437 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-28 05:57:01,438 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-28 05:57:01,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {21998#(<= ~counter~0 6)} ~cond := #in~cond; {21998#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:01,439 INFO L290 TraceCheckUtils]: 61: Hoare triple {21998#(<= ~counter~0 6)} assume !(0 == ~cond); {21998#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:01,439 INFO L290 TraceCheckUtils]: 62: Hoare triple {21998#(<= ~counter~0 6)} assume true; {21998#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:01,439 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21998#(<= ~counter~0 6)} {21998#(<= ~counter~0 6)} #96#return; {21998#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:01,440 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-28 05:57:01,440 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-28 05:57:01,440 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-28 05:57:01,441 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-28 05:57:01,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {22023#(<= ~counter~0 7)} ~cond := #in~cond; {22023#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:01,452 INFO L290 TraceCheckUtils]: 69: Hoare triple {22023#(<= ~counter~0 7)} assume !(0 == ~cond); {22023#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:01,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {22023#(<= ~counter~0 7)} assume true; {22023#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:01,453 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22023#(<= ~counter~0 7)} {22023#(<= ~counter~0 7)} #96#return; {22023#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:01,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {22023#(<= ~counter~0 7)} assume !(~r~0 > 0); {22023#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:01,455 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-28 05:57:01,455 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-28 05:57:01,456 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-28 05:57:01,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {22048#(<= ~counter~0 8)} ~cond := #in~cond; {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {22048#(<= ~counter~0 8)} assume !(0 == ~cond); {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {22048#(<= ~counter~0 8)} assume true; {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,459 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22048#(<= ~counter~0 8)} {22048#(<= ~counter~0 8)} #98#return; {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,459 INFO L290 TraceCheckUtils]: 80: Hoare triple {22048#(<= ~counter~0 8)} assume !(~r~0 < 0); {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,460 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-28 05:57:01,460 INFO L290 TraceCheckUtils]: 82: Hoare triple {22073#(<= |main_#t~post6| 8)} assume !(#t~post6 < 10);havoc #t~post6; {21817#false} is VALID [2022-04-28 05:57:01,460 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-28 05:57:01,460 INFO L290 TraceCheckUtils]: 84: Hoare triple {21817#false} ~cond := #in~cond; {21817#false} is VALID [2022-04-28 05:57:01,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {21817#false} assume 0 == ~cond; {21817#false} is VALID [2022-04-28 05:57:01,460 INFO L290 TraceCheckUtils]: 86: Hoare triple {21817#false} assume !false; {21817#false} is VALID [2022-04-28 05:57:01,461 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-28 05:57:01,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:01,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {21817#false} assume !false; {21817#false} is VALID [2022-04-28 05:57:01,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {21817#false} assume 0 == ~cond; {21817#false} is VALID [2022-04-28 05:57:01,848 INFO L290 TraceCheckUtils]: 84: Hoare triple {21817#false} ~cond := #in~cond; {21817#false} is VALID [2022-04-28 05:57:01,848 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-28 05:57:01,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {22101#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {21817#false} is VALID [2022-04-28 05:57:01,849 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-28 05:57:01,849 INFO L290 TraceCheckUtils]: 80: Hoare triple {22105#(< ~counter~0 10)} assume !(~r~0 < 0); {22105#(< ~counter~0 10)} is VALID [2022-04-28 05:57:01,849 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {21816#true} {22105#(< ~counter~0 10)} #98#return; {22105#(< ~counter~0 10)} is VALID [2022-04-28 05:57:01,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,850 INFO L290 TraceCheckUtils]: 77: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,850 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-28 05:57:01,850 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-28 05:57:01,851 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-28 05:57:01,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {22048#(<= ~counter~0 8)} assume !(~r~0 > 0); {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,852 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21816#true} {22048#(<= ~counter~0 8)} #96#return; {22048#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:01,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,852 INFO L290 TraceCheckUtils]: 68: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,852 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-28 05:57:01,852 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-28 05:57:01,853 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-28 05:57:01,853 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-28 05:57:01,853 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21816#true} {22023#(<= ~counter~0 7)} #96#return; {22023#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:01,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,854 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-28 05:57:01,854 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-28 05:57:01,854 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-28 05:57:01,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {21998#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21998#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:01,855 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21816#true} {21998#(<= ~counter~0 6)} #94#return; {21998#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:01,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,856 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-28 05:57:01,856 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-28 05:57:01,856 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-28 05:57:01,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {21973#(<= ~counter~0 5)} assume !(~r~0 < 0); {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,857 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21816#true} {21973#(<= ~counter~0 5)} #98#return; {21973#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:01,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,857 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-28 05:57:01,858 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-28 05:57:01,858 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-28 05:57:01,858 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-28 05:57:01,859 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21816#true} {21948#(<= ~counter~0 4)} #98#return; {21948#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:01,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,859 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-28 05:57:01,860 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-28 05:57:01,860 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-28 05:57:01,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {21923#(<= ~counter~0 3)} assume !(~r~0 > 0); {21923#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:01,861 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21816#true} {21923#(<= ~counter~0 3)} #96#return; {21923#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:01,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,861 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-28 05:57:01,861 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-28 05:57:01,862 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-28 05:57:01,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {21898#(<= ~counter~0 2)} assume !!(0 != ~r~0); {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,863 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21816#true} {21898#(<= ~counter~0 2)} #94#return; {21898#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:01,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,863 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-28 05:57:01,863 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-28 05:57:01,864 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-28 05:57:01,864 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-28 05:57:01,864 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21816#true} {21873#(<= ~counter~0 1)} #92#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,865 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-28 05:57:01,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21816#true} {21873#(<= ~counter~0 1)} #90#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {21816#true} assume true; {21816#true} is VALID [2022-04-28 05:57:01,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {21816#true} assume !(0 == ~cond); {21816#true} is VALID [2022-04-28 05:57:01,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {21816#true} ~cond := #in~cond; {21816#true} is VALID [2022-04-28 05:57:01,865 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-28 05:57:01,866 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-28 05:57:01,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {21873#(<= ~counter~0 1)} call #t~ret9 := main(); {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21873#(<= ~counter~0 1)} {21816#true} #102#return; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {21873#(<= ~counter~0 1)} assume true; {21873#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:01,867 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-28 05:57:01,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {21816#true} call ULTIMATE.init(); {21816#true} is VALID [2022-04-28 05:57:01,867 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-28 05:57:01,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:01,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196732049] [2022-04-28 05:57:01,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:01,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553832297] [2022-04-28 05:57:01,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553832297] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:01,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:01,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 05:57:01,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:01,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [347487070] [2022-04-28 05:57:01,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [347487070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:01,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:01,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:57:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189643425] [2022-04-28 05:57:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:01,869 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-28 05:57:01,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:01,869 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-28 05:57:01,927 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-28 05:57:01,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:57:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:01,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:57:01,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:57:01,927 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-28 05:57:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:02,647 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2022-04-28 05:57:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:57:02,647 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-28 05:57:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:02,647 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-28 05:57:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 05:57:02,649 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-28 05:57:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-28 05:57:02,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-28 05:57:02,787 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-28 05:57:02,790 INFO L225 Difference]: With dead ends: 188 [2022-04-28 05:57:02,790 INFO L226 Difference]: Without dead ends: 183 [2022-04-28 05:57:02,790 INFO L412 NwaCegarLoop]: 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-28 05:57:02,791 INFO L413 NwaCegarLoop]: 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-28 05:57:02,791 INFO L414 NwaCegarLoop]: 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-28 05:57:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-04-28 05:57:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2022-04-28 05:57:02,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:02,997 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-28 05:57:02,998 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-28 05:57:02,998 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-28 05:57:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:03,001 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-28 05:57:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-28 05:57:03,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:03,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:03,002 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-28 05:57:03,002 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-28 05:57:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:03,005 INFO L93 Difference]: Finished difference Result 183 states and 230 transitions. [2022-04-28 05:57:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-04-28 05:57:03,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:03,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:03,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:03,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:03,006 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-28 05:57:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-04-28 05:57:03,010 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 87 [2022-04-28 05:57:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:03,010 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-04-28 05:57:03,010 INFO L496 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-28 05:57:03,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 177 states and 223 transitions. [2022-04-28 05:57:05,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 222 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-28 05:57:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:57:05,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:05,391 INFO L195 NwaCegarLoop]: 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-28 05:57:05,414 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-28 05:57:05,613 WARN L477 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-28 05:57:05,614 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-28 05:57:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839243810] [2022-04-28 05:57:05,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-28 05:57:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:05,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078829353] [2022-04-28 05:57:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:05,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:05,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:05,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886997252] [2022-04-28 05:57:05,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:05,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:05,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:05,628 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-28 05:57:05,642 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-28 05:57:05,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:05,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:05,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 05:57:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:05,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:05,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {23457#true} call ULTIMATE.init(); {23457#true} is VALID [2022-04-28 05:57:05,910 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-28 05:57:05,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23457#true} {23457#true} #102#return; {23457#true} is VALID [2022-04-28 05:57:05,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {23457#true} call #t~ret9 := main(); {23457#true} is VALID [2022-04-28 05:57:05,911 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-28 05:57:05,911 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-28 05:57:05,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23457#true} {23457#true} #90#return; {23457#true} is VALID [2022-04-28 05:57:05,911 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-28 05:57:05,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23457#true} {23457#true} #92#return; {23457#true} is VALID [2022-04-28 05:57:05,912 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-28 05:57:05,912 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-28 05:57:05,912 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-28 05:57:05,912 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-28 05:57:05,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,912 INFO L290 TraceCheckUtils]: 22: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,913 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,913 INFO L290 TraceCheckUtils]: 24: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,913 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-28 05:57:05,914 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-28 05:57:05,914 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-28 05:57:05,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,914 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 > 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,915 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-28 05:57:05,915 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-28 05:57:05,915 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-28 05:57:05,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,916 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,916 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-28 05:57:05,917 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-28 05:57:05,917 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-28 05:57:05,917 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-28 05:57:05,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,918 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 < 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,918 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-28 05:57:05,918 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-28 05:57:05,918 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-28 05:57:05,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,919 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,919 INFO L290 TraceCheckUtils]: 56: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,920 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-28 05:57:05,920 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-28 05:57:05,920 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-28 05:57:05,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,920 INFO L290 TraceCheckUtils]: 61: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,920 INFO L290 TraceCheckUtils]: 62: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,940 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:05,941 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-28 05:57:05,941 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-28 05:57:05,942 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-28 05:57:05,942 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-28 05:57:05,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,943 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-28 05:57:05,944 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-28 05:57:05,944 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-28 05:57:05,945 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-28 05:57:05,945 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-28 05:57:05,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:05,945 INFO L290 TraceCheckUtils]: 77: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:05,945 INFO L290 TraceCheckUtils]: 78: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:05,946 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-28 05:57:05,947 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-28 05:57:05,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {23458#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23458#false} is VALID [2022-04-28 05:57:05,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {23458#false} assume !(#t~post8 < 10);havoc #t~post8; {23458#false} is VALID [2022-04-28 05:57:05,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {23458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23458#false} is VALID [2022-04-28 05:57:05,947 INFO L290 TraceCheckUtils]: 84: Hoare triple {23458#false} assume !(#t~post6 < 10);havoc #t~post6; {23458#false} is VALID [2022-04-28 05:57:05,948 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-28 05:57:05,948 INFO L290 TraceCheckUtils]: 86: Hoare triple {23458#false} ~cond := #in~cond; {23458#false} is VALID [2022-04-28 05:57:05,948 INFO L290 TraceCheckUtils]: 87: Hoare triple {23458#false} assume 0 == ~cond; {23458#false} is VALID [2022-04-28 05:57:05,948 INFO L290 TraceCheckUtils]: 88: Hoare triple {23458#false} assume !false; {23458#false} is VALID [2022-04-28 05:57:05,948 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-28 05:57:05,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:06,183 INFO L290 TraceCheckUtils]: 88: Hoare triple {23458#false} assume !false; {23458#false} is VALID [2022-04-28 05:57:06,183 INFO L290 TraceCheckUtils]: 87: Hoare triple {23458#false} assume 0 == ~cond; {23458#false} is VALID [2022-04-28 05:57:06,183 INFO L290 TraceCheckUtils]: 86: Hoare triple {23458#false} ~cond := #in~cond; {23458#false} is VALID [2022-04-28 05:57:06,183 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-28 05:57:06,183 INFO L290 TraceCheckUtils]: 84: Hoare triple {23458#false} assume !(#t~post6 < 10);havoc #t~post6; {23458#false} is VALID [2022-04-28 05:57:06,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {23458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23458#false} is VALID [2022-04-28 05:57:06,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {23458#false} assume !(#t~post8 < 10);havoc #t~post8; {23458#false} is VALID [2022-04-28 05:57:06,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {23458#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23458#false} is VALID [2022-04-28 05:57:06,184 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-28 05:57:06,185 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-28 05:57:06,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,185 INFO L290 TraceCheckUtils]: 76: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,185 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-28 05:57:06,185 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-28 05:57:06,185 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-28 05:57:06,186 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-28 05:57:06,186 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-28 05:57:06,186 INFO L290 TraceCheckUtils]: 70: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,186 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-28 05:57:06,187 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-28 05:57:06,187 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-28 05:57:06,187 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-28 05:57:06,188 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,188 INFO L290 TraceCheckUtils]: 62: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,188 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-28 05:57:06,188 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-28 05:57:06,189 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-28 05:57:06,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,189 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,190 INFO L290 TraceCheckUtils]: 52: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,190 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-28 05:57:06,190 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-28 05:57:06,190 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-28 05:57:06,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 < 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,191 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,191 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-28 05:57:06,192 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-28 05:57:06,192 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-28 05:57:06,192 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-28 05:57:06,193 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #98#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,193 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,193 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-28 05:57:06,193 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-28 05:57:06,193 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-28 05:57:06,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {23510#(<= main_~v~0 1)} assume !(~r~0 > 0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,194 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #96#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,194 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-28 05:57:06,195 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-28 05:57:06,195 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-28 05:57:06,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {23510#(<= main_~v~0 1)} assume !!(0 != ~r~0); {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,196 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23457#true} {23510#(<= main_~v~0 1)} #94#return; {23510#(<= main_~v~0 1)} is VALID [2022-04-28 05:57:06,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,196 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-28 05:57:06,196 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-28 05:57:06,196 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-28 05:57:06,197 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-28 05:57:06,197 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23457#true} {23457#true} #92#return; {23457#true} is VALID [2022-04-28 05:57:06,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,197 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-28 05:57:06,197 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23457#true} {23457#true} #90#return; {23457#true} is VALID [2022-04-28 05:57:06,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {23457#true} assume !(0 == ~cond); {23457#true} is VALID [2022-04-28 05:57:06,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {23457#true} ~cond := #in~cond; {23457#true} is VALID [2022-04-28 05:57:06,198 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-28 05:57:06,198 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-28 05:57:06,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {23457#true} call #t~ret9 := main(); {23457#true} is VALID [2022-04-28 05:57:06,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23457#true} {23457#true} #102#return; {23457#true} is VALID [2022-04-28 05:57:06,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {23457#true} assume true; {23457#true} is VALID [2022-04-28 05:57:06,198 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-28 05:57:06,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {23457#true} call ULTIMATE.init(); {23457#true} is VALID [2022-04-28 05:57:06,198 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-28 05:57:06,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:06,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078829353] [2022-04-28 05:57:06,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:06,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886997252] [2022-04-28 05:57:06,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886997252] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:06,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:06,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-28 05:57:06,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:06,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839243810] [2022-04-28 05:57:06,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839243810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:06,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:06,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:06,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342920196] [2022-04-28 05:57:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:06,199 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-28 05:57:06,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:06,200 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-28 05:57:06,242 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-28 05:57:06,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:06,242 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-28 05:57:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:06,855 INFO L93 Difference]: Finished difference Result 407 states and 543 transitions. [2022-04-28 05:57:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:57:06,855 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-28 05:57:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:06,855 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-28 05:57:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 05:57:06,856 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-28 05:57:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-28 05:57:06,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-28 05:57:06,953 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-28 05:57:06,958 INFO L225 Difference]: With dead ends: 407 [2022-04-28 05:57:06,958 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 05:57:06,959 INFO L412 NwaCegarLoop]: 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-28 05:57:06,959 INFO L413 NwaCegarLoop]: 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-28 05:57:06,959 INFO L414 NwaCegarLoop]: 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-28 05:57:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 05:57:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 296. [2022-04-28 05:57:07,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:07,400 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-28 05:57:07,401 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-28 05:57:07,401 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-28 05:57:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:07,409 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-28 05:57:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-28 05:57:07,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:07,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:07,411 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-28 05:57:07,412 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-28 05:57:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:07,418 INFO L93 Difference]: Finished difference Result 301 states and 401 transitions. [2022-04-28 05:57:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-04-28 05:57:07,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:07,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:07,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:07,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:07,420 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-28 05:57:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 395 transitions. [2022-04-28 05:57:07,428 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 395 transitions. Word has length 89 [2022-04-28 05:57:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:07,428 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 395 transitions. [2022-04-28 05:57:07,429 INFO L496 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-28 05:57:07,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 296 states and 395 transitions. [2022-04-28 05:57:10,203 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-28 05:57:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-04-28 05:57:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-28 05:57:10,205 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:10,205 INFO L195 NwaCegarLoop]: 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-28 05:57:10,221 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-28 05:57:10,405 WARN L477 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-28 05:57:10,405 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:10,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-28 05:57:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274000962] [2022-04-28 05:57:10,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-28 05:57:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:10,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277770860] [2022-04-28 05:57:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:10,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:10,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577319404] [2022-04-28 05:57:10,420 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:10,421 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-28 05:57:10,457 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-28 05:57:10,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:57:10,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:10,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:57:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:10,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:11,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {26004#true} call ULTIMATE.init(); {26004#true} is VALID [2022-04-28 05:57:11,027 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-28 05:57:11,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26012#(<= ~counter~0 0)} {26004#true} #102#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {26012#(<= ~counter~0 0)} call #t~ret9 := main(); {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,031 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-28 05:57:11,032 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-28 05:57:11,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {26012#(<= ~counter~0 0)} ~cond := #in~cond; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {26012#(<= ~counter~0 0)} assume !(0 == ~cond); {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26012#(<= ~counter~0 0)} {26012#(<= ~counter~0 0)} #90#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,034 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-28 05:57:11,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {26012#(<= ~counter~0 0)} ~cond := #in~cond; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {26012#(<= ~counter~0 0)} assume !(0 == ~cond); {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,035 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26012#(<= ~counter~0 0)} {26012#(<= ~counter~0 0)} #92#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,036 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-28 05:57:11,037 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-28 05:57:11,037 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-28 05:57:11,038 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-28 05:57:11,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {26061#(<= ~counter~0 1)} ~cond := #in~cond; {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {26061#(<= ~counter~0 1)} assume !(0 == ~cond); {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {26061#(<= ~counter~0 1)} assume true; {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,039 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26061#(<= ~counter~0 1)} {26061#(<= ~counter~0 1)} #94#return; {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {26061#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,040 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-28 05:57:11,040 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-28 05:57:11,041 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-28 05:57:11,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {26086#(<= ~counter~0 2)} ~cond := #in~cond; {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {26086#(<= ~counter~0 2)} assume !(0 == ~cond); {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {26086#(<= ~counter~0 2)} assume true; {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,043 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26086#(<= ~counter~0 2)} {26086#(<= ~counter~0 2)} #96#return; {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {26086#(<= ~counter~0 2)} assume !(~r~0 > 0); {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,044 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-28 05:57:11,044 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-28 05:57:11,044 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-28 05:57:11,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {26111#(<= ~counter~0 3)} ~cond := #in~cond; {26111#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {26111#(<= ~counter~0 3)} assume !(0 == ~cond); {26111#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:11,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {26111#(<= ~counter~0 3)} assume true; {26111#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:11,046 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26111#(<= ~counter~0 3)} {26111#(<= ~counter~0 3)} #98#return; {26111#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:11,046 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-28 05:57:11,046 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-28 05:57:11,047 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-28 05:57:11,047 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-28 05:57:11,047 INFO L290 TraceCheckUtils]: 44: Hoare triple {26136#(<= ~counter~0 4)} ~cond := #in~cond; {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,048 INFO L290 TraceCheckUtils]: 45: Hoare triple {26136#(<= ~counter~0 4)} assume !(0 == ~cond); {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,048 INFO L290 TraceCheckUtils]: 46: Hoare triple {26136#(<= ~counter~0 4)} assume true; {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,048 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26136#(<= ~counter~0 4)} {26136#(<= ~counter~0 4)} #98#return; {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {26136#(<= ~counter~0 4)} assume !(~r~0 < 0); {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,049 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-28 05:57:11,050 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-28 05:57:11,050 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-28 05:57:11,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {26161#(<= ~counter~0 5)} ~cond := #in~cond; {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {26161#(<= ~counter~0 5)} assume !(0 == ~cond); {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {26161#(<= ~counter~0 5)} assume true; {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,051 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26161#(<= ~counter~0 5)} {26161#(<= ~counter~0 5)} #94#return; {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {26161#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,052 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-28 05:57:11,052 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-28 05:57:11,053 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-28 05:57:11,053 INFO L290 TraceCheckUtils]: 60: Hoare triple {26186#(<= ~counter~0 6)} ~cond := #in~cond; {26186#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:11,053 INFO L290 TraceCheckUtils]: 61: Hoare triple {26186#(<= ~counter~0 6)} assume !(0 == ~cond); {26186#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:11,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {26186#(<= ~counter~0 6)} assume true; {26186#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:11,054 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26186#(<= ~counter~0 6)} {26186#(<= ~counter~0 6)} #96#return; {26186#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:11,054 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-28 05:57:11,055 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-28 05:57:11,055 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-28 05:57:11,056 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-28 05:57:11,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {26211#(<= ~counter~0 7)} ~cond := #in~cond; {26211#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:11,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {26211#(<= ~counter~0 7)} assume !(0 == ~cond); {26211#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:11,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {26211#(<= ~counter~0 7)} assume true; {26211#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:11,057 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26211#(<= ~counter~0 7)} {26211#(<= ~counter~0 7)} #96#return; {26211#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:11,057 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-28 05:57:11,058 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-28 05:57:11,058 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-28 05:57:11,059 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-28 05:57:11,059 INFO L290 TraceCheckUtils]: 76: Hoare triple {26236#(<= ~counter~0 8)} ~cond := #in~cond; {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,059 INFO L290 TraceCheckUtils]: 77: Hoare triple {26236#(<= ~counter~0 8)} assume !(0 == ~cond); {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,059 INFO L290 TraceCheckUtils]: 78: Hoare triple {26236#(<= ~counter~0 8)} assume true; {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,060 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26236#(<= ~counter~0 8)} {26236#(<= ~counter~0 8)} #96#return; {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {26236#(<= ~counter~0 8)} assume !(~r~0 > 0); {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,061 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-28 05:57:11,061 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-28 05:57:11,061 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-28 05:57:11,062 INFO L290 TraceCheckUtils]: 84: Hoare triple {26268#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {26005#false} is VALID [2022-04-28 05:57:11,062 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-28 05:57:11,062 INFO L290 TraceCheckUtils]: 86: Hoare triple {26005#false} ~cond := #in~cond; {26005#false} is VALID [2022-04-28 05:57:11,062 INFO L290 TraceCheckUtils]: 87: Hoare triple {26005#false} assume 0 == ~cond; {26005#false} is VALID [2022-04-28 05:57:11,062 INFO L290 TraceCheckUtils]: 88: Hoare triple {26005#false} assume !false; {26005#false} is VALID [2022-04-28 05:57:11,062 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-28 05:57:11,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:11,437 INFO L290 TraceCheckUtils]: 88: Hoare triple {26005#false} assume !false; {26005#false} is VALID [2022-04-28 05:57:11,437 INFO L290 TraceCheckUtils]: 87: Hoare triple {26005#false} assume 0 == ~cond; {26005#false} is VALID [2022-04-28 05:57:11,437 INFO L290 TraceCheckUtils]: 86: Hoare triple {26005#false} ~cond := #in~cond; {26005#false} is VALID [2022-04-28 05:57:11,437 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-28 05:57:11,437 INFO L290 TraceCheckUtils]: 84: Hoare triple {26268#(<= |main_#t~post6| 9)} assume !(#t~post6 < 10);havoc #t~post6; {26005#false} is VALID [2022-04-28 05:57:11,438 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-28 05:57:11,438 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-28 05:57:11,439 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-28 05:57:11,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {26236#(<= ~counter~0 8)} assume !(~r~0 > 0); {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,440 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26004#true} {26236#(<= ~counter~0 8)} #96#return; {26236#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:11,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,440 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-28 05:57:11,440 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-28 05:57:11,441 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-28 05:57:11,441 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-28 05:57:11,441 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26004#true} {26211#(<= ~counter~0 7)} #96#return; {26211#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:11,441 INFO L290 TraceCheckUtils]: 70: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,442 INFO L290 TraceCheckUtils]: 69: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,442 INFO L290 TraceCheckUtils]: 68: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,442 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-28 05:57:11,449 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-28 05:57:11,450 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-28 05:57:11,450 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-28 05:57:11,451 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26004#true} {26186#(<= ~counter~0 6)} #96#return; {26186#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:11,451 INFO L290 TraceCheckUtils]: 62: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,451 INFO L290 TraceCheckUtils]: 61: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,451 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-28 05:57:11,451 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-28 05:57:11,452 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-28 05:57:11,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {26161#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,452 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26004#true} {26161#(<= ~counter~0 5)} #94#return; {26161#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:11,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,453 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-28 05:57:11,453 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-28 05:57:11,455 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-28 05:57:11,456 INFO L290 TraceCheckUtils]: 48: Hoare triple {26136#(<= ~counter~0 4)} assume !(~r~0 < 0); {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,456 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26004#true} {26136#(<= ~counter~0 4)} #98#return; {26136#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:11,456 INFO L290 TraceCheckUtils]: 46: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,457 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-28 05:57:11,457 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-28 05:57:11,458 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-28 05:57:11,458 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-28 05:57:11,459 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26004#true} {26111#(<= ~counter~0 3)} #98#return; {26111#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:11,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,459 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-28 05:57:11,460 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-28 05:57:11,460 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-28 05:57:11,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {26086#(<= ~counter~0 2)} assume !(~r~0 > 0); {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,461 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26004#true} {26086#(<= ~counter~0 2)} #96#return; {26086#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:11,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,462 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-28 05:57:11,462 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-28 05:57:11,463 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-28 05:57:11,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {26061#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,464 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26004#true} {26061#(<= ~counter~0 1)} #94#return; {26061#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:11,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,464 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-28 05:57:11,464 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-28 05:57:11,465 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-28 05:57:11,465 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-28 05:57:11,466 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26004#true} {26012#(<= ~counter~0 0)} #92#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,466 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-28 05:57:11,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26004#true} {26012#(<= ~counter~0 0)} #90#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {26004#true} assume true; {26004#true} is VALID [2022-04-28 05:57:11,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {26004#true} assume !(0 == ~cond); {26004#true} is VALID [2022-04-28 05:57:11,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {26004#true} ~cond := #in~cond; {26004#true} is VALID [2022-04-28 05:57:11,467 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-28 05:57:11,468 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-28 05:57:11,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {26012#(<= ~counter~0 0)} call #t~ret9 := main(); {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26012#(<= ~counter~0 0)} {26004#true} #102#return; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {26012#(<= ~counter~0 0)} assume true; {26012#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:11,469 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-28 05:57:11,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {26004#true} call ULTIMATE.init(); {26004#true} is VALID [2022-04-28 05:57:11,470 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-28 05:57:11,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:11,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277770860] [2022-04-28 05:57:11,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:11,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577319404] [2022-04-28 05:57:11,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577319404] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:11,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:11,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 05:57:11,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:11,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274000962] [2022-04-28 05:57:11,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274000962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:11,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:11,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:57:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182897669] [2022-04-28 05:57:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:11,472 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-28 05:57:11,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:11,473 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-28 05:57:11,550 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-28 05:57:11,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:57:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:57:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:57:11,552 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-28 05:57:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:12,639 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-28 05:57:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 05:57:12,640 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-28 05:57:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:12,640 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-28 05:57:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:12,642 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-28 05:57:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:12,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 05:57:12,803 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-28 05:57:12,809 INFO L225 Difference]: With dead ends: 362 [2022-04-28 05:57:12,809 INFO L226 Difference]: Without dead ends: 357 [2022-04-28 05:57:12,809 INFO L412 NwaCegarLoop]: 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-28 05:57:12,810 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:12,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 240 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-28 05:57:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 342. [2022-04-28 05:57:13,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:13,302 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-28 05:57:13,303 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-28 05:57:13,303 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-28 05:57:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:13,308 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-28 05:57:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-28 05:57:13,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:13,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:13,310 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-28 05:57:13,310 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-28 05:57:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:13,318 INFO L93 Difference]: Finished difference Result 357 states and 477 transitions. [2022-04-28 05:57:13,318 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 477 transitions. [2022-04-28 05:57:13,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:13,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:13,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:13,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:13,320 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-28 05:57:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2022-04-28 05:57:13,330 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 89 [2022-04-28 05:57:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:13,330 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2022-04-28 05:57:13,330 INFO L496 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-28 05:57:13,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 460 transitions. [2022-04-28 05:57:16,253 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-28 05:57:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2022-04-28 05:57:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 05:57:16,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:16,254 INFO L195 NwaCegarLoop]: 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-28 05:57:16,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 05:57:16,454 WARN L477 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-28 05:57:16,455 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-28 05:57:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597269949] [2022-04-28 05:57:16,455 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-28 05:57:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:16,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152657146] [2022-04-28 05:57:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:16,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:16,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226021876] [2022-04-28 05:57:16,480 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:57:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:16,481 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-28 05:57:16,482 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-28 05:57:16,625 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 05:57:16,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:16,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 05:57:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:16,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:17,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {28684#true} call ULTIMATE.init(); {28684#true} is VALID [2022-04-28 05:57:17,061 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-28 05:57:17,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28692#(<= ~counter~0 0)} {28684#true} #102#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {28692#(<= ~counter~0 0)} call #t~ret9 := main(); {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,063 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-28 05:57:17,063 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-28 05:57:17,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {28692#(<= ~counter~0 0)} ~cond := #in~cond; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {28692#(<= ~counter~0 0)} assume !(0 == ~cond); {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28692#(<= ~counter~0 0)} {28692#(<= ~counter~0 0)} #90#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,065 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-28 05:57:17,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {28692#(<= ~counter~0 0)} ~cond := #in~cond; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {28692#(<= ~counter~0 0)} assume !(0 == ~cond); {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {28692#(<= ~counter~0 0)} assume true; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28692#(<= ~counter~0 0)} {28692#(<= ~counter~0 0)} #92#return; {28692#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:17,067 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-28 05:57:17,068 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-28 05:57:17,068 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-28 05:57:17,069 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-28 05:57:17,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {28741#(<= ~counter~0 1)} ~cond := #in~cond; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {28741#(<= ~counter~0 1)} assume !(0 == ~cond); {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {28741#(<= ~counter~0 1)} assume true; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,070 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28741#(<= ~counter~0 1)} {28741#(<= ~counter~0 1)} #94#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {28741#(<= ~counter~0 1)} assume !!(0 != ~r~0); {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,071 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-28 05:57:17,071 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-28 05:57:17,072 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-28 05:57:17,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {28766#(<= ~counter~0 2)} ~cond := #in~cond; {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {28766#(<= ~counter~0 2)} assume !(0 == ~cond); {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {28766#(<= ~counter~0 2)} assume true; {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,073 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28766#(<= ~counter~0 2)} {28766#(<= ~counter~0 2)} #96#return; {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {28766#(<= ~counter~0 2)} assume !(~r~0 > 0); {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,074 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-28 05:57:17,074 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-28 05:57:17,074 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-28 05:57:17,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {28791#(<= ~counter~0 3)} ~cond := #in~cond; {28791#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:17,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {28791#(<= ~counter~0 3)} assume !(0 == ~cond); {28791#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:17,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {28791#(<= ~counter~0 3)} assume true; {28791#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:17,076 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28791#(<= ~counter~0 3)} {28791#(<= ~counter~0 3)} #98#return; {28791#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:17,076 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-28 05:57:17,077 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-28 05:57:17,083 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-28 05:57:17,084 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-28 05:57:17,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {28816#(<= ~counter~0 4)} ~cond := #in~cond; {28816#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:17,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {28816#(<= ~counter~0 4)} assume !(0 == ~cond); {28816#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:17,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {28816#(<= ~counter~0 4)} assume true; {28816#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:17,086 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28816#(<= ~counter~0 4)} {28816#(<= ~counter~0 4)} #98#return; {28816#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:17,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {28816#(<= ~counter~0 4)} assume !(~r~0 < 0); {28816#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:17,087 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-28 05:57:17,087 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-28 05:57:17,088 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-28 05:57:17,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {28841#(<= ~counter~0 5)} ~cond := #in~cond; {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {28841#(<= ~counter~0 5)} assume !(0 == ~cond); {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {28841#(<= ~counter~0 5)} assume true; {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,090 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28841#(<= ~counter~0 5)} {28841#(<= ~counter~0 5)} #94#return; {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,090 INFO L290 TraceCheckUtils]: 56: Hoare triple {28841#(<= ~counter~0 5)} assume !!(0 != ~r~0); {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,091 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-28 05:57:17,091 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-28 05:57:17,092 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-28 05:57:17,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {28866#(<= ~counter~0 6)} ~cond := #in~cond; {28866#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:17,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {28866#(<= ~counter~0 6)} assume !(0 == ~cond); {28866#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:17,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {28866#(<= ~counter~0 6)} assume true; {28866#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:17,093 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28866#(<= ~counter~0 6)} {28866#(<= ~counter~0 6)} #96#return; {28866#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:17,094 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-28 05:57:17,095 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-28 05:57:17,095 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-28 05:57:17,095 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-28 05:57:17,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {28891#(<= ~counter~0 7)} ~cond := #in~cond; {28891#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:17,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {28891#(<= ~counter~0 7)} assume !(0 == ~cond); {28891#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:17,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {28891#(<= ~counter~0 7)} assume true; {28891#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:17,097 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28891#(<= ~counter~0 7)} {28891#(<= ~counter~0 7)} #96#return; {28891#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:17,097 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-28 05:57:17,097 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-28 05:57:17,098 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-28 05:57:17,098 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-28 05:57:17,099 INFO L290 TraceCheckUtils]: 76: Hoare triple {28916#(<= ~counter~0 8)} ~cond := #in~cond; {28916#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:17,099 INFO L290 TraceCheckUtils]: 77: Hoare triple {28916#(<= ~counter~0 8)} assume !(0 == ~cond); {28916#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:17,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {28916#(<= ~counter~0 8)} assume true; {28916#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:17,100 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28916#(<= ~counter~0 8)} {28916#(<= ~counter~0 8)} #96#return; {28916#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:17,100 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-28 05:57:17,100 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-28 05:57:17,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {28941#(<= |main_#t~post7| 8)} assume !(#t~post7 < 10);havoc #t~post7; {28685#false} is VALID [2022-04-28 05:57:17,101 INFO L290 TraceCheckUtils]: 83: Hoare triple {28685#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28685#false} is VALID [2022-04-28 05:57:17,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {28685#false} assume !(#t~post8 < 10);havoc #t~post8; {28685#false} is VALID [2022-04-28 05:57:17,101 INFO L290 TraceCheckUtils]: 85: Hoare triple {28685#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28685#false} is VALID [2022-04-28 05:57:17,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {28685#false} assume !(#t~post6 < 10);havoc #t~post6; {28685#false} is VALID [2022-04-28 05:57:17,101 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-28 05:57:17,101 INFO L290 TraceCheckUtils]: 88: Hoare triple {28685#false} ~cond := #in~cond; {28685#false} is VALID [2022-04-28 05:57:17,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {28685#false} assume 0 == ~cond; {28685#false} is VALID [2022-04-28 05:57:17,101 INFO L290 TraceCheckUtils]: 90: Hoare triple {28685#false} assume !false; {28685#false} is VALID [2022-04-28 05:57:17,101 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-28 05:57:17,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:17,513 INFO L290 TraceCheckUtils]: 90: Hoare triple {28685#false} assume !false; {28685#false} is VALID [2022-04-28 05:57:17,513 INFO L290 TraceCheckUtils]: 89: Hoare triple {28685#false} assume 0 == ~cond; {28685#false} is VALID [2022-04-28 05:57:17,514 INFO L290 TraceCheckUtils]: 88: Hoare triple {28685#false} ~cond := #in~cond; {28685#false} is VALID [2022-04-28 05:57:17,514 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-28 05:57:17,514 INFO L290 TraceCheckUtils]: 86: Hoare triple {28685#false} assume !(#t~post6 < 10);havoc #t~post6; {28685#false} is VALID [2022-04-28 05:57:17,514 INFO L290 TraceCheckUtils]: 85: Hoare triple {28685#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28685#false} is VALID [2022-04-28 05:57:17,514 INFO L290 TraceCheckUtils]: 84: Hoare triple {28685#false} assume !(#t~post8 < 10);havoc #t~post8; {28685#false} is VALID [2022-04-28 05:57:17,514 INFO L290 TraceCheckUtils]: 83: Hoare triple {28685#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28685#false} is VALID [2022-04-28 05:57:17,514 INFO L290 TraceCheckUtils]: 82: Hoare triple {28993#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {28685#false} is VALID [2022-04-28 05:57:17,515 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-28 05:57:17,515 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-28 05:57:17,516 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28684#true} {28997#(< ~counter~0 10)} #96#return; {28997#(< ~counter~0 10)} is VALID [2022-04-28 05:57:17,516 INFO L290 TraceCheckUtils]: 78: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,516 INFO L290 TraceCheckUtils]: 77: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,516 INFO L290 TraceCheckUtils]: 76: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,516 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-28 05:57:17,516 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-28 05:57:17,517 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-28 05:57:17,518 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-28 05:57:17,518 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28684#true} {28916#(<= ~counter~0 8)} #96#return; {28916#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:17,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,519 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-28 05:57:17,519 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-28 05:57:17,520 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-28 05:57:17,520 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-28 05:57:17,521 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28684#true} {28891#(<= ~counter~0 7)} #96#return; {28891#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:17,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,521 INFO L290 TraceCheckUtils]: 61: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,521 INFO L290 TraceCheckUtils]: 60: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,521 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-28 05:57:17,521 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-28 05:57:17,522 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-28 05:57:17,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {28866#(<= ~counter~0 6)} assume !!(0 != ~r~0); {28866#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:17,523 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28684#true} {28866#(<= ~counter~0 6)} #94#return; {28866#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:17,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,523 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-28 05:57:17,524 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-28 05:57:17,524 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-28 05:57:17,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {28841#(<= ~counter~0 5)} assume !(~r~0 < 0); {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,525 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28684#true} {28841#(<= ~counter~0 5)} #98#return; {28841#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:17,525 INFO L290 TraceCheckUtils]: 46: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,526 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-28 05:57:17,526 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-28 05:57:17,527 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-28 05:57:17,527 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-28 05:57:17,528 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28684#true} {28816#(<= ~counter~0 4)} #98#return; {28816#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:17,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,528 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-28 05:57:17,528 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-28 05:57:17,529 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-28 05:57:17,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {28791#(<= ~counter~0 3)} assume !(~r~0 > 0); {28791#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:17,530 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28684#true} {28791#(<= ~counter~0 3)} #96#return; {28791#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:17,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,530 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-28 05:57:17,531 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-28 05:57:17,532 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-28 05:57:17,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {28766#(<= ~counter~0 2)} assume !!(0 != ~r~0); {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,533 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28684#true} {28766#(<= ~counter~0 2)} #94#return; {28766#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:17,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,533 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-28 05:57:17,533 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-28 05:57:17,534 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-28 05:57:17,535 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-28 05:57:17,535 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28684#true} {28741#(<= ~counter~0 1)} #92#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,536 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-28 05:57:17,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28684#true} {28741#(<= ~counter~0 1)} #90#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {28684#true} assume true; {28684#true} is VALID [2022-04-28 05:57:17,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {28684#true} assume !(0 == ~cond); {28684#true} is VALID [2022-04-28 05:57:17,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {28684#true} ~cond := #in~cond; {28684#true} is VALID [2022-04-28 05:57:17,537 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-28 05:57:17,537 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-28 05:57:17,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {28741#(<= ~counter~0 1)} call #t~ret9 := main(); {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28741#(<= ~counter~0 1)} {28684#true} #102#return; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {28741#(<= ~counter~0 1)} assume true; {28741#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:17,539 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-28 05:57:17,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {28684#true} call ULTIMATE.init(); {28684#true} is VALID [2022-04-28 05:57:17,539 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-28 05:57:17,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:17,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152657146] [2022-04-28 05:57:17,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:17,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226021876] [2022-04-28 05:57:17,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226021876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:17,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:17,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2022-04-28 05:57:17,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:17,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597269949] [2022-04-28 05:57:17,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597269949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:17,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:17,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:57:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454057954] [2022-04-28 05:57:17,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:17,541 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-28 05:57:17,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:17,541 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-28 05:57:17,624 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-28 05:57:17,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:57:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:17,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:57:17,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:57:17,625 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-28 05:57:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:18,624 INFO L93 Difference]: Finished difference Result 427 states and 585 transitions. [2022-04-28 05:57:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 05:57:18,624 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-28 05:57:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:18,624 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-28 05:57:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:18,626 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-28 05:57:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-28 05:57:18,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-28 05:57:18,788 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-28 05:57:18,794 INFO L225 Difference]: With dead ends: 427 [2022-04-28 05:57:18,794 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 05:57:18,795 INFO L412 NwaCegarLoop]: 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-28 05:57:18,795 INFO L413 NwaCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:18,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 211 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:18,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 05:57:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-28 05:57:19,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:19,299 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-28 05:57:19,299 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-28 05:57:19,299 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-28 05:57:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:19,308 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-28 05:57:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:57:19,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:19,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:19,309 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-28 05:57:19,310 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-28 05:57:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:19,318 INFO L93 Difference]: Finished difference Result 342 states and 456 transitions. [2022-04-28 05:57:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:57:19,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:19,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:19,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:19,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:19,319 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-28 05:57:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 456 transitions. [2022-04-28 05:57:19,329 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 456 transitions. Word has length 91 [2022-04-28 05:57:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:19,329 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 456 transitions. [2022-04-28 05:57:19,329 INFO L496 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-28 05:57:19,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 456 transitions. [2022-04-28 05:57:22,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 455 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 456 transitions. [2022-04-28 05:57:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 05:57:22,341 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:22,341 INFO L195 NwaCegarLoop]: 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-28 05:57:22,347 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-28 05:57:22,543 WARN L477 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-28 05:57:22,543 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-28 05:57:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:22,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366780484] [2022-04-28 05:57:22,544 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-28 05:57:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:22,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097964689] [2022-04-28 05:57:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:22,562 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:22,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150036286] [2022-04-28 05:57:22,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:22,564 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-28 05:57:22,578 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-28 05:57:22,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:22,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:22,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:57:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:22,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:23,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {31479#true} call ULTIMATE.init(); {31479#true} is VALID [2022-04-28 05:57:23,094 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-28 05:57:23,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31487#(<= ~counter~0 0)} {31479#true} #102#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {31487#(<= ~counter~0 0)} call #t~ret9 := main(); {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,095 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-28 05:57:23,096 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-28 05:57:23,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {31487#(<= ~counter~0 0)} ~cond := #in~cond; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {31487#(<= ~counter~0 0)} assume !(0 == ~cond); {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31487#(<= ~counter~0 0)} {31487#(<= ~counter~0 0)} #90#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,097 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-28 05:57:23,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {31487#(<= ~counter~0 0)} ~cond := #in~cond; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {31487#(<= ~counter~0 0)} assume !(0 == ~cond); {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,099 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31487#(<= ~counter~0 0)} {31487#(<= ~counter~0 0)} #92#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,099 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-28 05:57:23,100 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-28 05:57:23,100 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-28 05:57:23,101 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-28 05:57:23,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {31536#(<= ~counter~0 1)} ~cond := #in~cond; {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {31536#(<= ~counter~0 1)} assume !(0 == ~cond); {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {31536#(<= ~counter~0 1)} assume true; {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,108 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31536#(<= ~counter~0 1)} {31536#(<= ~counter~0 1)} #94#return; {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {31536#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,109 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-28 05:57:23,110 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-28 05:57:23,110 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-28 05:57:23,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {31561#(<= ~counter~0 2)} ~cond := #in~cond; {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {31561#(<= ~counter~0 2)} assume !(0 == ~cond); {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {31561#(<= ~counter~0 2)} assume true; {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,111 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31561#(<= ~counter~0 2)} {31561#(<= ~counter~0 2)} #96#return; {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {31561#(<= ~counter~0 2)} assume !(~r~0 > 0); {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,112 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-28 05:57:23,113 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-28 05:57:23,113 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-28 05:57:23,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {31586#(<= ~counter~0 3)} ~cond := #in~cond; {31586#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:23,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {31586#(<= ~counter~0 3)} assume !(0 == ~cond); {31586#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:23,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {31586#(<= ~counter~0 3)} assume true; {31586#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:23,114 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31586#(<= ~counter~0 3)} {31586#(<= ~counter~0 3)} #98#return; {31586#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:23,115 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-28 05:57:23,115 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-28 05:57:23,115 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-28 05:57:23,116 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-28 05:57:23,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {31611#(<= ~counter~0 4)} ~cond := #in~cond; {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {31611#(<= ~counter~0 4)} assume !(0 == ~cond); {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {31611#(<= ~counter~0 4)} assume true; {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,117 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31611#(<= ~counter~0 4)} {31611#(<= ~counter~0 4)} #98#return; {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {31611#(<= ~counter~0 4)} assume !(~r~0 < 0); {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,118 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-28 05:57:23,118 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-28 05:57:23,119 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-28 05:57:23,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {31636#(<= ~counter~0 5)} ~cond := #in~cond; {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {31636#(<= ~counter~0 5)} assume !(0 == ~cond); {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {31636#(<= ~counter~0 5)} assume true; {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,120 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31636#(<= ~counter~0 5)} {31636#(<= ~counter~0 5)} #94#return; {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {31636#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,121 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-28 05:57:23,121 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-28 05:57:23,122 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-28 05:57:23,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {31661#(<= ~counter~0 6)} ~cond := #in~cond; {31661#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:23,122 INFO L290 TraceCheckUtils]: 61: Hoare triple {31661#(<= ~counter~0 6)} assume !(0 == ~cond); {31661#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:23,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {31661#(<= ~counter~0 6)} assume true; {31661#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:23,123 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31661#(<= ~counter~0 6)} {31661#(<= ~counter~0 6)} #96#return; {31661#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:23,123 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-28 05:57:23,124 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-28 05:57:23,124 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-28 05:57:23,125 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-28 05:57:23,125 INFO L290 TraceCheckUtils]: 68: Hoare triple {31686#(<= ~counter~0 7)} ~cond := #in~cond; {31686#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:23,125 INFO L290 TraceCheckUtils]: 69: Hoare triple {31686#(<= ~counter~0 7)} assume !(0 == ~cond); {31686#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:23,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {31686#(<= ~counter~0 7)} assume true; {31686#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:23,126 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31686#(<= ~counter~0 7)} {31686#(<= ~counter~0 7)} #96#return; {31686#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:23,126 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-28 05:57:23,127 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-28 05:57:23,127 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-28 05:57:23,128 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-28 05:57:23,128 INFO L290 TraceCheckUtils]: 76: Hoare triple {31711#(<= ~counter~0 8)} ~cond := #in~cond; {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,128 INFO L290 TraceCheckUtils]: 77: Hoare triple {31711#(<= ~counter~0 8)} assume !(0 == ~cond); {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {31711#(<= ~counter~0 8)} assume true; {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,129 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31711#(<= ~counter~0 8)} {31711#(<= ~counter~0 8)} #96#return; {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,129 INFO L290 TraceCheckUtils]: 80: Hoare triple {31711#(<= ~counter~0 8)} assume !(~r~0 > 0); {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,130 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-28 05:57:23,130 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-28 05:57:23,131 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-28 05:57:23,131 INFO L290 TraceCheckUtils]: 84: Hoare triple {31736#(<= ~counter~0 9)} ~cond := #in~cond; {31736#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:23,131 INFO L290 TraceCheckUtils]: 85: Hoare triple {31736#(<= ~counter~0 9)} assume !(0 == ~cond); {31736#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:23,132 INFO L290 TraceCheckUtils]: 86: Hoare triple {31736#(<= ~counter~0 9)} assume true; {31736#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:23,132 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31736#(<= ~counter~0 9)} {31736#(<= ~counter~0 9)} #98#return; {31736#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:23,132 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-28 05:57:23,133 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-28 05:57:23,133 INFO L290 TraceCheckUtils]: 90: Hoare triple {31761#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {31480#false} is VALID [2022-04-28 05:57:23,133 INFO L290 TraceCheckUtils]: 91: Hoare triple {31480#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31480#false} is VALID [2022-04-28 05:57:23,133 INFO L290 TraceCheckUtils]: 92: Hoare triple {31480#false} assume !(#t~post6 < 10);havoc #t~post6; {31480#false} is VALID [2022-04-28 05:57:23,133 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-28 05:57:23,133 INFO L290 TraceCheckUtils]: 94: Hoare triple {31480#false} ~cond := #in~cond; {31480#false} is VALID [2022-04-28 05:57:23,133 INFO L290 TraceCheckUtils]: 95: Hoare triple {31480#false} assume 0 == ~cond; {31480#false} is VALID [2022-04-28 05:57:23,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {31480#false} assume !false; {31480#false} is VALID [2022-04-28 05:57:23,134 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-28 05:57:23,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:23,516 INFO L290 TraceCheckUtils]: 96: Hoare triple {31480#false} assume !false; {31480#false} is VALID [2022-04-28 05:57:23,516 INFO L290 TraceCheckUtils]: 95: Hoare triple {31480#false} assume 0 == ~cond; {31480#false} is VALID [2022-04-28 05:57:23,516 INFO L290 TraceCheckUtils]: 94: Hoare triple {31480#false} ~cond := #in~cond; {31480#false} is VALID [2022-04-28 05:57:23,516 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-28 05:57:23,516 INFO L290 TraceCheckUtils]: 92: Hoare triple {31480#false} assume !(#t~post6 < 10);havoc #t~post6; {31480#false} is VALID [2022-04-28 05:57:23,516 INFO L290 TraceCheckUtils]: 91: Hoare triple {31480#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31480#false} is VALID [2022-04-28 05:57:23,516 INFO L290 TraceCheckUtils]: 90: Hoare triple {31761#(<= |main_#t~post8| 9)} assume !(#t~post8 < 10);havoc #t~post8; {31480#false} is VALID [2022-04-28 05:57:23,517 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-28 05:57:23,517 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-28 05:57:23,518 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31479#true} {31736#(<= ~counter~0 9)} #98#return; {31736#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:23,518 INFO L290 TraceCheckUtils]: 86: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,518 INFO L290 TraceCheckUtils]: 85: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,518 INFO L290 TraceCheckUtils]: 84: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,518 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-28 05:57:23,518 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-28 05:57:23,519 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-28 05:57:23,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {31711#(<= ~counter~0 8)} assume !(~r~0 > 0); {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,520 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {31479#true} {31711#(<= ~counter~0 8)} #96#return; {31711#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:23,520 INFO L290 TraceCheckUtils]: 78: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,520 INFO L290 TraceCheckUtils]: 77: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,520 INFO L290 TraceCheckUtils]: 76: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,520 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-28 05:57:23,520 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-28 05:57:23,521 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-28 05:57:23,521 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-28 05:57:23,522 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {31479#true} {31686#(<= ~counter~0 7)} #96#return; {31686#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:23,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,522 INFO L290 TraceCheckUtils]: 68: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,522 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-28 05:57:23,522 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-28 05:57:23,523 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-28 05:57:23,523 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-28 05:57:23,524 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31479#true} {31661#(<= ~counter~0 6)} #96#return; {31661#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:23,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,524 INFO L290 TraceCheckUtils]: 61: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,524 INFO L290 TraceCheckUtils]: 60: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,524 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-28 05:57:23,524 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-28 05:57:23,525 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-28 05:57:23,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {31636#(<= ~counter~0 5)} assume !!(0 != ~r~0); {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,526 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {31479#true} {31636#(<= ~counter~0 5)} #94#return; {31636#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:23,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,526 INFO L290 TraceCheckUtils]: 53: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,526 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-28 05:57:23,526 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-28 05:57:23,527 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-28 05:57:23,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {31611#(<= ~counter~0 4)} assume !(~r~0 < 0); {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,527 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {31479#true} {31611#(<= ~counter~0 4)} #98#return; {31611#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:23,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,528 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-28 05:57:23,528 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-28 05:57:23,529 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-28 05:57:23,529 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-28 05:57:23,529 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31479#true} {31586#(<= ~counter~0 3)} #98#return; {31586#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:23,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,530 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-28 05:57:23,530 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-28 05:57:23,531 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-28 05:57:23,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {31561#(<= ~counter~0 2)} assume !(~r~0 > 0); {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,531 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {31479#true} {31561#(<= ~counter~0 2)} #96#return; {31561#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:23,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,532 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-28 05:57:23,533 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-28 05:57:23,534 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-28 05:57:23,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {31536#(<= ~counter~0 1)} assume !!(0 != ~r~0); {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,535 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31479#true} {31536#(<= ~counter~0 1)} #94#return; {31536#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:23,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,535 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-28 05:57:23,535 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-28 05:57:23,536 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-28 05:57:23,536 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-28 05:57:23,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {31479#true} {31487#(<= ~counter~0 0)} #92#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,537 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-28 05:57:23,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31479#true} {31487#(<= ~counter~0 0)} #90#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {31479#true} assume true; {31479#true} is VALID [2022-04-28 05:57:23,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {31479#true} assume !(0 == ~cond); {31479#true} is VALID [2022-04-28 05:57:23,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {31479#true} ~cond := #in~cond; {31479#true} is VALID [2022-04-28 05:57:23,538 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-28 05:57:23,538 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-28 05:57:23,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {31487#(<= ~counter~0 0)} call #t~ret9 := main(); {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31487#(<= ~counter~0 0)} {31479#true} #102#return; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {31487#(<= ~counter~0 0)} assume true; {31487#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:23,539 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-28 05:57:23,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {31479#true} call ULTIMATE.init(); {31479#true} is VALID [2022-04-28 05:57:23,540 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-28 05:57:23,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:23,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097964689] [2022-04-28 05:57:23,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:23,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150036286] [2022-04-28 05:57:23,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150036286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:23,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:23,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 05:57:23,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:23,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366780484] [2022-04-28 05:57:23,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366780484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:23,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:23,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:57:23,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925224822] [2022-04-28 05:57:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:23,541 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-28 05:57:23,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:23,541 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-28 05:57:23,612 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-28 05:57:23,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:57:23,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:23,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:57:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:57:23,612 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-28 05:57:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:24,723 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2022-04-28 05:57:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 05:57:24,723 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-28 05:57:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:24,723 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-28 05:57:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 05:57:24,725 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-28 05:57:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-28 05:57:24,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-28 05:57:24,933 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-28 05:57:24,942 INFO L225 Difference]: With dead ends: 467 [2022-04-28 05:57:24,943 INFO L226 Difference]: Without dead ends: 352 [2022-04-28 05:57:24,944 INFO L412 NwaCegarLoop]: 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-28 05:57:24,944 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 131 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:57:24,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 230 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:57:24,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-28 05:57:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2022-04-28 05:57:25,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:25,487 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-28 05:57:25,488 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-28 05:57:25,488 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-28 05:57:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:25,498 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-28 05:57:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 05:57:25,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:25,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:25,499 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-28 05:57:25,500 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-28 05:57:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:25,508 INFO L93 Difference]: Finished difference Result 352 states and 465 transitions. [2022-04-28 05:57:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 465 transitions. [2022-04-28 05:57:25,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:25,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:25,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:25,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:25,509 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-28 05:57:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2022-04-28 05:57:25,519 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 97 [2022-04-28 05:57:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:25,519 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2022-04-28 05:57:25,519 INFO L496 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-28 05:57:25,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 457 transitions. [2022-04-28 05:57:28,430 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-28 05:57:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2022-04-28 05:57:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 05:57:28,431 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:28,431 INFO L195 NwaCegarLoop]: 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-28 05:57:28,447 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-28 05:57:28,631 WARN L477 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-28 05:57:28,631 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-28 05:57:28,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:28,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [17195902] [2022-04-28 05:57:28,632 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:28,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-28 05:57:28,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:28,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209826305] [2022-04-28 05:57:28,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:28,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625833994] [2022-04-28 05:57:28,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:57:28,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:28,645 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-28 05:57:28,647 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-28 05:57:28,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:57:28,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:57:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:28,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:28,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {34413#true} call ULTIMATE.init(); {34413#true} is VALID [2022-04-28 05:57:28,936 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-28 05:57:28,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34413#true} {34413#true} #102#return; {34413#true} is VALID [2022-04-28 05:57:28,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {34413#true} call #t~ret9 := main(); {34413#true} is VALID [2022-04-28 05:57:28,936 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-28 05:57:28,936 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-28 05:57:28,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34413#true} {34413#true} #90#return; {34413#true} is VALID [2022-04-28 05:57:28,937 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-28 05:57:28,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34413#true} {34413#true} #92#return; {34413#true} is VALID [2022-04-28 05:57:28,937 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-28 05:57:28,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {34413#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {34413#true} assume !!(#t~post6 < 10);havoc #t~post6; {34413#true} is VALID [2022-04-28 05:57:28,937 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-28 05:57:28,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34413#true} {34413#true} #94#return; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {34413#true} assume !!(0 != ~r~0); {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-28 05:57:28,938 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-28 05:57:28,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {34413#true} assume !(~r~0 > 0); {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {34413#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34413#true} is VALID [2022-04-28 05:57:28,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {34413#true} assume !!(#t~post8 < 10);havoc #t~post8; {34413#true} is VALID [2022-04-28 05:57:28,938 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-28 05:57:28,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34413#true} {34413#true} #98#return; {34413#true} is VALID [2022-04-28 05:57:28,939 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-28 05:57:28,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {34413#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {34413#true} assume !!(#t~post8 < 10);havoc #t~post8; {34413#true} is VALID [2022-04-28 05:57:28,939 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-28 05:57:28,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34413#true} {34413#true} #98#return; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {34413#true} assume !(~r~0 < 0); {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {34413#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34413#true} is VALID [2022-04-28 05:57:28,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {34413#true} assume !!(#t~post6 < 10);havoc #t~post6; {34413#true} is VALID [2022-04-28 05:57:28,939 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-28 05:57:28,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34413#true} {34413#true} #94#return; {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {34413#true} assume !!(0 != ~r~0); {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-28 05:57:28,940 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-28 05:57:28,940 INFO L290 TraceCheckUtils]: 60: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,940 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-28 05:57:28,941 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-28 05:57:28,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {34413#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34413#true} is VALID [2022-04-28 05:57:28,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {34413#true} assume !!(#t~post7 < 10);havoc #t~post7; {34413#true} is VALID [2022-04-28 05:57:28,941 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-28 05:57:28,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,941 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34413#true} {34413#true} #96#return; {34413#true} is VALID [2022-04-28 05:57:28,959 INFO L290 TraceCheckUtils]: 72: Hoare triple {34413#true} assume !(~r~0 > 0); {34634#(not (< 0 main_~r~0))} is VALID [2022-04-28 05:57:28,960 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-28 05:57:28,961 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-28 05:57:28,961 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-28 05:57:28,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,961 INFO L290 TraceCheckUtils]: 77: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,961 INFO L290 TraceCheckUtils]: 78: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,962 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-28 05:57:28,962 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-28 05:57:28,962 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-28 05:57:28,963 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-28 05:57:28,963 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-28 05:57:28,963 INFO L290 TraceCheckUtils]: 84: Hoare triple {34413#true} ~cond := #in~cond; {34413#true} is VALID [2022-04-28 05:57:28,963 INFO L290 TraceCheckUtils]: 85: Hoare triple {34413#true} assume !(0 == ~cond); {34413#true} is VALID [2022-04-28 05:57:28,963 INFO L290 TraceCheckUtils]: 86: Hoare triple {34413#true} assume true; {34413#true} is VALID [2022-04-28 05:57:28,964 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-28 05:57:28,964 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-28 05:57:28,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {34414#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {34414#false} assume !(#t~post7 < 10);havoc #t~post7; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 91: Hoare triple {34414#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {34414#false} assume !(#t~post8 < 10);havoc #t~post8; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {34414#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 94: Hoare triple {34414#false} assume !(#t~post6 < 10);havoc #t~post6; {34414#false} is VALID [2022-04-28 05:57:28,965 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-28 05:57:28,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {34414#false} ~cond := #in~cond; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 97: Hoare triple {34414#false} assume 0 == ~cond; {34414#false} is VALID [2022-04-28 05:57:28,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {34414#false} assume !false; {34414#false} is VALID [2022-04-28 05:57:28,966 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-28 05:57:28,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:57:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209826305] [2022-04-28 05:57:28,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:28,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625833994] [2022-04-28 05:57:28,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625833994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:28,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:28,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:28,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:28,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [17195902] [2022-04-28 05:57:28,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [17195902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:28,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:28,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:57:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913242855] [2022-04-28 05:57:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:28,967 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-28 05:57:28,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:28,968 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-28 05:57:29,015 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-28 05:57:29,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:57:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:57:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:57:29,017 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-28 05:57:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:29,783 INFO L93 Difference]: Finished difference Result 504 states and 675 transitions. [2022-04-28 05:57:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:57:29,784 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-28 05:57:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:29,784 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-28 05:57:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:57:29,785 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-28 05:57:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-28 05:57:29,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-28 05:57:29,853 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-28 05:57:29,860 INFO L225 Difference]: With dead ends: 504 [2022-04-28 05:57:29,860 INFO L226 Difference]: Without dead ends: 362 [2022-04-28 05:57:29,860 INFO L412 NwaCegarLoop]: 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-28 05:57:29,861 INFO L413 NwaCegarLoop]: 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-28 05:57:29,861 INFO L414 NwaCegarLoop]: 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-28 05:57:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-28 05:57:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 352. [2022-04-28 05:57:30,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:30,389 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-28 05:57:30,390 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-28 05:57:30,390 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-28 05:57:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:30,399 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-28 05:57:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-28 05:57:30,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:30,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:30,401 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-28 05:57:30,401 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-28 05:57:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:30,410 INFO L93 Difference]: Finished difference Result 362 states and 481 transitions. [2022-04-28 05:57:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 481 transitions. [2022-04-28 05:57:30,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:30,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:30,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:30,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:30,412 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-28 05:57:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 468 transitions. [2022-04-28 05:57:30,422 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 468 transitions. Word has length 99 [2022-04-28 05:57:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:30,422 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 468 transitions. [2022-04-28 05:57:30,422 INFO L496 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-28 05:57:30,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 352 states and 468 transitions. [2022-04-28 05:57:31,753 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-28 05:57:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 468 transitions. [2022-04-28 05:57:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 05:57:31,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:31,754 INFO L195 NwaCegarLoop]: 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-28 05:57:31,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 05:57:31,955 WARN L477 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-28 05:57:31,955 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:31,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-28 05:57:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510743127] [2022-04-28 05:57:31,956 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:31,956 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-28 05:57:31,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:31,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164452257] [2022-04-28 05:57:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:31,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:31,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:31,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953384688] [2022-04-28 05:57:31,985 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:31,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:31,986 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-28 05:57:32,003 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-28 05:57:32,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:32,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:57:32,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:57:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:57:32,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:57:32,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {37149#true} call ULTIMATE.init(); {37149#true} is VALID [2022-04-28 05:57:32,631 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-28 05:57:32,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37157#(<= ~counter~0 0)} {37149#true} #102#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {37157#(<= ~counter~0 0)} call #t~ret9 := main(); {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,632 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-28 05:57:32,632 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-28 05:57:32,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {37157#(<= ~counter~0 0)} ~cond := #in~cond; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {37157#(<= ~counter~0 0)} assume !(0 == ~cond); {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37157#(<= ~counter~0 0)} {37157#(<= ~counter~0 0)} #90#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,634 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-28 05:57:32,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {37157#(<= ~counter~0 0)} ~cond := #in~cond; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {37157#(<= ~counter~0 0)} assume !(0 == ~cond); {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,635 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37157#(<= ~counter~0 0)} {37157#(<= ~counter~0 0)} #92#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:32,636 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-28 05:57:32,637 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-28 05:57:32,637 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-28 05:57:32,637 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-28 05:57:32,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {37206#(<= ~counter~0 1)} ~cond := #in~cond; {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(<= ~counter~0 1)} assume !(0 == ~cond); {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(<= ~counter~0 1)} assume true; {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,639 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37206#(<= ~counter~0 1)} {37206#(<= ~counter~0 1)} #94#return; {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {37206#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:32,640 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-28 05:57:32,640 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-28 05:57:32,641 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-28 05:57:32,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {37231#(<= ~counter~0 2)} ~cond := #in~cond; {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {37231#(<= ~counter~0 2)} assume !(0 == ~cond); {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {37231#(<= ~counter~0 2)} assume true; {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,642 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37231#(<= ~counter~0 2)} {37231#(<= ~counter~0 2)} #96#return; {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {37231#(<= ~counter~0 2)} assume !(~r~0 > 0); {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:32,643 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-28 05:57:32,643 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-28 05:57:32,644 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-28 05:57:32,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {37256#(<= ~counter~0 3)} ~cond := #in~cond; {37256#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {37256#(<= ~counter~0 3)} assume !(0 == ~cond); {37256#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {37256#(<= ~counter~0 3)} assume true; {37256#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,647 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37256#(<= ~counter~0 3)} {37256#(<= ~counter~0 3)} #98#return; {37256#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:32,647 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-28 05:57:32,648 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-28 05:57:32,648 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-28 05:57:32,649 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-28 05:57:32,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {37281#(<= ~counter~0 4)} ~cond := #in~cond; {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:32,649 INFO L290 TraceCheckUtils]: 45: Hoare triple {37281#(<= ~counter~0 4)} assume !(0 == ~cond); {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:32,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {37281#(<= ~counter~0 4)} assume true; {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:32,650 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37281#(<= ~counter~0 4)} {37281#(<= ~counter~0 4)} #98#return; {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:32,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {37281#(<= ~counter~0 4)} assume !(~r~0 < 0); {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:32,651 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-28 05:57:32,652 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-28 05:57:32,652 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-28 05:57:32,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {37306#(<= ~counter~0 5)} ~cond := #in~cond; {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:32,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {37306#(<= ~counter~0 5)} assume !(0 == ~cond); {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:32,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {37306#(<= ~counter~0 5)} assume true; {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:32,654 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37306#(<= ~counter~0 5)} {37306#(<= ~counter~0 5)} #94#return; {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:32,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {37306#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:32,655 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-28 05:57:32,655 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-28 05:57:32,656 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-28 05:57:32,656 INFO L290 TraceCheckUtils]: 60: Hoare triple {37331#(<= ~counter~0 6)} ~cond := #in~cond; {37331#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:32,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {37331#(<= ~counter~0 6)} assume !(0 == ~cond); {37331#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:32,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {37331#(<= ~counter~0 6)} assume true; {37331#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:32,657 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37331#(<= ~counter~0 6)} {37331#(<= ~counter~0 6)} #96#return; {37331#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:32,657 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-28 05:57:32,658 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-28 05:57:32,658 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-28 05:57:32,659 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-28 05:57:32,659 INFO L290 TraceCheckUtils]: 68: Hoare triple {37356#(<= ~counter~0 7)} ~cond := #in~cond; {37356#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:32,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {37356#(<= ~counter~0 7)} assume !(0 == ~cond); {37356#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:32,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {37356#(<= ~counter~0 7)} assume true; {37356#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:32,660 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37356#(<= ~counter~0 7)} {37356#(<= ~counter~0 7)} #96#return; {37356#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:32,660 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-28 05:57:32,661 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-28 05:57:32,661 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-28 05:57:32,662 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-28 05:57:32,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {37381#(<= ~counter~0 8)} ~cond := #in~cond; {37381#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:32,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {37381#(<= ~counter~0 8)} assume !(0 == ~cond); {37381#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:32,662 INFO L290 TraceCheckUtils]: 78: Hoare triple {37381#(<= ~counter~0 8)} assume true; {37381#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:32,663 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37381#(<= ~counter~0 8)} {37381#(<= ~counter~0 8)} #96#return; {37381#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:32,663 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-28 05:57:32,664 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-28 05:57:32,664 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-28 05:57:32,665 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-28 05:57:32,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {37406#(<= ~counter~0 9)} ~cond := #in~cond; {37406#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:32,665 INFO L290 TraceCheckUtils]: 85: Hoare triple {37406#(<= ~counter~0 9)} assume !(0 == ~cond); {37406#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:32,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {37406#(<= ~counter~0 9)} assume true; {37406#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:32,666 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37406#(<= ~counter~0 9)} {37406#(<= ~counter~0 9)} #96#return; {37406#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:32,666 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-28 05:57:32,667 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-28 05:57:32,668 INFO L290 TraceCheckUtils]: 90: Hoare triple {37431#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {37150#false} is VALID [2022-04-28 05:57:32,668 INFO L290 TraceCheckUtils]: 91: Hoare triple {37150#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37150#false} is VALID [2022-04-28 05:57:32,668 INFO L290 TraceCheckUtils]: 92: Hoare triple {37150#false} assume !(#t~post8 < 10);havoc #t~post8; {37150#false} is VALID [2022-04-28 05:57:32,668 INFO L290 TraceCheckUtils]: 93: Hoare triple {37150#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37150#false} is VALID [2022-04-28 05:57:32,668 INFO L290 TraceCheckUtils]: 94: Hoare triple {37150#false} assume !(#t~post6 < 10);havoc #t~post6; {37150#false} is VALID [2022-04-28 05:57:32,668 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-28 05:57:32,668 INFO L290 TraceCheckUtils]: 96: Hoare triple {37150#false} ~cond := #in~cond; {37150#false} is VALID [2022-04-28 05:57:32,668 INFO L290 TraceCheckUtils]: 97: Hoare triple {37150#false} assume 0 == ~cond; {37150#false} is VALID [2022-04-28 05:57:32,668 INFO L290 TraceCheckUtils]: 98: Hoare triple {37150#false} assume !false; {37150#false} is VALID [2022-04-28 05:57:32,668 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-28 05:57:32,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:57:33,087 INFO L290 TraceCheckUtils]: 98: Hoare triple {37150#false} assume !false; {37150#false} is VALID [2022-04-28 05:57:33,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {37150#false} assume 0 == ~cond; {37150#false} is VALID [2022-04-28 05:57:33,088 INFO L290 TraceCheckUtils]: 96: Hoare triple {37150#false} ~cond := #in~cond; {37150#false} is VALID [2022-04-28 05:57:33,088 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-28 05:57:33,088 INFO L290 TraceCheckUtils]: 94: Hoare triple {37150#false} assume !(#t~post6 < 10);havoc #t~post6; {37150#false} is VALID [2022-04-28 05:57:33,088 INFO L290 TraceCheckUtils]: 93: Hoare triple {37150#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37150#false} is VALID [2022-04-28 05:57:33,088 INFO L290 TraceCheckUtils]: 92: Hoare triple {37150#false} assume !(#t~post8 < 10);havoc #t~post8; {37150#false} is VALID [2022-04-28 05:57:33,088 INFO L290 TraceCheckUtils]: 91: Hoare triple {37150#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37150#false} is VALID [2022-04-28 05:57:33,090 INFO L290 TraceCheckUtils]: 90: Hoare triple {37431#(<= |main_#t~post7| 9)} assume !(#t~post7 < 10);havoc #t~post7; {37150#false} is VALID [2022-04-28 05:57:33,090 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-28 05:57:33,091 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-28 05:57:33,091 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {37149#true} {37406#(<= ~counter~0 9)} #96#return; {37406#(<= ~counter~0 9)} is VALID [2022-04-28 05:57:33,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,091 INFO L290 TraceCheckUtils]: 84: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,092 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-28 05:57:33,092 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-28 05:57:33,093 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-28 05:57:33,093 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-28 05:57:33,094 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {37149#true} {37381#(<= ~counter~0 8)} #96#return; {37381#(<= ~counter~0 8)} is VALID [2022-04-28 05:57:33,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,094 INFO L290 TraceCheckUtils]: 77: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,094 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-28 05:57:33,094 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-28 05:57:33,095 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-28 05:57:33,095 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-28 05:57:33,096 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {37149#true} {37356#(<= ~counter~0 7)} #96#return; {37356#(<= ~counter~0 7)} is VALID [2022-04-28 05:57:33,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,096 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-28 05:57:33,096 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-28 05:57:33,097 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-28 05:57:33,097 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-28 05:57:33,098 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37149#true} {37331#(<= ~counter~0 6)} #96#return; {37331#(<= ~counter~0 6)} is VALID [2022-04-28 05:57:33,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,098 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-28 05:57:33,098 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-28 05:57:33,099 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-28 05:57:33,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {37306#(<= ~counter~0 5)} assume !!(0 != ~r~0); {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:33,100 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {37149#true} {37306#(<= ~counter~0 5)} #94#return; {37306#(<= ~counter~0 5)} is VALID [2022-04-28 05:57:33,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,100 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-28 05:57:33,100 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-28 05:57:33,101 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-28 05:57:33,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {37281#(<= ~counter~0 4)} assume !(~r~0 < 0); {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:33,102 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {37149#true} {37281#(<= ~counter~0 4)} #98#return; {37281#(<= ~counter~0 4)} is VALID [2022-04-28 05:57:33,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,102 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-28 05:57:33,102 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-28 05:57:33,103 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-28 05:57:33,103 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-28 05:57:33,104 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {37149#true} {37256#(<= ~counter~0 3)} #98#return; {37256#(<= ~counter~0 3)} is VALID [2022-04-28 05:57:33,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,104 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-28 05:57:33,104 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-28 05:57:33,105 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-28 05:57:33,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {37231#(<= ~counter~0 2)} assume !(~r~0 > 0); {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:33,106 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {37149#true} {37231#(<= ~counter~0 2)} #96#return; {37231#(<= ~counter~0 2)} is VALID [2022-04-28 05:57:33,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,106 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-28 05:57:33,106 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-28 05:57:33,107 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-28 05:57:33,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {37206#(<= ~counter~0 1)} assume !!(0 != ~r~0); {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:33,108 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {37149#true} {37206#(<= ~counter~0 1)} #94#return; {37206#(<= ~counter~0 1)} is VALID [2022-04-28 05:57:33,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,108 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-28 05:57:33,108 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-28 05:57:33,109 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-28 05:57:33,109 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-28 05:57:33,109 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37149#true} {37157#(<= ~counter~0 0)} #92#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:33,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,110 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-28 05:57:33,110 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37149#true} {37157#(<= ~counter~0 0)} #90#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:33,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {37149#true} assume true; {37149#true} is VALID [2022-04-28 05:57:33,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {37149#true} assume !(0 == ~cond); {37149#true} is VALID [2022-04-28 05:57:33,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {37149#true} ~cond := #in~cond; {37149#true} is VALID [2022-04-28 05:57:33,110 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-28 05:57:33,111 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-28 05:57:33,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {37157#(<= ~counter~0 0)} call #t~ret9 := main(); {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:33,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37157#(<= ~counter~0 0)} {37149#true} #102#return; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:33,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {37157#(<= ~counter~0 0)} assume true; {37157#(<= ~counter~0 0)} is VALID [2022-04-28 05:57:33,112 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-28 05:57:33,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {37149#true} call ULTIMATE.init(); {37149#true} is VALID [2022-04-28 05:57:33,112 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-28 05:57:33,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:57:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164452257] [2022-04-28 05:57:33,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:57:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953384688] [2022-04-28 05:57:33,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953384688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:57:33,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:57:33,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2022-04-28 05:57:33,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:57:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510743127] [2022-04-28 05:57:33,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510743127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:57:33,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:57:33,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 05:57:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067370709] [2022-04-28 05:57:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:57:33,114 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-28 05:57:33,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:57:33,114 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-28 05:57:33,186 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-28 05:57:33,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 05:57:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 05:57:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:57:33,187 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-28 05:57:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:34,280 INFO L93 Difference]: Finished difference Result 471 states and 642 transitions. [2022-04-28 05:57:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 05:57:34,280 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-28 05:57:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:57:34,281 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-28 05:57:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 05:57:34,283 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-28 05:57:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-28 05:57:34,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-28 05:57:34,480 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-28 05:57:34,489 INFO L225 Difference]: With dead ends: 471 [2022-04-28 05:57:34,489 INFO L226 Difference]: Without dead ends: 364 [2022-04-28 05:57:34,489 INFO L412 NwaCegarLoop]: 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-28 05:57:34,490 INFO L413 NwaCegarLoop]: 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-28 05:57:34,490 INFO L414 NwaCegarLoop]: 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-28 05:57:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-04-28 05:57:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-04-28 05:57:35,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:57:35,046 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-28 05:57:35,046 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-28 05:57:35,047 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-28 05:57:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:35,055 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-28 05:57:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:57:35,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:35,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:35,057 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-28 05:57:35,057 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-28 05:57:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:57:35,065 INFO L93 Difference]: Finished difference Result 364 states and 480 transitions. [2022-04-28 05:57:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:57:35,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:57:35,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:57:35,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:57:35,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:57:35,067 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-28 05:57:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 480 transitions. [2022-04-28 05:57:35,082 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 480 transitions. Word has length 99 [2022-04-28 05:57:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:57:35,082 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 480 transitions. [2022-04-28 05:57:35,082 INFO L496 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-28 05:57:35,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 480 transitions. [2022-04-28 05:57:36,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:57:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 480 transitions. [2022-04-28 05:57:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 05:57:36,885 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:57:36,885 INFO L195 NwaCegarLoop]: 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-28 05:57:36,902 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-28 05:57:37,086 WARN L477 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-28 05:57:37,086 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:57:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:57:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-28 05:57:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:57:37,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445436982] [2022-04-28 05:57:37,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:57:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-28 05:57:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:57:37,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938983953] [2022-04-28 05:57:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:57:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:57:37,102 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:57:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [261484927] [2022-04-28 05:57:37,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:57:37,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:57:37,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:57:37,104 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-28 05:57:37,105 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-28 05:57:37,162 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:57:37,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 05:57:37,162 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 05:57:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 05:57:37,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 05:57:37,241 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 05:57:37,241 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 05:57:37,243 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 05:57:37,287 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-28 05:57:37,467 WARN L477 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-28 05:57:37,470 INFO L356 BasicCegarLoop]: Path program histogram: [10, 8, 8, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 05:57:37,472 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 05:57:37,485 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 05:57:37,486 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 05:57:37,487 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 05:57:37,488 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 05:57:37,489 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 05:57:37,489 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 05:57:37,489 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-28 05:57:37,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 05:57:37 BoogieIcfgContainer [2022-04-28 05:57:37,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 05:57:37,490 INFO L158 Benchmark]: Toolchain (without parser) took 135437.09ms. Allocated memory was 187.7MB in the beginning and 232.8MB in the end (delta: 45.1MB). Free memory was 139.0MB in the beginning and 94.0MB in the end (delta: 45.0MB). Peak memory consumption was 91.3MB. Max. memory is 8.0GB. [2022-04-28 05:57:37,491 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 05:57:37,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.19ms. Allocated memory is still 187.7MB. Free memory was 138.9MB in the beginning and 163.1MB in the end (delta: -24.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-28 05:57:37,491 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 187.7MB. Free memory was 163.1MB in the beginning and 161.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 05:57:37,491 INFO L158 Benchmark]: RCFGBuilder took 265.04ms. Allocated memory is still 187.7MB. Free memory was 161.5MB in the beginning and 149.3MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 05:57:37,491 INFO L158 Benchmark]: TraceAbstraction took 134906.61ms. Allocated memory was 187.7MB in the beginning and 232.8MB in the end (delta: 45.1MB). Free memory was 148.5MB in the beginning and 94.0MB in the end (delta: 54.5MB). Peak memory consumption was 100.9MB. Max. memory is 8.0GB. [2022-04-28 05:57:37,492 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.19ms. Allocated memory is still 187.7MB. Free memory was 138.9MB in the beginning and 163.1MB in the end (delta: -24.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 187.7MB. Free memory was 163.1MB in the beginning and 161.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.04ms. Allocated memory is still 187.7MB. Free memory was 161.5MB in the beginning and 149.3MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 134906.61ms. Allocated memory was 187.7MB in the beginning and 232.8MB in the end (delta: 45.1MB). Free memory was 148.5MB in the beginning and 94.0MB in the end (delta: 54.5MB). Peak memory consumption was 100.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: 134.8s, OverallIterations: 31, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1484 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1470 mSDsluCounter, 4801 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3377 mSDsCounter, 1106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1697 IncrementalHoareTripleChecker+Invalid, 2805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1106 mSolverCounterUnsat, 1424 mSDtfsCounter, 1697 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3562 GetRequests, 3201 SyntacticMatches, 16 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.8s 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: 6.1s 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-28 05:57:37,525 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...