/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:37:27,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:37:27,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:37:27,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:37:27,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:37:27,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:37:27,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:37:27,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:37:27,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:37:27,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:37:27,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:37:27,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:37:27,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:37:27,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:37:27,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:37:27,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:37:27,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:37:27,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:37:27,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:37:27,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:37:27,678 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:37:27,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:37:27,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:37:27,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:37:27,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:37:27,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:37:27,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:37:27,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:37:27,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:37:27,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:37:27,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:37:27,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:37:27,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:37:27,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:37:27,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:37:27,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:37:27,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:37:27,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:37:27,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:37:27,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:37:27,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:37:27,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:37:27,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:37:27,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:37:27,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:37:27,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:37:27,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:37:27,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:37:27,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:37:27,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:37:27,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:37:27,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:37:27,704 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:37:27,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:37:27,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:37:27,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:37:27,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:37:27,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:37:27,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:37:27,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:37:27,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:37:27,705 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:37:27,705 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:37:27,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:37:27,705 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:37:27,705 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 12:37:27,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:37:27,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:37:27,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:37:27,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:37:27,911 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:37:27,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-28 12:37:27,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072af5fa0/e5647a3588274b46afb1058db4546cf9/FLAG700480af1 [2022-04-28 12:37:28,312 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:37:28,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-28 12:37:28,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072af5fa0/e5647a3588274b46afb1058db4546cf9/FLAG700480af1 [2022-04-28 12:37:28,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072af5fa0/e5647a3588274b46afb1058db4546cf9 [2022-04-28 12:37:28,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:37:28,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:37:28,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:37:28,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:37:28,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:37:28,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:28,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3facf30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28, skipping insertion in model container [2022-04-28 12:37:28,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:28,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:37:28,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:37:28,939 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_unwindbound5.c[535,548] [2022-04-28 12:37:28,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:37:28,957 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:37:28,974 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_unwindbound5.c[535,548] [2022-04-28 12:37:28,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:37:28,995 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:37:28,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28 WrapperNode [2022-04-28 12:37:28,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:37:28,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:37:28,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:37:28,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:37:29,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:37:29,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:37:29,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:37:29,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:37:29,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (1/1) ... [2022-04-28 12:37:29,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:37:29,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:29,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 12:37:29,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 12:37:29,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:37:29,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:37:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:37:29,118 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:37:29,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:37:29,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:37:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:37:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:37:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:37:29,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:37:29,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:37:29,127 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:37:29,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:37:29,128 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:37:29,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:37:29,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:37:29,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:37:29,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:37:29,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:37:29,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:37:29,176 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:37:29,177 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:37:29,292 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:37:29,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:37:29,297 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 12:37:29,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:37:29 BoogieIcfgContainer [2022-04-28 12:37:29,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:37:29,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:37:29,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:37:29,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:37:29,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:37:28" (1/3) ... [2022-04-28 12:37:29,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a4f3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:37:29, skipping insertion in model container [2022-04-28 12:37:29,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:37:28" (2/3) ... [2022-04-28 12:37:29,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a4f3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:37:29, skipping insertion in model container [2022-04-28 12:37:29,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:37:29" (3/3) ... [2022-04-28 12:37:29,303 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2022-04-28 12:37:29,312 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:37:29,312 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:37:29,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:37:29,341 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@76fc9c9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4132c6f [2022-04-28 12:37:29,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:37:29,347 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 12:37:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 12:37:29,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:29,352 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 12:37:29,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-28 12:37:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:29,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602381456] [2022-04-28 12:37:29,382 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-28 12:37:29,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:29,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475019521] [2022-04-28 12:37:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:29,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:29,493 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:29,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63566428] [2022-04-28 12:37:29,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:29,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:29,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:29,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:37:29,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 12:37:29,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:37:29,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:29,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 12:37:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:29,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:37:29,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-28 12:37:29,637 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 12:37:29,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:37:29,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-28 12:37:29,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-28 12:37:29,638 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 12:37:29,638 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 12:37:29,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:37:29,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-28 12:37:29,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-28 12:37:29,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-28 12:37:29,639 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 12:37:29,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-28 12:37:29,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-28 12:37:29,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-28 12:37:29,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-28 12:37:29,640 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 12:37:29,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-28 12:37:29,641 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 12:37:29,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-28 12:37:29,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-28 12:37:29,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-28 12:37:29,642 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 12:37:29,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:37:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475019521] [2022-04-28 12:37:29,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:29,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63566428] [2022-04-28 12:37:29,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63566428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:29,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:29,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:37:29,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:29,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602381456] [2022-04-28 12:37:29,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602381456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:29,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:29,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:37:29,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384396914] [2022-04-28 12:37:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:29,650 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 12:37:29,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:29,654 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 12:37:29,681 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 12:37:29,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 12:37:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:29,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 12:37:29,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:37:29,717 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 12:37:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:29,800 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-28 12:37:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 12:37:29,801 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 12:37:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:37:29,802 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 12:37:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 12:37:29,810 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 12:37:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-28 12:37:29,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-28 12:37:29,902 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 12:37:29,908 INFO L225 Difference]: With dead ends: 67 [2022-04-28 12:37:29,908 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 12:37:29,910 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 12:37:29,912 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 12:37:29,912 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 12:37:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 12:37:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 12:37:29,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:37:29,931 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 12:37:29,932 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 12:37:29,932 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 12:37:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:29,935 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 12:37:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 12:37:29,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:29,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:29,936 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 12:37:29,936 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 12:37:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:29,939 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-28 12:37:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 12:37:29,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:29,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:29,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:37:29,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:37:29,940 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 12:37:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-28 12:37:29,943 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-28 12:37:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:37:29,943 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-28 12:37:29,943 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 12:37:29,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-28 12:37:29,971 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 12:37:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-28 12:37:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:37:29,971 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:29,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:37:29,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 12:37:30,183 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 12:37:30,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-28 12:37:30,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:30,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226791961] [2022-04-28 12:37:30,185 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-28 12:37:30,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:30,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212520130] [2022-04-28 12:37:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:30,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:30,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641484496] [2022-04-28 12:37:30,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:30,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:30,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 12:37:30,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 12:37:30,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:37:30,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:30,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:37:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:30,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:37:30,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-28 12:37:30,427 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 12:37:30,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,429 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 12:37:30,430 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 12:37:30,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,431 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 12:37:30,432 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 12:37:30,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-28 12:37:30,435 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 12:37:30,436 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 12:37:30,436 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 12:37:30,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {370#false} is VALID [2022-04-28 12:37:30,438 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 12:37:30,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-28 12:37:30,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-28 12:37:30,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-28 12:37:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:37:30,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:37:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:30,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212520130] [2022-04-28 12:37:30,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:30,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641484496] [2022-04-28 12:37:30,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641484496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:30,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:30,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:37:30,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:30,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226791961] [2022-04-28 12:37:30,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226791961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:30,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:30,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:37:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002631107] [2022-04-28 12:37:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:30,443 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 12:37:30,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:30,444 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 12:37:30,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:37:30,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:30,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:37:30,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:37:30,460 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 12:37:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:30,539 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 12:37:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:37:30,539 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 12:37:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:37:30,540 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 12:37:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 12:37:30,545 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 12:37:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-28 12:37:30,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-28 12:37:30,579 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 12:37:30,583 INFO L225 Difference]: With dead ends: 41 [2022-04-28 12:37:30,583 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 12:37:30,583 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 12:37:30,588 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 12:37:30,588 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 12:37:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 12:37:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 12:37:30,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:37:30,599 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 12:37:30,599 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 12:37:30,599 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 12:37:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:30,601 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 12:37:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 12:37:30,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:30,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:30,602 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 12:37:30,602 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 12:37:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:30,604 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 12:37:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 12:37:30,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:30,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:30,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:37:30,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:37:30,605 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 12:37:30,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-28 12:37:30,606 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-28 12:37:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:37:30,606 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-28 12:37:30,606 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 12:37:30,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-28 12:37:30,635 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 12:37:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-28 12:37:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 12:37:30,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:37:30,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:37:30,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:37:30,852 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 12:37:30,852 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:37:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:37:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-28 12:37:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:30,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647831324] [2022-04-28 12:37:30,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:37:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-28 12:37:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:37:30,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494780292] [2022-04-28 12:37:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:37:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:37:30,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:37:30,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758812662] [2022-04-28 12:37:30,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:37:30,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:37:30,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:37:30,866 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 12:37:30,867 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 12:37:30,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:37:30,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:37:30,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:37:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:37:30,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:37:34,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-28 12:37:34,298 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 12:37:34,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 12:37:34,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-28 12:37:34,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-28 12:37:34,299 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 12:37:34,299 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 12:37:34,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 12:37:34,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 12:37:34,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 12:37:34,299 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-28 12:37:34,299 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 12:37:34,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-28 12:37:34,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-28 12:37:34,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 12:37:34,300 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-28 12:37:36,301 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 12:37:36,302 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 12:37:36,303 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 < 5);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 12:37:37,169 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:37:37,170 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 12:37:37,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-28 12:37:37,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 12:37:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:37:37,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:37:37,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:37:37,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494780292] [2022-04-28 12:37:37,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:37:37,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758812662] [2022-04-28 12:37:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758812662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:37,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:37,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:37:37,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:37:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647831324] [2022-04-28 12:37:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647831324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:37:37,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:37:37,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:37:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839861318] [2022-04-28 12:37:37,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:37:37,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:37:37,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:37:37,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:37,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:37:37,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:37:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:37:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:37:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:37:37,761 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 12:37:42,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:37:50,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 12:37:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:50,145 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 12:37:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:37:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 12:37:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:37:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 12:37:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-28 12:37:50,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-28 12:37:57,042 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 12:37:57,043 INFO L225 Difference]: With dead ends: 53 [2022-04-28 12:37:57,043 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 12:37:57,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 12:37:57,044 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:37:57,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 12:37:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 12:37:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-28 12:37:57,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:37:57,061 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 12:37:57,061 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 12:37:57,061 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 12:37:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:57,063 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 12:37:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 12:37:57,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:57,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:57,064 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 12:37:57,064 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 12:37:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:37:57,066 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-28 12:37:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-28 12:37:57,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:37:57,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:37:57,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:37:57,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:37:57,067 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 12:37:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 12:37:57,069 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-28 12:37:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:37:57,069 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 12:37:57,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 12:37:57,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 12:38:01,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 12:38:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 12:38:01,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:01,487 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 12:38:01,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:01,688 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 12:38:01,688 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-28 12:38:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1015841858] [2022-04-28 12:38:01,689 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-28 12:38:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:01,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756472454] [2022-04-28 12:38:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:01,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:01,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508830261] [2022-04-28 12:38:01,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:01,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:01,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:01,705 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 12:38:01,705 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 12:38:01,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:01,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:01,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 12:38:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:01,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:01,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 12:38:01,883 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 12:38:01,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:01,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 12:38:01,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 12:38:01,883 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 12:38:01,883 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 12:38:01,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:01,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:01,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:01,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 12:38:01,884 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 12:38:01,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:01,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:01,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:01,884 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 12:38:01,884 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 12:38:01,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 12:38:01,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-28 12:38:01,885 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 12:38:01,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:38:01,885 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 12:38:01,886 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 12:38:01,887 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 12:38:01,887 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 12:38:01,888 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 12:38:01,888 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 12:38:01,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 12:38:01,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 12:38:01,889 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 12:38:01,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:02,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-28 12:38:02,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-28 12:38:02,244 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 12:38:02,245 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 12:38:02,245 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 12:38:02,248 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 12:38:02,252 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 12:38:02,252 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 12:38:02,253 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 12:38:02,253 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 12:38:02,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-28 12:38:02,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-28 12:38:02,253 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 12:38:02,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-28 12:38:02,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:02,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:02,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:02,254 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 12:38:02,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-28 12:38:02,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:02,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-28 12:38:02,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-28 12:38:02,254 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 12:38:02,254 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 12:38:02,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-28 12:38:02,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-28 12:38:02,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-28 12:38:02,255 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 12:38:02,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-28 12:38:02,255 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 12:38:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:02,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756472454] [2022-04-28 12:38:02,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:02,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508830261] [2022-04-28 12:38:02,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508830261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:02,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:02,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 12:38:02,256 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1015841858] [2022-04-28 12:38:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1015841858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:02,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:02,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694172252] [2022-04-28 12:38:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 12:38:02,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:02,257 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 12:38:02,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:02,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:02,292 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 12:38:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:02,663 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-28 12:38:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:38:02,663 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 12:38:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:02,664 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 12:38:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 12:38:02,665 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 12:38:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 12:38:02,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 12:38:02,705 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 12:38:02,707 INFO L225 Difference]: With dead ends: 57 [2022-04-28 12:38:02,707 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 12:38:02,707 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 12:38:02,708 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 12:38:02,708 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 12:38:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 12:38:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-28 12:38:02,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:02,737 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 12:38:02,737 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 12:38:02,737 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 12:38:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:02,739 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 12:38:02,739 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 12:38:02,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:02,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:02,740 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 12:38:02,740 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 12:38:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:02,742 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-28 12:38:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-28 12:38:02,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:02,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:02,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:02,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:02,743 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 12:38:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-28 12:38:02,744 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-28 12:38:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:02,744 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-28 12:38:02,744 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 12:38:02,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-28 12:38:03,369 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 12:38:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 12:38:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 12:38:03,369 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:03,370 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 12:38:03,386 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 12:38:03,570 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 12:38:03,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:03,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-28 12:38:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:03,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1923549407] [2022-04-28 12:38:03,571 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-28 12:38:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:03,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022271741] [2022-04-28 12:38:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:03,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:03,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044050531] [2022-04-28 12:38:03,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:03,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:03,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:03,592 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 12:38:03,593 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 12:38:03,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:03,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:03,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:38:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:03,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:03,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-28 12:38:03,954 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 12:38:03,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,956 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 12:38:03,956 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 12:38:03,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,958 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 12:38:03,958 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 12:38:03,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:03,960 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 12:38:03,960 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 12:38:03,961 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 12:38:03,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {1578#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:03,962 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 12:38:03,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:03,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:03,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:03,963 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 12:38:03,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:03,964 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 12:38:03,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1522#false} is VALID [2022-04-28 12:38:03,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-28 12:38:03,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 5);havoc #t~post8; {1522#false} is VALID [2022-04-28 12:38:03,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-28 12:38:03,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 5);havoc #t~post6; {1522#false} is VALID [2022-04-28 12:38:03,965 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 12:38:03,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-28 12:38:03,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-28 12:38:03,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-28 12:38:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 12:38:03,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:38:03,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:03,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022271741] [2022-04-28 12:38:03,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:03,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044050531] [2022-04-28 12:38:03,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044050531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:03,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:03,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:38:03,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:03,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1923549407] [2022-04-28 12:38:03,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1923549407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:03,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:03,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:38:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661365436] [2022-04-28 12:38:03,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:03,967 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 12:38:03,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:03,968 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 12:38:03,987 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 12:38:03,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:38:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:38:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:38:03,988 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 12:38:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:04,109 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-28 12:38:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:38:04,109 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 12:38:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:04,109 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 12:38:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 12:38:04,111 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 12:38:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-28 12:38:04,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-28 12:38:04,158 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 12:38:04,160 INFO L225 Difference]: With dead ends: 65 [2022-04-28 12:38:04,160 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 12:38:04,160 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 12:38:04,161 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 12:38:04,161 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 12:38:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 12:38:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 12:38:04,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:04,182 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 12:38:04,182 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 12:38:04,182 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 12:38:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:04,183 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 12:38:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 12:38:04,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:04,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:04,184 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 12:38:04,184 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 12:38:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:04,185 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 12:38:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 12:38:04,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:04,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:04,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:04,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:04,185 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 12:38:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-28 12:38:04,187 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-28 12:38:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:04,187 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-28 12:38:04,187 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 12:38:04,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-28 12:38:06,117 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 12:38:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-28 12:38:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 12:38:06,118 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:06,118 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 12:38:06,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 12:38:06,323 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 12:38:06,323 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-28 12:38:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:06,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370251522] [2022-04-28 12:38:06,324 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-28 12:38:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:06,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564503443] [2022-04-28 12:38:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:06,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:06,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130176330] [2022-04-28 12:38:06,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:06,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:06,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:06,349 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 12:38:06,374 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 12:38:06,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:06,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:06,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:38:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:06,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:06,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 12:38:06,607 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 12:38:06,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,608 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 12:38:06,609 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 12:38:06,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,610 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 12:38:06,611 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 12:38:06,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:06,612 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 12:38:06,612 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 12:38:06,613 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 12:38:06,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {1993#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:06,614 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 12:38:06,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:06,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:06,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:06,615 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 12:38:06,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:06,616 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 12:38:06,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {2018#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,617 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 12:38:06,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,618 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 12:38:06,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,619 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 12:38:06,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-28 12:38:06,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 12:38:06,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-28 12:38:06,620 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 12:38:06,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 12:38:06,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 12:38:06,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 12:38:06,620 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 12:38:06,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:06,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-28 12:38:06,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-28 12:38:06,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-28 12:38:06,832 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 12:38:06,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-28 12:38:06,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-28 12:38:06,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-28 12:38:06,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {2087#(< ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2083#(< |main_#t~post8| 5)} is VALID [2022-04-28 12:38:06,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 5)} assume !(~r~0 > 0); {2087#(< ~counter~0 5)} is VALID [2022-04-28 12:38:06,834 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 5)} #96#return; {2087#(< ~counter~0 5)} is VALID [2022-04-28 12:38:06,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 12:38:06,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 12:38:06,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 12:38:06,835 INFO L272 TraceCheckUtils]: 27: Hoare triple {2087#(< ~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)); {1936#true} is VALID [2022-04-28 12:38:06,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {2087#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {2087#(< ~counter~0 5)} is VALID [2022-04-28 12:38:06,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {2112#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2087#(< ~counter~0 5)} is VALID [2022-04-28 12:38:06,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 4)} assume !!(0 != ~r~0); {2112#(< ~counter~0 4)} is VALID [2022-04-28 12:38:06,836 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 4)} #94#return; {2112#(< ~counter~0 4)} is VALID [2022-04-28 12:38:06,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 12:38:06,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 12:38:06,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 12:38:06,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(< ~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)); {1936#true} is VALID [2022-04-28 12:38:06,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2112#(< ~counter~0 4)} is VALID [2022-04-28 12:38:06,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {2018#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2112#(< ~counter~0 4)} is VALID [2022-04-28 12:38:06,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {2018#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,838 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #92#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 12:38:06,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 12:38:06,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 12:38:06,838 INFO L272 TraceCheckUtils]: 11: Hoare triple {2018#(<= ~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)); {1936#true} is VALID [2022-04-28 12:38:06,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #90#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-28 12:38:06,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-28 12:38:06,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-28 12:38:06,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {2018#(<= ~counter~0 2)} 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 12:38:06,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {2018#(<= ~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; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {2018#(<= ~counter~0 2)} call #t~ret9 := main(); {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2018#(<= ~counter~0 2)} {1936#true} #102#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,841 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; {2018#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:06,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-28 12:38:06,841 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 12:38:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:06,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564503443] [2022-04-28 12:38:06,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130176330] [2022-04-28 12:38:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130176330] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 12:38:06,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 12:38:06,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-04-28 12:38:06,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370251522] [2022-04-28 12:38:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370251522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:06,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:06,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:38:06,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567779291] [2022-04-28 12:38:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:06,843 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 12:38:06,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:06,843 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 12:38:06,867 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 12:38:06,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:38:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:06,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:38:06,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:38:06,867 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 12:38:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:07,034 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-28 12:38:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:38:07,035 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 12:38:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:07,035 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 12:38:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 12:38:07,036 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 12:38:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-28 12:38:07,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-28 12:38:07,091 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 12:38:07,092 INFO L225 Difference]: With dead ends: 74 [2022-04-28 12:38:07,092 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 12:38:07,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:38:07,093 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 12:38:07,093 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 12:38:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 12:38:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 12:38:07,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:07,130 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 12:38:07,130 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 12:38:07,130 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 12:38:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:07,131 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 12:38:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 12:38:07,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:07,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:07,132 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 12:38:07,132 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 12:38:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:07,133 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 12:38:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 12:38:07,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:07,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:07,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:07,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:07,134 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 12:38:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-28 12:38:07,135 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-28 12:38:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:07,135 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-28 12:38:07,135 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 12:38:07,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-28 12:38:09,192 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 12:38:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-28 12:38:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 12:38:09,192 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:09,192 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 12:38:09,209 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 12:38:09,393 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 12:38:09,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-28 12:38:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:09,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328314809] [2022-04-28 12:38:09,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-28 12:38:09,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:09,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200295907] [2022-04-28 12:38:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:09,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:09,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:09,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [686878074] [2022-04-28 12:38:09,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:09,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:09,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:09,405 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 12:38:09,406 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 12:38:09,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:09,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:09,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 12:38:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:09,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:09,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 12:38:09,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2556#(<= ~counter~0 0)} {2548#true} #102#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {2556#(<= ~counter~0 0)} call #t~ret9 := main(); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {2556#(<= ~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; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {2556#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #90#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {2556#(<= ~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)); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,673 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #92#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {2556#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2556#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:09,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {2556#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {2605#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {2605#(<= ~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)); {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {2605#(<= ~counter~0 1)} ~cond := #in~cond; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= ~counter~0 1)} assume !(0 == ~cond); {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {2605#(<= ~counter~0 1)} assume true; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,676 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2605#(<= ~counter~0 1)} {2605#(<= ~counter~0 1)} #94#return; {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {2605#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2605#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:09,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {2605#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {2630#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,678 INFO L272 TraceCheckUtils]: 27: Hoare triple {2630#(<= ~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)); {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(<= ~counter~0 2)} ~cond := #in~cond; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(<= ~counter~0 2)} assume !(0 == ~cond); {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,679 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2630#(<= ~counter~0 2)} {2630#(<= ~counter~0 2)} #96#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {2630#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {2630#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2655#(<= |main_#t~post7| 2)} is VALID [2022-04-28 12:38:09,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-28 12:38:09,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L272 TraceCheckUtils]: 39: Hoare triple {2549#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)); {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 12:38:09,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 12:38:09,681 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 12:38:09,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L272 TraceCheckUtils]: 39: Hoare triple {2549#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)); {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-28 12:38:09,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {2707#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-28 12:38:09,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {2711#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2707#(< |main_#t~post7| 5)} is VALID [2022-04-28 12:38:09,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {2711#(< ~counter~0 5)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2711#(< ~counter~0 5)} is VALID [2022-04-28 12:38:09,874 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2711#(< ~counter~0 5)} #96#return; {2711#(< ~counter~0 5)} is VALID [2022-04-28 12:38:09,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 12:38:09,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 12:38:09,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 12:38:09,874 INFO L272 TraceCheckUtils]: 27: Hoare triple {2711#(< ~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)); {2548#true} is VALID [2022-04-28 12:38:09,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {2711#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {2711#(< ~counter~0 5)} is VALID [2022-04-28 12:38:09,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {2736#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2711#(< ~counter~0 5)} is VALID [2022-04-28 12:38:09,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {2736#(< ~counter~0 4)} assume !!(0 != ~r~0); {2736#(< ~counter~0 4)} is VALID [2022-04-28 12:38:09,877 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2736#(< ~counter~0 4)} #94#return; {2736#(< ~counter~0 4)} is VALID [2022-04-28 12:38:09,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 12:38:09,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 12:38:09,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 12:38:09,877 INFO L272 TraceCheckUtils]: 19: Hoare triple {2736#(< ~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)); {2548#true} is VALID [2022-04-28 12:38:09,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {2736#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2736#(< ~counter~0 4)} is VALID [2022-04-28 12:38:09,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {2630#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2736#(< ~counter~0 4)} is VALID [2022-04-28 12:38:09,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {2630#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #92#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 12:38:09,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 12:38:09,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 12:38:09,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {2630#(<= ~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)); {2548#true} is VALID [2022-04-28 12:38:09,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #90#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 12:38:09,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-28 12:38:09,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-28 12:38:09,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {2630#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2548#true} is VALID [2022-04-28 12:38:09,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {2630#(<= ~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; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {2630#(<= ~counter~0 2)} call #t~ret9 := main(); {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2630#(<= ~counter~0 2)} {2548#true} #102#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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; {2630#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:09,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 12:38:09,881 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 12:38:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:09,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200295907] [2022-04-28 12:38:09,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:09,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686878074] [2022-04-28 12:38:09,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686878074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:09,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:09,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 12:38:09,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:09,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328314809] [2022-04-28 12:38:09,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328314809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:09,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:09,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 12:38:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846363868] [2022-04-28 12:38:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:09,883 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 12:38:09,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:09,883 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 12:38:09,910 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 12:38:09,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 12:38:09,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 12:38:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:38:09,911 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 12:38:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:10,122 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-28 12:38:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 12:38:10,123 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 12:38:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:10,123 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 12:38:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 12:38:10,125 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 12:38:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-28 12:38:10,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-28 12:38:10,194 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 12:38:10,195 INFO L225 Difference]: With dead ends: 75 [2022-04-28 12:38:10,195 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 12:38:10,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:10,196 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:10,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:38:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 12:38:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 12:38:10,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:10,247 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 12:38:10,247 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 12:38:10,247 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 12:38:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:10,249 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 12:38:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 12:38:10,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:10,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:10,251 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 12:38:10,251 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 12:38:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:10,252 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-28 12:38:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 12:38:10,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:10,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:10,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:10,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:10,253 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 12:38:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-28 12:38:10,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-28 12:38:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:10,254 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-28 12:38:10,255 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 12:38:10,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-28 12:38:12,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 61 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-28 12:38:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 12:38:12,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:12,320 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 12:38:12,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 12:38:12,521 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 12:38:12,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-28 12:38:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:12,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753234559] [2022-04-28 12:38:12,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:12,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-28 12:38:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:12,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794431209] [2022-04-28 12:38:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:12,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:12,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560518092] [2022-04-28 12:38:12,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:12,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:12,534 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 12:38:12,535 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 12:38:12,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:12,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:12,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 12:38:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:12,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:12,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#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; {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #102#return; {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret9 := main(); {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#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; {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {3182#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3182#true} is VALID [2022-04-28 12:38:12,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3182#true} {3182#true} #90#return; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {3182#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)); {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3182#true} {3182#true} #92#return; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {3182#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {3182#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {3182#true} assume !!(#t~post6 < 5);havoc #t~post6; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L272 TraceCheckUtils]: 19: Hoare triple {3182#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)); {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 12:38:12,730 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3182#true} {3182#true} #94#return; {3182#true} is VALID [2022-04-28 12:38:12,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {3182#true} assume !!(0 != ~r~0); {3259#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:12,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {3259#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3259#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:12,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {3259#(not (= main_~r~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {3259#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:12,731 INFO L272 TraceCheckUtils]: 27: Hoare triple {3259#(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)); {3182#true} is VALID [2022-04-28 12:38:12,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 12:38:12,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 12:38:12,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 12:38:12,732 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3182#true} {3259#(not (= main_~r~0 0))} #96#return; {3259#(not (= main_~r~0 0))} is VALID [2022-04-28 12:38:12,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {3259#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:12,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:12,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:12,733 INFO L272 TraceCheckUtils]: 35: Hoare triple {3284#(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)); {3182#true} is VALID [2022-04-28 12:38:12,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-28 12:38:12,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-28 12:38:12,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 12:38:12,734 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3182#true} {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-28 12:38:12,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3183#false} is VALID [2022-04-28 12:38:12,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {3183#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3183#false} is VALID [2022-04-28 12:38:12,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {3183#false} assume !(#t~post6 < 5);havoc #t~post6; {3183#false} is VALID [2022-04-28 12:38:12,735 INFO L272 TraceCheckUtils]: 43: Hoare triple {3183#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)); {3183#false} is VALID [2022-04-28 12:38:12,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {3183#false} ~cond := #in~cond; {3183#false} is VALID [2022-04-28 12:38:12,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {3183#false} assume 0 == ~cond; {3183#false} is VALID [2022-04-28 12:38:12,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-28 12:38:12,735 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 12:38:12,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:38:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:12,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794431209] [2022-04-28 12:38:12,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:12,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560518092] [2022-04-28 12:38:12,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560518092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:12,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:12,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:38:12,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:12,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753234559] [2022-04-28 12:38:12,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753234559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:12,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:12,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:38:12,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54857676] [2022-04-28 12:38:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:12,736 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 12:38:12,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:12,737 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 12:38:12,762 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 12:38:12,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:38:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:38:12,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:38:12,763 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 12:38:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:12,939 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-28 12:38:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:38:12,939 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 12:38:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:12,939 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 12:38:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 12:38:12,941 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 12:38:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 12:38:12,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 12:38:13,011 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 12:38:13,013 INFO L225 Difference]: With dead ends: 101 [2022-04-28 12:38:13,013 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 12:38:13,013 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 12:38:13,013 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:13,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 12:38:13,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-28 12:38:13,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:13,066 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 12:38:13,066 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 12:38:13,066 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 12:38:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:13,068 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 12:38:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 12:38:13,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:13,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:13,069 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 12:38:13,069 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 12:38:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:13,071 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-28 12:38:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-28 12:38:13,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:13,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:13,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:13,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:13,071 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 12:38:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-28 12:38:13,073 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-28 12:38:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:13,073 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-28 12:38:13,073 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 12:38:13,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-28 12:38:15,166 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 12:38:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-28 12:38:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 12:38:15,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:15,167 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 12:38:15,186 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 12:38:15,367 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 12:38:15,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-28 12:38:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1232209149] [2022-04-28 12:38:15,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-28 12:38:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610127566] [2022-04-28 12:38:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:15,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:15,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1438418905] [2022-04-28 12:38:15,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:15,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:15,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:15,386 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 12:38:15,388 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 12:38:15,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:15,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:15,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:38:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:15,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:15,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-28 12:38:15,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {3828#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; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3836#(<= ~counter~0 0)} {3828#true} #102#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {3836#(<= ~counter~0 0)} call #t~ret9 := main(); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {3836#(<= ~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; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {3836#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #90#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,669 INFO L272 TraceCheckUtils]: 11: Hoare triple {3836#(<= ~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)); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #92#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {3836#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3836#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:15,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {3836#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {3885#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,672 INFO L272 TraceCheckUtils]: 19: Hoare triple {3885#(<= ~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)); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {3885#(<= ~counter~0 1)} ~cond := #in~cond; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {3885#(<= ~counter~0 1)} assume !(0 == ~cond); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,673 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3885#(<= ~counter~0 1)} {3885#(<= ~counter~0 1)} #94#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {3885#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {3885#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {3910#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,675 INFO L272 TraceCheckUtils]: 27: Hoare triple {3910#(<= ~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)); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {3910#(<= ~counter~0 2)} ~cond := #in~cond; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {3910#(<= ~counter~0 2)} assume !(0 == ~cond); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {3910#(<= ~counter~0 2)} assume true; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,676 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3910#(<= ~counter~0 2)} {3910#(<= ~counter~0 2)} #96#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {3910#(<= ~counter~0 2)} assume !(~r~0 > 0); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {3910#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {3935#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,677 INFO L272 TraceCheckUtils]: 35: Hoare triple {3935#(<= ~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)); {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,678 INFO L290 TraceCheckUtils]: 36: Hoare triple {3935#(<= ~counter~0 3)} ~cond := #in~cond; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {3935#(<= ~counter~0 3)} assume !(0 == ~cond); {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {3935#(<= ~counter~0 3)} assume true; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,679 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3935#(<= ~counter~0 3)} {3935#(<= ~counter~0 3)} #98#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {3935#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {3935#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3960#(<= |main_#t~post8| 3)} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {3960#(<= |main_#t~post8| 3)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-28 12:38:15,680 INFO L272 TraceCheckUtils]: 45: Hoare triple {3829#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)); {3829#false} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-28 12:38:15,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-28 12:38:15,680 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 12:38:15,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:15,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-28 12:38:15,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-28 12:38:15,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-28 12:38:15,921 INFO L272 TraceCheckUtils]: 45: Hoare triple {3829#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)); {3829#false} is VALID [2022-04-28 12:38:15,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-28 12:38:15,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-28 12:38:15,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {4000#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-28 12:38:15,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {4004#(< ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4000#(< |main_#t~post8| 5)} is VALID [2022-04-28 12:38:15,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {4004#(< ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4004#(< ~counter~0 5)} is VALID [2022-04-28 12:38:15,923 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3828#true} {4004#(< ~counter~0 5)} #98#return; {4004#(< ~counter~0 5)} is VALID [2022-04-28 12:38:15,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 12:38:15,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 12:38:15,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 12:38:15,923 INFO L272 TraceCheckUtils]: 35: Hoare triple {4004#(< ~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)); {3828#true} is VALID [2022-04-28 12:38:15,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {4004#(< ~counter~0 5)} assume !!(#t~post8 < 5);havoc #t~post8; {4004#(< ~counter~0 5)} is VALID [2022-04-28 12:38:15,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {3935#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4004#(< ~counter~0 5)} is VALID [2022-04-28 12:38:15,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {3935#(<= ~counter~0 3)} assume !(~r~0 > 0); {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,925 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3828#true} {3935#(<= ~counter~0 3)} #96#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 12:38:15,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 12:38:15,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 12:38:15,926 INFO L272 TraceCheckUtils]: 27: Hoare triple {3935#(<= ~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)); {3828#true} is VALID [2022-04-28 12:38:15,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {3935#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {3910#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3935#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:15,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {3910#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,927 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3828#true} {3910#(<= ~counter~0 2)} #94#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 12:38:15,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 12:38:15,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 12:38:15,928 INFO L272 TraceCheckUtils]: 19: Hoare triple {3910#(<= ~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)); {3828#true} is VALID [2022-04-28 12:38:15,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {3910#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {3885#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3910#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:15,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {3885#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,929 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #92#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 12:38:15,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 12:38:15,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 12:38:15,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {3885#(<= ~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)); {3828#true} is VALID [2022-04-28 12:38:15,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #90#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-28 12:38:15,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-28 12:38:15,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-28 12:38:15,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {3885#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3828#true} is VALID [2022-04-28 12:38:15,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {3885#(<= ~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; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {3885#(<= ~counter~0 1)} call #t~ret9 := main(); {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3885#(<= ~counter~0 1)} {3828#true} #102#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {3828#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; {3885#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:15,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-28 12:38:15,932 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 12:38:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610127566] [2022-04-28 12:38:15,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:15,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438418905] [2022-04-28 12:38:15,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438418905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:15,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:15,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 12:38:15,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1232209149] [2022-04-28 12:38:15,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1232209149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:15,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:15,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:38:15,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245960299] [2022-04-28 12:38:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:15,952 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 12:38:15,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:15,952 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 12:38:15,985 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 12:38:15,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:38:15,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:15,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:38:15,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:38:15,986 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 12:38:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:16,202 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-28 12:38:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:38:16,202 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 12:38:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:16,202 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 12:38:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 12:38:16,203 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 12:38:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-28 12:38:16,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-28 12:38:16,269 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 12:38:16,270 INFO L225 Difference]: With dead ends: 118 [2022-04-28 12:38:16,270 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 12:38:16,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:16,270 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:16,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 123 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 12:38:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-28 12:38:16,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:16,332 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 12:38:16,332 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 12:38:16,332 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 12:38:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:16,338 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 12:38:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 12:38:16,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:16,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:16,339 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 12:38:16,340 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 12:38:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:16,341 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 12:38:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-28 12:38:16,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:16,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:16,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:16,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:16,342 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 12:38:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-28 12:38:16,343 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-28 12:38:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:16,343 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-28 12:38:16,343 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 12:38:16,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-28 12:38:16,944 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 12:38:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-28 12:38:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 12:38:16,945 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:16,945 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 12:38:16,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:17,145 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 12:38:17,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-28 12:38:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:17,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390905743] [2022-04-28 12:38:17,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:17,146 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-28 12:38:17,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331442262] [2022-04-28 12:38:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:17,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:17,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917118808] [2022-04-28 12:38:17,175 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:38:17,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:17,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:17,175 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 12:38:17,208 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 12:38:17,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:38:17,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:17,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 12:38:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:17,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:17,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-28 12:38:17,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4690#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; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4698#(<= ~counter~0 0)} {4690#true} #102#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {4698#(<= ~counter~0 0)} call #t~ret9 := main(); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {4698#(<= ~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; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {4698#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,542 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #90#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,543 INFO L272 TraceCheckUtils]: 11: Hoare triple {4698#(<= ~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)); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,544 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #92#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {4698#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4698#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:17,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {4698#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {4747#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {4747#(<= ~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)); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {4747#(<= ~counter~0 1)} ~cond := #in~cond; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(<= ~counter~0 1)} assume !(0 == ~cond); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,547 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4747#(<= ~counter~0 1)} {4747#(<= ~counter~0 1)} #94#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {4747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {4747#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {4772#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,548 INFO L272 TraceCheckUtils]: 27: Hoare triple {4772#(<= ~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)); {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {4772#(<= ~counter~0 2)} ~cond := #in~cond; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= ~counter~0 2)} assume !(0 == ~cond); {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {4772#(<= ~counter~0 2)} assume true; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,549 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4772#(<= ~counter~0 2)} {4772#(<= ~counter~0 2)} #96#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {4772#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {4772#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {4797#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,551 INFO L272 TraceCheckUtils]: 35: Hoare triple {4797#(<= ~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)); {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {4797#(<= ~counter~0 3)} ~cond := #in~cond; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {4797#(<= ~counter~0 3)} assume !(0 == ~cond); {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {4797#(<= ~counter~0 3)} assume true; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,552 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4797#(<= ~counter~0 3)} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {4797#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {4797#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4822#(<= |main_#t~post7| 3)} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {4822#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L272 TraceCheckUtils]: 47: Hoare triple {4691#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)); {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-28 12:38:17,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-28 12:38:17,554 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 12:38:17,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L272 TraceCheckUtils]: 47: Hoare triple {4691#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)); {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-28 12:38:17,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-28 12:38:17,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {4874#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-28 12:38:17,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4874#(< |main_#t~post7| 5)} is VALID [2022-04-28 12:38:17,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {4878#(< ~counter~0 5)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4878#(< ~counter~0 5)} is VALID [2022-04-28 12:38:17,769 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4690#true} {4878#(< ~counter~0 5)} #96#return; {4878#(< ~counter~0 5)} is VALID [2022-04-28 12:38:17,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 12:38:17,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 12:38:17,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 12:38:17,769 INFO L272 TraceCheckUtils]: 35: Hoare triple {4878#(< ~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)); {4690#true} is VALID [2022-04-28 12:38:17,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {4878#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {4878#(< ~counter~0 5)} is VALID [2022-04-28 12:38:17,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {4797#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4878#(< ~counter~0 5)} is VALID [2022-04-28 12:38:17,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {4797#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,771 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4690#true} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 12:38:17,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 12:38:17,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 12:38:17,771 INFO L272 TraceCheckUtils]: 27: Hoare triple {4797#(<= ~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)); {4690#true} is VALID [2022-04-28 12:38:17,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {4797#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {4772#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4797#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:17,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {4772#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,772 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4690#true} {4772#(<= ~counter~0 2)} #94#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 12:38:17,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 12:38:17,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 12:38:17,773 INFO L272 TraceCheckUtils]: 19: Hoare triple {4772#(<= ~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)); {4690#true} is VALID [2022-04-28 12:38:17,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {4772#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {4747#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4772#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:17,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {4747#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,774 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #92#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 12:38:17,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 12:38:17,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 12:38:17,774 INFO L272 TraceCheckUtils]: 11: Hoare triple {4747#(<= ~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)); {4690#true} is VALID [2022-04-28 12:38:17,775 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #90#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-28 12:38:17,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-28 12:38:17,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-28 12:38:17,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {4747#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4690#true} is VALID [2022-04-28 12:38:17,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {4747#(<= ~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; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 1)} call #t~ret9 := main(); {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 1)} {4690#true} #102#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {4690#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; {4747#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:17,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-28 12:38:17,777 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 12:38:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:17,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331442262] [2022-04-28 12:38:17,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:17,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917118808] [2022-04-28 12:38:17,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917118808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:17,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:17,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 12:38:17,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:17,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390905743] [2022-04-28 12:38:17,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390905743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:17,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:17,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 12:38:17,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181915991] [2022-04-28 12:38:17,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:17,778 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 12:38:17,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:17,778 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 12:38:17,810 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 12:38:17,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 12:38:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 12:38:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:38:17,811 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 12:38:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:18,020 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-28 12:38:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:38:18,020 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 12:38:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:18,020 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 12:38:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 12:38:18,021 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 12:38:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 12:38:18,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 12:38:18,089 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 12:38:18,090 INFO L225 Difference]: With dead ends: 119 [2022-04-28 12:38:18,090 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 12:38:18,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:38:18,091 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:18,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 12:38:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-28 12:38:18,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:18,159 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 12:38:18,160 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 12:38:18,160 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 12:38:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:18,161 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 12:38:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 12:38:18,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:18,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:18,162 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 12:38:18,162 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 12:38:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:18,163 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-28 12:38:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 12:38:18,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:18,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:18,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:18,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:18,164 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 12:38:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-28 12:38:18,185 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-28 12:38:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:18,185 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-28 12:38:18,185 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 12:38:18,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-28 12:38:20,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-28 12:38:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 12:38:20,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:20,303 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 12:38:20,306 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 12:38:20,503 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 12:38:20,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-28 12:38:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902608056] [2022-04-28 12:38:20,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-28 12:38:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:20,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333942688] [2022-04-28 12:38:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:20,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:20,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1868710331] [2022-04-28 12:38:20,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:38:20,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:20,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:20,531 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 12:38:20,532 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 12:38:20,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:38:20,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:20,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:38:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:20,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:20,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-28 12:38:20,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#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; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#(<= ~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; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {5582#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,785 INFO L272 TraceCheckUtils]: 11: Hoare triple {5582#(<= ~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)); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,786 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {5582#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:20,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {5582#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {5631#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,788 INFO L272 TraceCheckUtils]: 19: Hoare triple {5631#(<= ~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)); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {5631#(<= ~counter~0 1)} ~cond := #in~cond; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#(<= ~counter~0 1)} assume !(0 == ~cond); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#(<= ~counter~0 1)} assume true; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,789 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5631#(<= ~counter~0 1)} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:20,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {5631#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {5656#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,790 INFO L272 TraceCheckUtils]: 27: Hoare triple {5656#(<= ~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)); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {5656#(<= ~counter~0 2)} ~cond := #in~cond; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {5656#(<= ~counter~0 2)} assume !(0 == ~cond); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {5656#(<= ~counter~0 2)} assume true; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,791 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5656#(<= ~counter~0 2)} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:20,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {5656#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {5681#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,792 INFO L272 TraceCheckUtils]: 35: Hoare triple {5681#(<= ~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)); {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {5681#(<= ~counter~0 3)} ~cond := #in~cond; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {5681#(<= ~counter~0 3)} assume !(0 == ~cond); {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {5681#(<= ~counter~0 3)} assume true; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,793 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5681#(<= ~counter~0 3)} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {5681#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:20,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {5681#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {5706#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,794 INFO L272 TraceCheckUtils]: 43: Hoare triple {5706#(<= ~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)); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {5706#(<= ~counter~0 4)} ~cond := #in~cond; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {5706#(<= ~counter~0 4)} assume !(0 == ~cond); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {5706#(<= ~counter~0 4)} assume true; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,795 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5706#(<= ~counter~0 4)} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:20,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {5706#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5731#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:38:20,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-28 12:38:20,796 INFO L272 TraceCheckUtils]: 51: Hoare triple {5575#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)); {5575#false} is VALID [2022-04-28 12:38:20,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-28 12:38:20,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-28 12:38:20,796 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-28 12:38:20,796 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 12:38:20,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:21,008 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-28 12:38:21,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-28 12:38:21,009 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-28 12:38:21,009 INFO L272 TraceCheckUtils]: 51: Hoare triple {5575#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)); {5575#false} is VALID [2022-04-28 12:38:21,009 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-28 12:38:21,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {5706#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5731#(<= |main_#t~post6| 4)} is VALID [2022-04-28 12:38:21,009 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:21,010 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5574#true} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:21,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 12:38:21,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 12:38:21,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 12:38:21,010 INFO L272 TraceCheckUtils]: 43: Hoare triple {5706#(<= ~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)); {5574#true} is VALID [2022-04-28 12:38:21,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {5706#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:21,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {5681#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5706#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:21,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {5681#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:21,011 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5574#true} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:21,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 12:38:21,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 12:38:21,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 12:38:21,012 INFO L272 TraceCheckUtils]: 35: Hoare triple {5681#(<= ~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)); {5574#true} is VALID [2022-04-28 12:38:21,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {5681#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:21,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {5656#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5681#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:21,013 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:21,013 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5574#true} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:21,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 12:38:21,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 12:38:21,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 12:38:21,013 INFO L272 TraceCheckUtils]: 27: Hoare triple {5656#(<= ~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)); {5574#true} is VALID [2022-04-28 12:38:21,013 INFO L290 TraceCheckUtils]: 26: Hoare triple {5656#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:21,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {5631#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5656#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:21,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:21,015 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5574#true} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:21,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 12:38:21,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 12:38:21,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 12:38:21,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {5631#(<= ~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)); {5574#true} is VALID [2022-04-28 12:38:21,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {5631#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:21,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {5582#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5631#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:21,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {5582#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,016 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 12:38:21,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 12:38:21,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 12:38:21,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {5582#(<= ~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)); {5574#true} is VALID [2022-04-28 12:38:21,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-28 12:38:21,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-28 12:38:21,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-28 12:38:21,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {5582#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5574#true} is VALID [2022-04-28 12:38:21,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {5582#(<= ~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; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {5574#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; {5582#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:21,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-28 12:38:21,019 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 12:38:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:21,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333942688] [2022-04-28 12:38:21,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:21,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868710331] [2022-04-28 12:38:21,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868710331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:21,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:21,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:38:21,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:21,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902608056] [2022-04-28 12:38:21,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902608056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:21,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:21,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114916500] [2022-04-28 12:38:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:21,020 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 12:38:21,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:21,020 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 12:38:21,053 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 12:38:21,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:21,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:21,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:21,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:38:21,054 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 12:38:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:21,302 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-28 12:38:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 12:38:21,303 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 12:38:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:21,303 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 12:38:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 12:38:21,304 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 12:38:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-28 12:38:21,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-28 12:38:21,362 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 12:38:21,364 INFO L225 Difference]: With dead ends: 99 [2022-04-28 12:38:21,364 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 12:38:21,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:38:21,365 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:21,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 146 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 12:38:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-28 12:38:21,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:21,424 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 12:38:21,424 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 12:38:21,424 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 12:38:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:21,426 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 12:38:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 12:38:21,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:21,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:21,426 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 12:38:21,426 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 12:38:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:21,428 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-28 12:38:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 12:38:21,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:21,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:21,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:21,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:21,429 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 12:38:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-28 12:38:21,432 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-28 12:38:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:21,432 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-28 12:38:21,432 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 12:38:21,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-28 12:38:22,044 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 12:38:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-28 12:38:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 12:38:22,047 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:22,047 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 12:38:22,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 12:38:22,264 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 12:38:22,264 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-28 12:38:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:22,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14944862] [2022-04-28 12:38:22,265 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-28 12:38:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:22,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211265108] [2022-04-28 12:38:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:22,299 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:22,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [441590069] [2022-04-28 12:38:22,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:38:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:22,300 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 12:38:22,307 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 12:38:22,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:38:22,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:22,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:38:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:22,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:22,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-28 12:38:22,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {6489#(<= ~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; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {6489#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,664 INFO L272 TraceCheckUtils]: 11: Hoare triple {6489#(<= ~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)); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,665 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {6489#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {6489#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {6538#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,667 INFO L272 TraceCheckUtils]: 19: Hoare triple {6538#(<= ~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)); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#(<= ~counter~0 1)} ~cond := #in~cond; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#(<= ~counter~0 1)} assume !(0 == ~cond); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {6538#(<= ~counter~0 1)} assume true; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,669 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6538#(<= ~counter~0 1)} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,669 INFO L290 TraceCheckUtils]: 25: Hoare triple {6538#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {6563#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,670 INFO L272 TraceCheckUtils]: 27: Hoare triple {6563#(<= ~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)); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {6563#(<= ~counter~0 2)} ~cond := #in~cond; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {6563#(<= ~counter~0 2)} assume !(0 == ~cond); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {6563#(<= ~counter~0 2)} assume true; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,672 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6563#(<= ~counter~0 2)} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {6563#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {6588#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,674 INFO L272 TraceCheckUtils]: 35: Hoare triple {6588#(<= ~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)); {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {6588#(<= ~counter~0 3)} ~cond := #in~cond; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {6588#(<= ~counter~0 3)} assume !(0 == ~cond); {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {6588#(<= ~counter~0 3)} assume true; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,675 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6588#(<= ~counter~0 3)} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {6588#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {6588#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {6613#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,677 INFO L272 TraceCheckUtils]: 43: Hoare triple {6613#(<= ~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)); {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {6613#(<= ~counter~0 4)} ~cond := #in~cond; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {6613#(<= ~counter~0 4)} assume !(0 == ~cond); {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {6613#(<= ~counter~0 4)} assume true; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,678 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6613#(<= ~counter~0 4)} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {6613#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {6613#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6638#(<= |main_#t~post8| 4)} is VALID [2022-04-28 12:38:22,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-28 12:38:22,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-28 12:38:22,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-28 12:38:22,680 INFO L272 TraceCheckUtils]: 53: Hoare triple {6482#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)); {6482#false} is VALID [2022-04-28 12:38:22,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-28 12:38:22,680 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-28 12:38:22,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-28 12:38:22,680 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 12:38:22,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:22,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-28 12:38:22,958 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-28 12:38:22,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-28 12:38:22,958 INFO L272 TraceCheckUtils]: 53: Hoare triple {6482#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)); {6482#false} is VALID [2022-04-28 12:38:22,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-28 12:38:22,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-28 12:38:22,958 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-28 12:38:22,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {6613#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6638#(<= |main_#t~post8| 4)} is VALID [2022-04-28 12:38:22,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {6613#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,960 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6481#true} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 12:38:22,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 12:38:22,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 12:38:22,960 INFO L272 TraceCheckUtils]: 43: Hoare triple {6613#(<= ~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)); {6481#true} is VALID [2022-04-28 12:38:22,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {6613#(<= ~counter~0 4)} assume !!(#t~post8 < 5);havoc #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {6588#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6613#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:22,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {6588#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,962 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6481#true} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 12:38:22,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 12:38:22,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 12:38:22,962 INFO L272 TraceCheckUtils]: 35: Hoare triple {6588#(<= ~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)); {6481#true} is VALID [2022-04-28 12:38:22,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {6588#(<= ~counter~0 3)} assume !!(#t~post8 < 5);havoc #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {6563#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6588#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:22,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,964 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6481#true} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 12:38:22,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 12:38:22,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 12:38:22,964 INFO L272 TraceCheckUtils]: 27: Hoare triple {6563#(<= ~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)); {6481#true} is VALID [2022-04-28 12:38:22,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {6563#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {6538#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6563#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:22,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,966 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6481#true} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 12:38:22,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 12:38:22,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 12:38:22,966 INFO L272 TraceCheckUtils]: 19: Hoare triple {6538#(<= ~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)); {6481#true} is VALID [2022-04-28 12:38:22,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {6538#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {6489#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6538#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:22,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {6489#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,967 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {6489#(<= ~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)); {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-28 12:38:22,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {6489#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6481#true} is VALID [2022-04-28 12:38:22,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {6489#(<= ~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; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {6481#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; {6489#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:22,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-28 12:38:22,970 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 12:38:22,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:22,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211265108] [2022-04-28 12:38:22,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:22,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441590069] [2022-04-28 12:38:22,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441590069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:22,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:22,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:38:22,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:22,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14944862] [2022-04-28 12:38:22,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14944862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:22,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:22,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:22,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18001238] [2022-04-28 12:38:22,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:22,972 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 12:38:22,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:22,972 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 12:38:23,013 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 12:38:23,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:38:23,014 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 12:38:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:23,277 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-28 12:38:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:38:23,277 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 12:38:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:23,277 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 12:38:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 12:38:23,278 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 12:38:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-28 12:38:23,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-28 12:38:23,354 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 12:38:23,355 INFO L225 Difference]: With dead ends: 132 [2022-04-28 12:38:23,356 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 12:38:23,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 12:38:23,356 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:23,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 150 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 12:38:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 12:38:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-28 12:38:23,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:23,432 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 12:38:23,432 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 12:38:23,432 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 12:38:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:23,433 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 12:38:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 12:38:23,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:23,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:23,434 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 12:38:23,434 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 12:38:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:23,435 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-28 12:38:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-28 12:38:23,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:23,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:23,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:23,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:23,436 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 12:38:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-28 12:38:23,437 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-28 12:38:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:23,438 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-28 12:38:23,438 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 12:38:23,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-28 12:38:24,229 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 12:38:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-28 12:38:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 12:38:24,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:24,230 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 12:38:24,246 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 12:38:24,430 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 12:38:24,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-28 12:38:24,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:24,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711373155] [2022-04-28 12:38:24,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-28 12:38:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:24,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405666152] [2022-04-28 12:38:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:24,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:24,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81491077] [2022-04-28 12:38:24,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 12:38:24,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:24,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:24,447 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 12:38:24,448 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 12:38:24,524 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 12:38:24,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:38:24,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:38:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:38:24,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:38:24,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-28 12:38:24,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {7476#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; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {7484#(<= ~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; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {7484#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,790 INFO L272 TraceCheckUtils]: 11: Hoare triple {7484#(<= ~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)); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,791 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {7484#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:24,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {7484#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {7533#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,793 INFO L272 TraceCheckUtils]: 19: Hoare triple {7533#(<= ~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)); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {7533#(<= ~counter~0 1)} ~cond := #in~cond; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {7533#(<= ~counter~0 1)} assume !(0 == ~cond); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {7533#(<= ~counter~0 1)} assume true; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,794 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7533#(<= ~counter~0 1)} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:24,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {7533#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {7558#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,796 INFO L272 TraceCheckUtils]: 27: Hoare triple {7558#(<= ~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)); {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {7558#(<= ~counter~0 2)} ~cond := #in~cond; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {7558#(<= ~counter~0 2)} assume !(0 == ~cond); {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {7558#(<= ~counter~0 2)} assume true; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,797 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7558#(<= ~counter~0 2)} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {7558#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:24,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {7583#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,799 INFO L272 TraceCheckUtils]: 35: Hoare triple {7583#(<= ~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)); {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {7583#(<= ~counter~0 3)} ~cond := #in~cond; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {7583#(<= ~counter~0 3)} assume !(0 == ~cond); {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {7583#(<= ~counter~0 3)} assume true; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,800 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7583#(<= ~counter~0 3)} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {7583#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:24,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {7583#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {7608#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,802 INFO L272 TraceCheckUtils]: 43: Hoare triple {7608#(<= ~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)); {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {7608#(<= ~counter~0 4)} ~cond := #in~cond; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {7608#(<= ~counter~0 4)} assume !(0 == ~cond); {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {7608#(<= ~counter~0 4)} assume true; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,803 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7608#(<= ~counter~0 4)} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {7608#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {7608#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7633#(<= |main_#t~post7| 4)} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L272 TraceCheckUtils]: 55: Hoare triple {7477#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)); {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-28 12:38:24,804 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-28 12:38:24,805 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 12:38:24,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:38:25,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L272 TraceCheckUtils]: 55: Hoare triple {7477#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)); {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-28 12:38:25,052 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-28 12:38:25,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-28 12:38:25,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {7608#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7633#(<= |main_#t~post7| 4)} is VALID [2022-04-28 12:38:25,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {7608#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:25,062 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7476#true} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:25,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 12:38:25,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 12:38:25,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 12:38:25,063 INFO L272 TraceCheckUtils]: 43: Hoare triple {7608#(<= ~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)); {7476#true} is VALID [2022-04-28 12:38:25,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {7608#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:25,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {7583#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7608#(<= ~counter~0 4)} is VALID [2022-04-28 12:38:25,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {7583#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:25,064 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7476#true} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:25,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 12:38:25,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 12:38:25,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 12:38:25,064 INFO L272 TraceCheckUtils]: 35: Hoare triple {7583#(<= ~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)); {7476#true} is VALID [2022-04-28 12:38:25,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {7583#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:25,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {7558#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7583#(<= ~counter~0 3)} is VALID [2022-04-28 12:38:25,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {7558#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:25,065 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7476#true} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:25,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 12:38:25,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 12:38:25,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 12:38:25,065 INFO L272 TraceCheckUtils]: 27: Hoare triple {7558#(<= ~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)); {7476#true} is VALID [2022-04-28 12:38:25,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {7558#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:25,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {7533#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7558#(<= ~counter~0 2)} is VALID [2022-04-28 12:38:25,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:25,067 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7476#true} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:25,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 12:38:25,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 12:38:25,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 12:38:25,067 INFO L272 TraceCheckUtils]: 19: Hoare triple {7533#(<= ~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)); {7476#true} is VALID [2022-04-28 12:38:25,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {7533#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:25,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {7484#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7533#(<= ~counter~0 1)} is VALID [2022-04-28 12:38:25,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {7484#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 12:38:25,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 12:38:25,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 12:38:25,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {7484#(<= ~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)); {7476#true} is VALID [2022-04-28 12:38:25,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-28 12:38:25,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-28 12:38:25,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-28 12:38:25,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {7484#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7476#true} is VALID [2022-04-28 12:38:25,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {7484#(<= ~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; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {7476#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; {7484#(<= ~counter~0 0)} is VALID [2022-04-28 12:38:25,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-28 12:38:25,070 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 12:38:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:38:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405666152] [2022-04-28 12:38:25,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:38:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81491077] [2022-04-28 12:38:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81491077] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:38:25,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:38:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 12:38:25,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:38:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711373155] [2022-04-28 12:38:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711373155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:38:25,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:38:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:38:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804688436] [2022-04-28 12:38:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:38:25,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 12:38:25,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:38:25,072 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 12:38:25,098 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 12:38:25,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:38:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:25,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:38:25,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:38:25,099 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 12:38:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:25,334 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-28 12:38:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 12:38:25,334 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 12:38:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:38:25,335 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 12:38:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 12:38:25,337 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 12:38:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-28 12:38:25,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-28 12:38:25,415 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 12:38:25,416 INFO L225 Difference]: With dead ends: 133 [2022-04-28 12:38:25,416 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 12:38:25,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:38:25,419 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 12:38:25,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 163 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 12:38:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 12:38:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 12:38:25,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:38:25,491 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 12:38:25,491 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 12:38:25,491 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 12:38:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:25,494 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 12:38:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 12:38:25,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:25,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:25,495 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 12:38:25,495 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 12:38:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:38:25,496 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 12:38:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 12:38:25,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:38:25,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:38:25,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:38:25,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:38:25,497 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 12:38:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-28 12:38:25,498 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-28 12:38:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:38:25,498 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-28 12:38:25,498 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 12:38:25,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-28 12:38:27,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 117 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 12:38:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 12:38:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 12:38:27,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:38:27,630 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 12:38:27,634 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 12:38:27,831 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 12:38:27,831 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:38:27,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:38:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-28 12:38:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:38:27,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [237911639] [2022-04-28 12:38:27,832 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:38:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-28 12:38:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:38:27,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368501527] [2022-04-28 12:38:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:38:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:38:27,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:38:27,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361898206] [2022-04-28 12:38:27,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:38:27,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:38:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:38:27,850 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 12:38:27,850 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 12:38:27,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:38:27,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 12:38:27,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 12:38:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 12:38:27,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 12:38:27,959 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 12:38:27,959 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 12:38:27,964 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:38:27,989 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 12:38:28,187 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 12:38:28,193 INFO L356 BasicCegarLoop]: Path program histogram: [6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 12:38:28,199 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 12:38:28,210 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 12:38:28,211 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 12:38:28,212 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 12:38:28,212 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 12:38:28,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:38:28 BoogieIcfgContainer [2022-04-28 12:38:28,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:38:28,214 INFO L158 Benchmark]: Toolchain (without parser) took 59449.16ms. Allocated memory was 215.0MB in the beginning and 311.4MB in the end (delta: 96.5MB). Free memory was 162.7MB in the beginning and 168.9MB in the end (delta: -6.2MB). Peak memory consumption was 91.5MB. Max. memory is 8.0GB. [2022-04-28 12:38:28,214 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory was 178.7MB in the beginning and 178.7MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:38:28,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.07ms. Allocated memory was 215.0MB in the beginning and 311.4MB in the end (delta: 96.5MB). Free memory was 162.4MB in the beginning and 282.0MB in the end (delta: -119.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-28 12:38:28,214 INFO L158 Benchmark]: Boogie Preprocessor took 32.85ms. Allocated memory is still 311.4MB. Free memory was 282.0MB in the beginning and 280.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 12:38:28,214 INFO L158 Benchmark]: RCFGBuilder took 268.34ms. Allocated memory is still 311.4MB. Free memory was 280.3MB in the beginning and 268.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 12:38:28,215 INFO L158 Benchmark]: TraceAbstraction took 58913.95ms. Allocated memory is still 311.4MB. Free memory was 267.5MB in the beginning and 168.9MB in the end (delta: 98.6MB). Peak memory consumption was 98.9MB. Max. memory is 8.0GB. [2022-04-28 12:38:28,215 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory was 178.7MB in the beginning and 178.7MB in the end (delta: 74.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.07ms. Allocated memory was 215.0MB in the beginning and 311.4MB in the end (delta: 96.5MB). Free memory was 162.4MB in the beginning and 282.0MB in the end (delta: -119.6MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.85ms. Allocated memory is still 311.4MB. Free memory was 282.0MB in the beginning and 280.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.34ms. Allocated memory is still 311.4MB. Free memory was 280.3MB in the beginning and 268.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 58913.95ms. Allocated memory is still 311.4MB. Free memory was 267.5MB in the beginning and 168.9MB in the end (delta: 98.6MB). Peak memory consumption was 98.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++<5 [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++<5 [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++<5 [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++<5 [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++<5 [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++<5) [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: 58.9s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 1598 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1071 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 527 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 833 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 33 StatesRemovedByMinimization, 7 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 12:38:28,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...