/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-e106359-m [2022-04-15 15:11:06,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:11:06,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:11:06,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:11:06,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:11:06,064 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:11:06,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:11:06,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:11:06,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:11:06,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:11:06,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:11:06,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:11:06,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:11:06,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:11:06,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:11:06,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:11:06,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:11:06,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:11:06,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:11:06,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:11:06,086 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:11:06,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:11:06,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:11:06,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:11:06,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:11:06,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:11:06,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:11:06,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:11:06,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:11:06,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:11:06,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:11:06,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:11:06,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:11:06,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:11:06,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:11:06,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:11:06,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:11:06,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:11:06,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:11:06,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:11:06,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:11:06,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:11:06,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:11:06,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:11:06,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:11:06,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:11:06,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:11:06,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:11:06,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:11:06,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:11:06,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:11:06,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:11:06,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:11:06,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:11:06,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:11:06,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:11:06,116 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:11:06,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:11:06,117 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:11:06,117 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 15:11:06,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:11:06,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:11:06,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:11:06,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:11:06,322 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:11:06,323 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-15 15:11:06,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa786193/e24b178edfaa4de9b54dbbad8f057a7d/FLAGe42353f15 [2022-04-15 15:11:06,763 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:11:06,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound5.c [2022-04-15 15:11:06,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa786193/e24b178edfaa4de9b54dbbad8f057a7d/FLAGe42353f15 [2022-04-15 15:11:06,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa786193/e24b178edfaa4de9b54dbbad8f057a7d [2022-04-15 15:11:06,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:11:06,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:11:06,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:11:06,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:11:06,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:11:06,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:06" (1/1) ... [2022-04-15 15:11:06,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3d3a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:06, skipping insertion in model container [2022-04-15 15:11:06,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:11:06" (1/1) ... [2022-04-15 15:11:06,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:11:06,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:11:06,960 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-15 15:11:07,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:11:07,006 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:11:07,013 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-15 15:11:07,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:11:07,031 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:11:07,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07 WrapperNode [2022-04-15 15:11:07,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:11:07,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:11:07,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:11:07,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:11:07,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:11:07,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:11:07,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:11:07,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:11:07,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (1/1) ... [2022-04-15 15:11:07,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:11:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:07,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 15:11:07,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 15:11:07,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:11:07,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:11:07,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:11:07,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:11:07,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:11:07,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:11:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:11:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:11:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:11:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:11:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 15:11:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:11:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:11:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:11:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:11:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:11:07,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:11:07,180 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:11:07,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:11:07,357 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:11:07,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:11:07,362 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 15:11:07,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:07 BoogieIcfgContainer [2022-04-15 15:11:07,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:11:07,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:11:07,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:11:07,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:11:07,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:11:06" (1/3) ... [2022-04-15 15:11:07,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260c4b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:07, skipping insertion in model container [2022-04-15 15:11:07,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:11:07" (2/3) ... [2022-04-15 15:11:07,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260c4b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:11:07, skipping insertion in model container [2022-04-15 15:11:07,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:11:07" (3/3) ... [2022-04-15 15:11:07,369 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound5.c [2022-04-15 15:11:07,372 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:11:07,372 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:11:07,405 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:11:07,409 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 15:11:07,410 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:11:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 15:11:07,427 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:07,428 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:07,428 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 15:11:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:07,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705162577] [2022-04-15 15:11:07,452 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 15:11:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:07,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880063860] [2022-04-15 15:11:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:07,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:07,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245841957] [2022-04-15 15:11:07,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:07,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 15:11:07,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:07,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:07,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 15:11:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:07,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:07,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 15:11:07,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 15:11:07,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:11:07,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 15:11:07,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 15:11:07,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-15 15:11:07,719 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-15 15:11:07,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:11:07,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 15:11:07,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:11:07,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 15:11:07,720 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {40#true} is VALID [2022-04-15 15:11:07,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:11:07,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 15:11:07,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 15:11:07,721 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 15:11:07,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-15 15:11:07,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 15:11:07,723 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41#false} is VALID [2022-04-15 15:11:07,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 15:11:07,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 15:11:07,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 15:11:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 15:11:07,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:07,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880063860] [2022-04-15 15:11:07,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:07,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245841957] [2022-04-15 15:11:07,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245841957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:07,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:07,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:11:07,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:07,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705162577] [2022-04-15 15:11:07,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705162577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:07,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:07,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:11:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282033772] [2022-04-15 15:11:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:07,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 15:11:07,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:07,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:07,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:07,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 15:11:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:07,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 15:11:07,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 15:11:07,781 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:07,842 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 15:11:07,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 15:11:07,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-15 15:11:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:11:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:11:07,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 15:11:07,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:07,984 INFO L225 Difference]: With dead ends: 67 [2022-04-15 15:11:07,984 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 15:11:07,986 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 15:11:07,990 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:07,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 15:11:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 15:11:08,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:08,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,018 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,018 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,021 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:11:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:08,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:08,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:08,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 15:11:08,022 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 15:11:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,025 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:11:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:08,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:08,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:08,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:08,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 15:11:08,029 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 15:11:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:08,029 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 15:11:08,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:08,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 15:11:08,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:11:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:11:08,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:08,066 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:08,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:08,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 15:11:08,280 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 15:11:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:08,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1216309456] [2022-04-15 15:11:08,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 15:11:08,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:08,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368811688] [2022-04-15 15:11:08,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:08,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:08,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:08,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060561573] [2022-04-15 15:11:08,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:08,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:08,301 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:08,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 15:11:08,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:08,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:08,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:11:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:08,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:08,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 15:11:08,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,633 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,635 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:08,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-15 15:11:08,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {370#false} is VALID [2022-04-15 15:11:08,637 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {370#false} is VALID [2022-04-15 15:11:08,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 15:11:08,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 15:11:08,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 15:11:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:08,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:08,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368811688] [2022-04-15 15:11:08,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:08,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060561573] [2022-04-15 15:11:08,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060561573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:08,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:08,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:08,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:08,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1216309456] [2022-04-15 15:11:08,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1216309456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:08,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:08,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401092323] [2022-04-15 15:11:08,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 15:11:08,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:08,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:08,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:08,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:08,660 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,751 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 15:11:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 15:11:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:11:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:11:08,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 15:11:08,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:08,792 INFO L225 Difference]: With dead ends: 41 [2022-04-15 15:11:08,792 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 15:11:08,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:08,793 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:08,794 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 15:11:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 15:11:08,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:08,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,807 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,807 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,809 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:11:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:08,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:08,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:08,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 15:11:08,810 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 15:11:08,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,812 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:11:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:08,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:08,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:08,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:08,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 15:11:08,815 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 15:11:08,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:08,816 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 15:11:08,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:11:08,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 15:11:08,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:11:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:11:08,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:08,860 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:08,884 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-15 15:11:09,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-15 15:11:09,080 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 15:11:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:09,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227405873] [2022-04-15 15:11:09,081 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 15:11:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:09,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518774097] [2022-04-15 15:11:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:09,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:09,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308515929] [2022-04-15 15:11:09,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:09,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:09,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:09,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:09,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 15:11:09,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:11:09,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:09,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:09,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:12,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 15:11:12,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {659#true} is VALID [2022-04-15 15:11:12,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:12,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 15:11:12,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 15:11:12,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {659#true} is VALID [2022-04-15 15:11:12,236 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-15 15:11:12,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:11:12,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:11:12,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:12,237 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 15:11:12,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {659#true} is VALID [2022-04-15 15:11:12,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:11:12,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:11:12,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:11:12,238 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 15:11:14,239 WARN L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-15 15:11:14,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-15 15:11:14,241 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-15 15:11:16,198 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:16,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:16,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 15:11:16,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 15:11:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:16,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:16,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518774097] [2022-04-15 15:11:16,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:16,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308515929] [2022-04-15 15:11:16,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308515929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:16,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:16,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:16,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:16,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227405873] [2022-04-15 15:11:16,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227405873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:16,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:16,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737036266] [2022-04-15 15:11:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 15:11:16,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:16,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:18,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:18,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:11:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:18,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:11:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:18,768 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:20,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:22,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:29,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:31,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:11:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:31,936 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 15:11:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:11:31,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 15:11:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:11:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:11:31,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 15:11:33,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:33,807 INFO L225 Difference]: With dead ends: 53 [2022-04-15 15:11:33,807 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 15:11:33,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:11:33,808 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:33,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2022-04-15 15:11:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 15:11:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 15:11:33,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:33,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:33,825 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:33,825 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:33,827 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:11:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:11:33,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:33,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:33,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 15:11:33,828 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 15:11:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:33,830 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:11:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:11:33,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:33,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:33,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:33,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 15:11:33,833 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 15:11:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:33,833 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 15:11:33,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 15:11:33,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 15:11:37,488 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-15 15:11:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 15:11:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 15:11:37,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:37,489 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:37,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:37,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:37,697 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 15:11:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723493027] [2022-04-15 15:11:37,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 15:11:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:37,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064685906] [2022-04-15 15:11:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:37,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [647292044] [2022-04-15 15:11:37,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:37,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:37,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:37,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:37,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 15:11:37,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:37,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:37,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:11:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:37,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:37,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:11:37,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-15 15:11:37,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:37,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:11:37,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:11:37,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:11:37,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:37,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:37,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:37,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:37,922 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-15 15:11:37,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 15:11:37,923 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:37,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:37,924 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:11:37,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:11:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:37,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:38,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:11:38,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:11:38,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:38,280 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:38,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {1122#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-15 15:11:38,281 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-15 15:11:38,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:38,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:38,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:11:38,292 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:38,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 5);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:11:38,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:11:38,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 15:11:38,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:11:38,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:38,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:11:38,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:11:38,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:38,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1042#true} is VALID [2022-04-15 15:11:38,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:11:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:38,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064685906] [2022-04-15 15:11:38,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:38,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647292044] [2022-04-15 15:11:38,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647292044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:38,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:38,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 15:11:38,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:38,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723493027] [2022-04-15 15:11:38,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723493027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:38,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:38,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474544823] [2022-04-15 15:11:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:38,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 15:11:38,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:38,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:38,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:38,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:38,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:38,319 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:38,642 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 15:11:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:11:38,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 15:11:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:11:38,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:11:38,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 15:11:38,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:38,696 INFO L225 Difference]: With dead ends: 57 [2022-04-15 15:11:38,697 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 15:11:38,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 15:11:38,700 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:38,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 15:11:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-15 15:11:38,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:38,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:38,722 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:38,722 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:38,731 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:11:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:38,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:38,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:38,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-15 15:11:38,735 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 52 states. [2022-04-15 15:11:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:38,741 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:11:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:38,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:38,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:38,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:38,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:11:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-15 15:11:38,743 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-15 15:11:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:38,744 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-15 15:11:38,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 15:11:38,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-15 15:11:39,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-15 15:11:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 15:11:39,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:39,797 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:39,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 15:11:40,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:40,011 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 15:11:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:40,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1898393172] [2022-04-15 15:11:40,012 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 15:11:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:40,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656605637] [2022-04-15 15:11:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:40,027 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:40,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202148324] [2022-04-15 15:11:40,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:40,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:40,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 15:11:40,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:40,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:40,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:11:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:40,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:40,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1521#true} call ULTIMATE.init(); {1521#true} is VALID [2022-04-15 15:11:40,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#(<= ~counter~0 0)} {1521#true} #102#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#(<= ~counter~0 0)} call #t~ret9 := main(); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #90#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,353 INFO L272 TraceCheckUtils]: 11: Hoare triple {1529#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {1529#(<= ~counter~0 0)} ~cond := #in~cond; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {1529#(<= ~counter~0 0)} assume !(0 == ~cond); {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#(<= ~counter~0 0)} assume true; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,354 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1529#(<= ~counter~0 0)} {1529#(<= ~counter~0 0)} #92#return; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1529#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {1529#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,355 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-15 15:11:40,356 INFO L272 TraceCheckUtils]: 19: Hoare triple {1578#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {1578#(<= ~counter~0 1)} ~cond := #in~cond; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {1578#(<= ~counter~0 1)} assume !(0 == ~cond); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {1578#(<= ~counter~0 1)} assume true; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,357 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1578#(<= ~counter~0 1)} {1578#(<= ~counter~0 1)} #94#return; {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {1578#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1578#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {1578#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(<= |main_#t~post7| 1)} is VALID [2022-04-15 15:11:40,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1522#false} is VALID [2022-04-15 15:11:40,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {1522#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1522#false} is VALID [2022-04-15 15:11:40,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {1522#false} assume !(#t~post8 < 5);havoc #t~post8; {1522#false} is VALID [2022-04-15 15:11:40,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {1522#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1522#false} is VALID [2022-04-15 15:11:40,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {1522#false} assume !(#t~post6 < 5);havoc #t~post6; {1522#false} is VALID [2022-04-15 15:11:40,359 INFO L272 TraceCheckUtils]: 31: Hoare triple {1522#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1522#false} is VALID [2022-04-15 15:11:40,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {1522#false} ~cond := #in~cond; {1522#false} is VALID [2022-04-15 15:11:40,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {1522#false} assume 0 == ~cond; {1522#false} is VALID [2022-04-15 15:11:40,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {1522#false} assume !false; {1522#false} is VALID [2022-04-15 15:11:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:40,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656605637] [2022-04-15 15:11:40,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202148324] [2022-04-15 15:11:40,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202148324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:40,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:40,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:40,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:40,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1898393172] [2022-04-15 15:11:40,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1898393172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:40,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:40,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793073380] [2022-04-15 15:11:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 15:11:40,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:40,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:40,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:40,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:11:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:11:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:40,384 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:40,497 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 15:11:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:11:40,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 15:11:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:11:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:11:40,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 15:11:40,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:40,558 INFO L225 Difference]: With dead ends: 65 [2022-04-15 15:11:40,558 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 15:11:40,558 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:40,558 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:40,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 15:11:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 15:11:40,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:40,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:11:40,583 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:11:40,583 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:11:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:40,584 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 15:11:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 15:11:40,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:40,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:40,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 15:11:40,585 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 15:11:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:40,586 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 15:11:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 15:11:40,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:40,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:40,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:40,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 15:11:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-15 15:11:40,588 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-15 15:11:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:40,588 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-15 15:11:40,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 15:11:40,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2022-04-15 15:11:42,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-15 15:11:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 15:11:42,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:42,645 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:42,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:42,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:42,846 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 15:11:42,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:42,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269364673] [2022-04-15 15:11:42,847 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 15:11:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:42,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120912883] [2022-04-15 15:11:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:42,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:42,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678135935] [2022-04-15 15:11:42,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:42,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:42,862 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:42,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 15:11:42,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:42,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:42,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:11:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:42,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:43,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-15 15:11:43,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {1936#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1944#(<= ~counter~0 0)} {1936#true} #102#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {1944#(<= ~counter~0 0)} call #t~ret9 := main(); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {1944#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #90#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,073 INFO L272 TraceCheckUtils]: 11: Hoare triple {1944#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {1944#(<= ~counter~0 0)} ~cond := #in~cond; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {1944#(<= ~counter~0 0)} assume !(0 == ~cond); {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {1944#(<= ~counter~0 0)} assume true; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,074 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1944#(<= ~counter~0 0)} {1944#(<= ~counter~0 0)} #92#return; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {1944#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1944#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:43,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {1944#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,076 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-15 15:11:43,076 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} ~cond := #in~cond; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} assume !(0 == ~cond); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} assume true; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} #94#return; {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1993#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:43,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,081 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-15 15:11:43,081 INFO L272 TraceCheckUtils]: 27: Hoare triple {2018#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(<= ~counter~0 2)} ~cond := #in~cond; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {2018#(<= ~counter~0 2)} assume !(0 == ~cond); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,083 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2018#(<= ~counter~0 2)} {2018#(<= ~counter~0 2)} #96#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {2018#(<= ~counter~0 2)} assume !(~r~0 > 0); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {2018#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2043#(<= |main_#t~post8| 2)} is VALID [2022-04-15 15:11:43,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {2043#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-15 15:11:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:43,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:43,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {1937#false} assume !false; {1937#false} is VALID [2022-04-15 15:11:43,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#false} assume 0 == ~cond; {1937#false} is VALID [2022-04-15 15:11:43,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {1937#false} ~cond := #in~cond; {1937#false} is VALID [2022-04-15 15:11:43,292 INFO L272 TraceCheckUtils]: 37: Hoare triple {1937#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1937#false} is VALID [2022-04-15 15:11:43,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {1937#false} assume !(#t~post6 < 5);havoc #t~post6; {1937#false} is VALID [2022-04-15 15:11:43,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {1937#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1937#false} is VALID [2022-04-15 15:11:43,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {2083#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {1937#false} is VALID [2022-04-15 15:11:43,294 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-15 15:11:43,294 INFO L290 TraceCheckUtils]: 32: Hoare triple {2087#(< ~counter~0 5)} assume !(~r~0 > 0); {2087#(< ~counter~0 5)} is VALID [2022-04-15 15:11:43,295 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1936#true} {2087#(< ~counter~0 5)} #96#return; {2087#(< ~counter~0 5)} is VALID [2022-04-15 15:11:43,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 15:11:43,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 15:11:43,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 15:11:43,295 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-15 15:11:43,295 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-15 15:11:43,296 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-15 15:11:43,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {2112#(< ~counter~0 4)} assume !!(0 != ~r~0); {2112#(< ~counter~0 4)} is VALID [2022-04-15 15:11:43,296 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1936#true} {2112#(< ~counter~0 4)} #94#return; {2112#(< ~counter~0 4)} is VALID [2022-04-15 15:11:43,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 15:11:43,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 15:11:43,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 15:11:43,297 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-15 15:11:43,299 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-15 15:11:43,299 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-15 15:11:43,299 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-15 15:11:43,300 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #92#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 15:11:43,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 15:11:43,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 15:11:43,300 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-15 15:11:43,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#true} {2018#(<= ~counter~0 2)} #90#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#true} assume true; {1936#true} is VALID [2022-04-15 15:11:43,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1936#true} assume !(0 == ~cond); {1936#true} is VALID [2022-04-15 15:11:43,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {1936#true} ~cond := #in~cond; {1936#true} is VALID [2022-04-15 15:11:43,301 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-15 15:11:43,301 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-15 15:11:43,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {2018#(<= ~counter~0 2)} call #t~ret9 := main(); {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2018#(<= ~counter~0 2)} {1936#true} #102#return; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(<= ~counter~0 2)} assume true; {2018#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:43,303 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-15 15:11:43,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1936#true} call ULTIMATE.init(); {1936#true} is VALID [2022-04-15 15:11:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 15:11:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120912883] [2022-04-15 15:11:43,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678135935] [2022-04-15 15:11:43,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678135935] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 15:11:43,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:11:43,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-04-15 15:11:43,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269364673] [2022-04-15 15:11:43,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269364673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:43,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:43,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:11:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135578038] [2022-04-15 15:11:43,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:43,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 15:11:43,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:43,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:43,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:43,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:11:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:11:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 15:11:43,335 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:43,493 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-15 15:11:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:11:43,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 15:11:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:11:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:11:43,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 15:11:43,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:43,555 INFO L225 Difference]: With dead ends: 74 [2022-04-15 15:11:43,555 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 15:11:43,556 INFO L912 BasicCegarLoop]: 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-15 15:11:43,556 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:43,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 15:11:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 15:11:43,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:43,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:43,606 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:43,606 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:43,620 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 15:11:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 15:11:43,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:43,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:43,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 15:11:43,621 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 15:11:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:43,623 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 15:11:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 15:11:43,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:43,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:43,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:43,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-15 15:11:43,624 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-15 15:11:43,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:43,624 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-15 15:11:43,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:43,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 60 transitions. [2022-04-15 15:11:44,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-15 15:11:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 15:11:44,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:44,843 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:44,859 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-15 15:11:45,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:45,043 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 15:11:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144542010] [2022-04-15 15:11:45,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 15:11:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:45,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079951842] [2022-04-15 15:11:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:45,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:45,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945470001] [2022-04-15 15:11:45,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:45,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:45,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:45,073 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:45,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 15:11:45,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:45,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:45,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:11:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:45,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:45,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-15 15:11:45,327 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-15 15:11:45,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2556#(<= ~counter~0 0)} {2548#true} #102#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {2556#(<= ~counter~0 0)} call #t~ret9 := main(); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,331 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-15 15:11:45,331 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-15 15:11:45,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #90#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,333 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-15 15:11:45,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2556#(<= ~counter~0 0)} ~cond := #in~cond; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= ~counter~0 0)} assume !(0 == ~cond); {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {2556#(<= ~counter~0 0)} assume true; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,340 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2556#(<= ~counter~0 0)} {2556#(<= ~counter~0 0)} #92#return; {2556#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:45,340 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-15 15:11:45,341 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-15 15:11:45,341 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-15 15:11:45,341 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-15 15:11:45,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {2605#(<= ~counter~0 1)} ~cond := #in~cond; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:45,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= ~counter~0 1)} assume !(0 == ~cond); {2605#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:45,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {2605#(<= ~counter~0 1)} assume true; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:45,343 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2605#(<= ~counter~0 1)} {2605#(<= ~counter~0 1)} #94#return; {2605#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:45,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {2605#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2605#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:45,343 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-15 15:11:45,344 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-15 15:11:45,344 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-15 15:11:45,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {2630#(<= ~counter~0 2)} ~cond := #in~cond; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {2630#(<= ~counter~0 2)} assume !(0 == ~cond); {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,345 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2630#(<= ~counter~0 2)} {2630#(<= ~counter~0 2)} #96#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,346 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-15 15:11:45,346 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-15 15:11:45,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {2655#(<= |main_#t~post7| 2)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-15 15:11:45,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-15 15:11:45,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-15 15:11:45,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-15 15:11:45,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-15 15:11:45,347 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-15 15:11:45,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-15 15:11:45,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-15 15:11:45,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-15 15:11:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:45,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:45,555 INFO L290 TraceCheckUtils]: 42: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-15 15:11:45,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-15 15:11:45,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-15 15:11:45,555 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-15 15:11:45,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {2549#false} assume !(#t~post6 < 5);havoc #t~post6; {2549#false} is VALID [2022-04-15 15:11:45,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {2549#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2549#false} is VALID [2022-04-15 15:11:45,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {2549#false} assume !(#t~post8 < 5);havoc #t~post8; {2549#false} is VALID [2022-04-15 15:11:45,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {2549#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2549#false} is VALID [2022-04-15 15:11:45,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {2707#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {2549#false} is VALID [2022-04-15 15:11:45,556 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-15 15:11:45,556 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-15 15:11:45,557 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2711#(< ~counter~0 5)} #96#return; {2711#(< ~counter~0 5)} is VALID [2022-04-15 15:11:45,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 15:11:45,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 15:11:45,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 15:11:45,560 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-15 15:11:45,560 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-15 15:11:45,561 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-15 15:11:45,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {2736#(< ~counter~0 4)} assume !!(0 != ~r~0); {2736#(< ~counter~0 4)} is VALID [2022-04-15 15:11:45,562 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2736#(< ~counter~0 4)} #94#return; {2736#(< ~counter~0 4)} is VALID [2022-04-15 15:11:45,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 15:11:45,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 15:11:45,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 15:11:45,562 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-15 15:11:45,562 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-15 15:11:45,563 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-15 15:11:45,563 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-15 15:11:45,563 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #92#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 15:11:45,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 15:11:45,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 15:11:45,564 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-15 15:11:45,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2548#true} {2630#(<= ~counter~0 2)} #90#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 15:11:45,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 15:11:45,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 15:11:45,564 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-15 15:11:45,565 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-15 15:11:45,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {2630#(<= ~counter~0 2)} call #t~ret9 := main(); {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2630#(<= ~counter~0 2)} {2548#true} #102#return; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2630#(<= ~counter~0 2)} assume true; {2630#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:45,566 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-15 15:11:45,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-15 15:11:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 15:11:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079951842] [2022-04-15 15:11:45,567 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945470001] [2022-04-15 15:11:45,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945470001] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:45,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:45,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 15:11:45,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144542010] [2022-04-15 15:11:45,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144542010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:45,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:45,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:11:45,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324118701] [2022-04-15 15:11:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-15 15:11:45,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:45,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:45,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:45,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:11:45,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:45,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:11:45,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 15:11:45,597 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,792 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2022-04-15 15:11:45,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:11:45,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2022-04-15 15:11:45,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:11:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:11:45,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 15:11:45,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:45,852 INFO L225 Difference]: With dead ends: 75 [2022-04-15 15:11:45,852 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 15:11:45,852 INFO L912 BasicCegarLoop]: 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-15 15:11:45,852 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:45,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 15:11:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 15:11:45,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:45,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:45,898 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:45,898 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,899 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 15:11:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 15:11:45,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:45,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:45,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 15:11:45,901 INFO L87 Difference]: Start difference. First operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 15:11:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,902 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 15:11:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 15:11:45,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:45,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:45,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:45,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:11:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-04-15 15:11:45,904 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-04-15 15:11:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:45,904 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-04-15 15:11:45,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:45,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 62 transitions. [2022-04-15 15:11:47,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 15:11:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:11:47,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:47,336 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:47,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:47,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:47,537 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:47,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 15:11:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:47,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602103319] [2022-04-15 15:11:47,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:47,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 15:11:47,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:47,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448032476] [2022-04-15 15:11:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:47,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:47,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416835028] [2022-04-15 15:11:47,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:47,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:47,553 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:47,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 15:11:47,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:47,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:47,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:11:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:47,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:47,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3182#true} is VALID [2022-04-15 15:11:47,752 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-15 15:11:47,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 15:11:47,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #102#return; {3182#true} is VALID [2022-04-15 15:11:47,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret9 := main(); {3182#true} is VALID [2022-04-15 15:11:47,752 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-15 15:11:47,752 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-15 15:11:47,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 15:11:47,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 15:11:47,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 15:11:47,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3182#true} {3182#true} #90#return; {3182#true} is VALID [2022-04-15 15:11:47,752 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-15 15:11:47,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 15:11:47,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 15:11:47,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 15:11:47,753 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3182#true} {3182#true} #92#return; {3182#true} is VALID [2022-04-15 15:11:47,753 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-15 15:11:47,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {3182#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3182#true} is VALID [2022-04-15 15:11:47,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {3182#true} assume !!(#t~post6 < 5);havoc #t~post6; {3182#true} is VALID [2022-04-15 15:11:47,753 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-15 15:11:47,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 15:11:47,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 15:11:47,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 15:11:47,753 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3182#true} {3182#true} #94#return; {3182#true} is VALID [2022-04-15 15:11:47,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {3182#true} assume !!(0 != ~r~0); {3259#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:47,755 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-15 15:11:47,755 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-15 15:11:47,755 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-15 15:11:47,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 15:11:47,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 15:11:47,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 15:11:47,756 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-15 15:11:47,756 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-15 15:11:47,756 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-15 15:11:47,757 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-15 15:11:47,757 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-15 15:11:47,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2022-04-15 15:11:47,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2022-04-15 15:11:47,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-15 15:11:47,757 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-15 15:11:47,758 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-15 15:11:47,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {3183#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3183#false} is VALID [2022-04-15 15:11:47,758 INFO L290 TraceCheckUtils]: 42: Hoare triple {3183#false} assume !(#t~post6 < 5);havoc #t~post6; {3183#false} is VALID [2022-04-15 15:11:47,758 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-15 15:11:47,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {3183#false} ~cond := #in~cond; {3183#false} is VALID [2022-04-15 15:11:47,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {3183#false} assume 0 == ~cond; {3183#false} is VALID [2022-04-15 15:11:47,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-15 15:11:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:47,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448032476] [2022-04-15 15:11:47,759 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416835028] [2022-04-15 15:11:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416835028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:47,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:47,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:47,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602103319] [2022-04-15 15:11:47,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602103319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:47,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:47,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989676244] [2022-04-15 15:11:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:47,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:11:47,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:47,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:47,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:47,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:47,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:47,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:47,790 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:47,975 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-15 15:11:47,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:47,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:11:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:11:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:11:47,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 15:11:48,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:48,060 INFO L225 Difference]: With dead ends: 101 [2022-04-15 15:11:48,060 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 15:11:48,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:48,060 INFO L913 BasicCegarLoop]: 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-15 15:11:48,060 INFO L914 BasicCegarLoop]: 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-15 15:11:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 15:11:48,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-04-15 15:11:48,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:48,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:11:48,113 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:11:48,113 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:11:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:48,115 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 15:11:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 15:11:48,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:48,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:48,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-15 15:11:48,116 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 80 states. [2022-04-15 15:11:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:48,118 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-15 15:11:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-15 15:11:48,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:48,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:48,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:48,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 14 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:11:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-15 15:11:48,120 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 47 [2022-04-15 15:11:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:48,120 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-15 15:11:48,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:48,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 87 transitions. [2022-04-15 15:11:49,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-15 15:11:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 15:11:49,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:49,704 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:49,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:49,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 15:11:49,905 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 15:11:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:49,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649990507] [2022-04-15 15:11:49,905 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 15:11:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:49,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313193468] [2022-04-15 15:11:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:49,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:49,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558446877] [2022-04-15 15:11:49,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:49,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:49,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:49,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 15:11:49,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:49,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:49,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:11:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:49,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:50,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-15 15:11:50,199 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-15 15:11:50,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3836#(<= ~counter~0 0)} {3828#true} #102#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {3836#(<= ~counter~0 0)} call #t~ret9 := main(); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,201 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-15 15:11:50,201 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-15 15:11:50,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #90#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,203 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-15 15:11:50,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {3836#(<= ~counter~0 0)} ~cond := #in~cond; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {3836#(<= ~counter~0 0)} assume !(0 == ~cond); {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {3836#(<= ~counter~0 0)} assume true; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,204 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3836#(<= ~counter~0 0)} {3836#(<= ~counter~0 0)} #92#return; {3836#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:50,204 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-15 15:11:50,205 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-15 15:11:50,205 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-15 15:11:50,206 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-15 15:11:50,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {3885#(<= ~counter~0 1)} ~cond := #in~cond; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {3885#(<= ~counter~0 1)} assume !(0 == ~cond); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,207 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3885#(<= ~counter~0 1)} {3885#(<= ~counter~0 1)} #94#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {3885#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,208 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-15 15:11:50,208 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-15 15:11:50,208 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-15 15:11:50,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {3910#(<= ~counter~0 2)} ~cond := #in~cond; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {3910#(<= ~counter~0 2)} assume !(0 == ~cond); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {3910#(<= ~counter~0 2)} assume true; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,210 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3910#(<= ~counter~0 2)} {3910#(<= ~counter~0 2)} #96#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {3910#(<= ~counter~0 2)} assume !(~r~0 > 0); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,211 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-15 15:11:50,211 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-15 15:11:50,211 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-15 15:11:50,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {3935#(<= ~counter~0 3)} ~cond := #in~cond; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:50,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {3935#(<= ~counter~0 3)} assume !(0 == ~cond); {3935#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:50,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {3935#(<= ~counter~0 3)} assume true; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:50,212 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3935#(<= ~counter~0 3)} {3935#(<= ~counter~0 3)} #98#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:50,213 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-15 15:11:50,213 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-15 15:11:50,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {3960#(<= |main_#t~post8| 3)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-15 15:11:50,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-15 15:11:50,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-15 15:11:50,214 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-15 15:11:50,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-15 15:11:50,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-15 15:11:50,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-15 15:11:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:50,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:50,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {3829#false} assume !false; {3829#false} is VALID [2022-04-15 15:11:50,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {3829#false} assume 0 == ~cond; {3829#false} is VALID [2022-04-15 15:11:50,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {3829#false} ~cond := #in~cond; {3829#false} is VALID [2022-04-15 15:11:50,428 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-15 15:11:50,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {3829#false} assume !(#t~post6 < 5);havoc #t~post6; {3829#false} is VALID [2022-04-15 15:11:50,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {3829#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3829#false} is VALID [2022-04-15 15:11:50,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {4000#(< |main_#t~post8| 5)} assume !(#t~post8 < 5);havoc #t~post8; {3829#false} is VALID [2022-04-15 15:11:50,429 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-15 15:11:50,429 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-15 15:11:50,429 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3828#true} {4004#(< ~counter~0 5)} #98#return; {4004#(< ~counter~0 5)} is VALID [2022-04-15 15:11:50,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 15:11:50,430 INFO L290 TraceCheckUtils]: 37: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 15:11:50,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 15:11:50,430 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-15 15:11:50,430 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-15 15:11:50,430 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-15 15:11:50,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {3935#(<= ~counter~0 3)} assume !(~r~0 > 0); {3935#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:50,431 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3828#true} {3935#(<= ~counter~0 3)} #96#return; {3935#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:50,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 15:11:50,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 15:11:50,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 15:11:50,431 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-15 15:11:50,432 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-15 15:11:50,432 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-15 15:11:50,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {3910#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,433 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3828#true} {3910#(<= ~counter~0 2)} #94#return; {3910#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:50,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 15:11:50,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 15:11:50,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 15:11:50,433 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-15 15:11:50,433 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-15 15:11:50,434 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-15 15:11:50,434 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-15 15:11:50,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #92#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 15:11:50,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 15:11:50,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 15:11:50,435 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-15 15:11:50,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3828#true} {3885#(<= ~counter~0 1)} #90#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {3828#true} assume true; {3828#true} is VALID [2022-04-15 15:11:50,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {3828#true} assume !(0 == ~cond); {3828#true} is VALID [2022-04-15 15:11:50,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {3828#true} ~cond := #in~cond; {3828#true} is VALID [2022-04-15 15:11:50,435 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-15 15:11:50,436 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-15 15:11:50,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {3885#(<= ~counter~0 1)} call #t~ret9 := main(); {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3885#(<= ~counter~0 1)} {3828#true} #102#return; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {3885#(<= ~counter~0 1)} assume true; {3885#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:50,437 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-15 15:11:50,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {3828#true} call ULTIMATE.init(); {3828#true} is VALID [2022-04-15 15:11:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:50,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313193468] [2022-04-15 15:11:50,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:50,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558446877] [2022-04-15 15:11:50,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558446877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:50,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:50,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 15:11:50,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:50,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649990507] [2022-04-15 15:11:50,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649990507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:50,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:50,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:11:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842176551] [2022-04-15 15:11:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:50,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-15 15:11:50,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:50,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:50,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:50,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:11:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:11:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 15:11:50,491 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:50,711 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2022-04-15 15:11:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:11:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-04-15 15:11:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:50,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:11:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:11:50,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 15:11:50,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:50,792 INFO L225 Difference]: With dead ends: 118 [2022-04-15 15:11:50,792 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 15:11:50,792 INFO L912 BasicCegarLoop]: 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-15 15:11:50,793 INFO L913 BasicCegarLoop]: 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-15 15:11:50,793 INFO L914 BasicCegarLoop]: 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-15 15:11:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 15:11:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-04-15 15:11:50,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:50,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:50,865 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:50,865 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:50,873 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 15:11:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 15:11:50,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:50,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:50,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-15 15:11:50,875 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 81 states. [2022-04-15 15:11:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:50,877 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 15:11:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 15:11:50,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:50,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:50,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:50,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2022-04-15 15:11:50,879 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 49 [2022-04-15 15:11:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:50,879 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2022-04-15 15:11:50,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:50,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 99 transitions. [2022-04-15 15:11:52,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2022-04-15 15:11:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 15:11:52,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:52,993 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:53,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:53,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:53,193 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 15:11:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513158434] [2022-04-15 15:11:53,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 15:11:53,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:53,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212707873] [2022-04-15 15:11:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:53,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:53,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:53,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26588810] [2022-04-15 15:11:53,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:11:53,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:53,204 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:53,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 15:11:53,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:11:53,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:53,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:11:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:53,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:53,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-15 15:11:53,495 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-15 15:11:53,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4698#(<= ~counter~0 0)} {4690#true} #102#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {4698#(<= ~counter~0 0)} call #t~ret9 := main(); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,497 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-15 15:11:53,497 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-15 15:11:53,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #90#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,499 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-15 15:11:53,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {4698#(<= ~counter~0 0)} ~cond := #in~cond; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {4698#(<= ~counter~0 0)} assume !(0 == ~cond); {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {4698#(<= ~counter~0 0)} assume true; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,500 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4698#(<= ~counter~0 0)} {4698#(<= ~counter~0 0)} #92#return; {4698#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:53,500 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-15 15:11:53,500 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-15 15:11:53,501 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-15 15:11:53,501 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-15 15:11:53,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {4747#(<= ~counter~0 1)} ~cond := #in~cond; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(<= ~counter~0 1)} assume !(0 == ~cond); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,503 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4747#(<= ~counter~0 1)} {4747#(<= ~counter~0 1)} #94#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,503 INFO L290 TraceCheckUtils]: 24: Hoare triple {4747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,503 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-15 15:11:53,503 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-15 15:11:53,504 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-15 15:11:53,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {4772#(<= ~counter~0 2)} ~cond := #in~cond; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:53,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= ~counter~0 2)} assume !(0 == ~cond); {4772#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:53,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {4772#(<= ~counter~0 2)} assume true; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:53,505 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4772#(<= ~counter~0 2)} {4772#(<= ~counter~0 2)} #96#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:53,506 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-15 15:11:53,506 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-15 15:11:53,507 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-15 15:11:53,507 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-15 15:11:53,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {4797#(<= ~counter~0 3)} ~cond := #in~cond; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:53,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {4797#(<= ~counter~0 3)} assume !(0 == ~cond); {4797#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:53,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {4797#(<= ~counter~0 3)} assume true; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:53,509 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4797#(<= ~counter~0 3)} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:53,509 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-15 15:11:53,510 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-15 15:11:53,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {4822#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-15 15:11:53,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-15 15:11:53,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-15 15:11:53,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-15 15:11:53,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-15 15:11:53,511 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-15 15:11:53,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-15 15:11:53,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-15 15:11:53,511 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-15 15:11:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:53,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:53,762 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#false} assume !false; {4691#false} is VALID [2022-04-15 15:11:53,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#false} assume 0 == ~cond; {4691#false} is VALID [2022-04-15 15:11:53,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {4691#false} ~cond := #in~cond; {4691#false} is VALID [2022-04-15 15:11:53,762 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-15 15:11:53,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#false} assume !(#t~post6 < 5);havoc #t~post6; {4691#false} is VALID [2022-04-15 15:11:53,762 INFO L290 TraceCheckUtils]: 45: Hoare triple {4691#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4691#false} is VALID [2022-04-15 15:11:53,762 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#false} assume !(#t~post8 < 5);havoc #t~post8; {4691#false} is VALID [2022-04-15 15:11:53,762 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4691#false} is VALID [2022-04-15 15:11:53,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {4874#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {4691#false} is VALID [2022-04-15 15:11:53,766 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-15 15:11:53,767 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-15 15:11:53,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4690#true} {4878#(< ~counter~0 5)} #96#return; {4878#(< ~counter~0 5)} is VALID [2022-04-15 15:11:53,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 15:11:53,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 15:11:53,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 15:11:53,768 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-15 15:11:53,768 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-15 15:11:53,769 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-15 15:11:53,769 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-15 15:11:53,770 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4690#true} {4797#(<= ~counter~0 3)} #96#return; {4797#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:53,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 15:11:53,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 15:11:53,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 15:11:53,770 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-15 15:11:53,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-15 15:11:53,771 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-15 15:11:53,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {4772#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4772#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:53,773 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4690#true} {4772#(<= ~counter~0 2)} #94#return; {4772#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:53,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 15:11:53,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 15:11:53,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 15:11:53,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-15 15:11:53,774 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-15 15:11:53,774 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-15 15:11:53,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-15 15:11:53,775 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #92#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 15:11:53,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 15:11:53,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 15:11:53,775 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-15 15:11:53,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4690#true} {4747#(<= ~counter~0 1)} #90#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {4690#true} assume true; {4690#true} is VALID [2022-04-15 15:11:53,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {4690#true} assume !(0 == ~cond); {4690#true} is VALID [2022-04-15 15:11:53,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {4690#true} ~cond := #in~cond; {4690#true} is VALID [2022-04-15 15:11:53,793 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-15 15:11:53,793 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-15 15:11:53,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= ~counter~0 1)} call #t~ret9 := main(); {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= ~counter~0 1)} {4690#true} #102#return; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= ~counter~0 1)} assume true; {4747#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:53,796 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-15 15:11:53,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {4690#true} call ULTIMATE.init(); {4690#true} is VALID [2022-04-15 15:11:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:53,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:53,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212707873] [2022-04-15 15:11:53,796 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:53,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26588810] [2022-04-15 15:11:53,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26588810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:53,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 15:11:53,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:53,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513158434] [2022-04-15 15:11:53,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513158434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:53,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:53,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:11:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510941637] [2022-04-15 15:11:53,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:53,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-15 15:11:53,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:53,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:53,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:53,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:11:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:11:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 15:11:53,831 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:54,092 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2022-04-15 15:11:54,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:11:54,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2022-04-15 15:11:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:11:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:54,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:11:54,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 15:11:54,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:54,169 INFO L225 Difference]: With dead ends: 119 [2022-04-15 15:11:54,169 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 15:11:54,169 INFO L912 BasicCegarLoop]: 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-15 15:11:54,170 INFO L913 BasicCegarLoop]: 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-15 15:11:54,170 INFO L914 BasicCegarLoop]: 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-15 15:11:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 15:11:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 15:11:54,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:54,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:54,255 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:54,255 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:54,256 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 15:11:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 15:11:54,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:54,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:54,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-15 15:11:54,257 INFO L87 Difference]: Start difference. First operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 82 states. [2022-04-15 15:11:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:54,258 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2022-04-15 15:11:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 15:11:54,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:54,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:54,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:54,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2022-04-15 15:11:54,260 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 51 [2022-04-15 15:11:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:54,260 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2022-04-15 15:11:54,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 15:11:54,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 101 transitions. [2022-04-15 15:11:56,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2022-04-15 15:11:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 15:11:56,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:56,379 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:56,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:56,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 15:11:56,583 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 15:11:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:56,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582459605] [2022-04-15 15:11:56,584 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 15:11:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718449672] [2022-04-15 15:11:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:56,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:56,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341986049] [2022-04-15 15:11:56,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:56,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:56,598 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:56,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 15:11:56,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:56,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:56,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:56,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:56,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-15 15:11:56,892 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-15 15:11:56,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,893 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-15 15:11:56,893 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-15 15:11:56,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,895 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-15 15:11:56,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {5582#(<= ~counter~0 0)} ~cond := #in~cond; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {5582#(<= ~counter~0 0)} assume !(0 == ~cond); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5582#(<= ~counter~0 0)} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:56,896 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-15 15:11:56,897 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-15 15:11:56,897 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-15 15:11:56,897 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-15 15:11:56,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {5631#(<= ~counter~0 1)} ~cond := #in~cond; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {5631#(<= ~counter~0 1)} assume !(0 == ~cond); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#(<= ~counter~0 1)} assume true; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5631#(<= ~counter~0 1)} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:56,899 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-15 15:11:56,899 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-15 15:11:56,900 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-15 15:11:56,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {5656#(<= ~counter~0 2)} ~cond := #in~cond; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {5656#(<= ~counter~0 2)} assume !(0 == ~cond); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {5656#(<= ~counter~0 2)} assume true; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,901 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5656#(<= ~counter~0 2)} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:56,902 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-15 15:11:56,902 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-15 15:11:56,903 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-15 15:11:56,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {5681#(<= ~counter~0 3)} ~cond := #in~cond; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:56,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {5681#(<= ~counter~0 3)} assume !(0 == ~cond); {5681#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:56,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {5681#(<= ~counter~0 3)} assume true; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:56,904 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5681#(<= ~counter~0 3)} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:56,904 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-15 15:11:56,904 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-15 15:11:56,905 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-15 15:11:56,905 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-15 15:11:56,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {5706#(<= ~counter~0 4)} ~cond := #in~cond; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:56,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {5706#(<= ~counter~0 4)} assume !(0 == ~cond); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:56,906 INFO L290 TraceCheckUtils]: 46: Hoare triple {5706#(<= ~counter~0 4)} assume true; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:56,906 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5706#(<= ~counter~0 4)} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:56,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:56,907 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-15 15:11:56,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-15 15:11:56,907 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-15 15:11:56,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-15 15:11:56,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-15 15:11:56,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-15 15:11:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:56,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:57,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {5575#false} assume !false; {5575#false} is VALID [2022-04-15 15:11:57,159 INFO L290 TraceCheckUtils]: 53: Hoare triple {5575#false} assume 0 == ~cond; {5575#false} is VALID [2022-04-15 15:11:57,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {5575#false} ~cond := #in~cond; {5575#false} is VALID [2022-04-15 15:11:57,159 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-15 15:11:57,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {5731#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {5575#false} is VALID [2022-04-15 15:11:57,159 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-15 15:11:57,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {5706#(<= ~counter~0 4)} assume !(~r~0 < 0); {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:57,160 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5574#true} {5706#(<= ~counter~0 4)} #98#return; {5706#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:57,160 INFO L290 TraceCheckUtils]: 46: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 15:11:57,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 15:11:57,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 15:11:57,160 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-15 15:11:57,174 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-15 15:11:57,175 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-15 15:11:57,175 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-15 15:11:57,176 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5574#true} {5681#(<= ~counter~0 3)} #98#return; {5681#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:57,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 15:11:57,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 15:11:57,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 15:11:57,176 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-15 15:11:57,176 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-15 15:11:57,177 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-15 15:11:57,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {5656#(<= ~counter~0 2)} assume !(~r~0 > 0); {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:57,178 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5574#true} {5656#(<= ~counter~0 2)} #96#return; {5656#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:57,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 15:11:57,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 15:11:57,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 15:11:57,178 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-15 15:11:57,178 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-15 15:11:57,179 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-15 15:11:57,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:57,179 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5574#true} {5631#(<= ~counter~0 1)} #94#return; {5631#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:57,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 15:11:57,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 15:11:57,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 15:11:57,180 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-15 15:11:57,180 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-15 15:11:57,180 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-15 15:11:57,181 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-15 15:11:57,181 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #92#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:57,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 15:11:57,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 15:11:57,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 15:11:57,181 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-15 15:11:57,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5574#true} {5582#(<= ~counter~0 0)} #90#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:57,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {5574#true} assume true; {5574#true} is VALID [2022-04-15 15:11:57,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {5574#true} assume !(0 == ~cond); {5574#true} is VALID [2022-04-15 15:11:57,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {5574#true} ~cond := #in~cond; {5574#true} is VALID [2022-04-15 15:11:57,182 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-15 15:11:57,182 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-15 15:11:57,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {5582#(<= ~counter~0 0)} call #t~ret9 := main(); {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:57,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5582#(<= ~counter~0 0)} {5574#true} #102#return; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:57,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {5582#(<= ~counter~0 0)} assume true; {5582#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:57,184 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-15 15:11:57,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {5574#true} call ULTIMATE.init(); {5574#true} is VALID [2022-04-15 15:11:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:11:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718449672] [2022-04-15 15:11:57,184 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341986049] [2022-04-15 15:11:57,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341986049] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:57,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:57,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 15:11:57,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:57,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582459605] [2022-04-15 15:11:57,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582459605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:57,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:57,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120394284] [2022-04-15 15:11:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 15:11:57,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:57,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:11:57,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:57,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 15:11:57,222 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:11:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:57,490 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-04-15 15:11:57,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:11:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 15:11:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:57,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:11:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:11:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:11:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:11:57,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 15:11:57,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:57,560 INFO L225 Difference]: With dead ends: 99 [2022-04-15 15:11:57,560 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 15:11:57,561 INFO L912 BasicCegarLoop]: 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-15 15:11:57,561 INFO L913 BasicCegarLoop]: 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-15 15:11:57,561 INFO L914 BasicCegarLoop]: 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-15 15:11:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 15:11:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-04-15 15:11:57,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:57,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:57,647 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:57,647 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:57,649 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 15:11:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 15:11:57,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:57,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:57,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-15 15:11:57,649 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 94 states. [2022-04-15 15:11:57,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:57,651 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-04-15 15:11:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 15:11:57,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:57,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:57,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:57,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2022-04-15 15:11:57,653 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 55 [2022-04-15 15:11:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:57,653 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2022-04-15 15:11:57,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:11:57,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 112 transitions. [2022-04-15 15:11:59,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2022-04-15 15:11:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 15:11:59,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:59,499 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:59,515 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-15 15:11:59,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 15:11:59,700 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 15:11:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:59,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [433977467] [2022-04-15 15:11:59,701 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 15:11:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:59,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032409463] [2022-04-15 15:11:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:59,710 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:59,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710350292] [2022-04-15 15:11:59,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:11:59,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:59,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:11:59,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 15:11:59,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:11:59,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:59,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:59,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:00,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-15 15:12:00,027 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-15 15:12:00,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,028 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-15 15:12:00,029 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-15 15:12:00,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,031 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-15 15:12:00,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {6489#(<= ~counter~0 0)} ~cond := #in~cond; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {6489#(<= ~counter~0 0)} assume !(0 == ~cond); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,032 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6489#(<= ~counter~0 0)} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,032 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-15 15:12:00,033 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-15 15:12:00,033 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-15 15:12:00,034 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-15 15:12:00,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {6538#(<= ~counter~0 1)} ~cond := #in~cond; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {6538#(<= ~counter~0 1)} assume !(0 == ~cond); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {6538#(<= ~counter~0 1)} assume true; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,035 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6538#(<= ~counter~0 1)} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,035 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,036 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-15 15:12:00,036 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-15 15:12:00,036 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-15 15:12:00,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {6563#(<= ~counter~0 2)} ~cond := #in~cond; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {6563#(<= ~counter~0 2)} assume !(0 == ~cond); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {6563#(<= ~counter~0 2)} assume true; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,038 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6563#(<= ~counter~0 2)} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,038 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-15 15:12:00,039 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-15 15:12:00,039 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-15 15:12:00,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {6588#(<= ~counter~0 3)} ~cond := #in~cond; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:00,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {6588#(<= ~counter~0 3)} assume !(0 == ~cond); {6588#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:00,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {6588#(<= ~counter~0 3)} assume true; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:00,040 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6588#(<= ~counter~0 3)} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:00,040 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-15 15:12:00,041 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-15 15:12:00,051 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-15 15:12:00,051 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-15 15:12:00,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {6613#(<= ~counter~0 4)} ~cond := #in~cond; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:00,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {6613#(<= ~counter~0 4)} assume !(0 == ~cond); {6613#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:00,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {6613#(<= ~counter~0 4)} assume true; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:00,053 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6613#(<= ~counter~0 4)} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:00,053 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-15 15:12:00,053 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-15 15:12:00,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-15 15:12:00,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-15 15:12:00,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-15 15:12:00,054 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-15 15:12:00,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-15 15:12:00,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-15 15:12:00,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-15 15:12:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:00,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:00,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {6482#false} assume !false; {6482#false} is VALID [2022-04-15 15:12:00,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {6482#false} assume 0 == ~cond; {6482#false} is VALID [2022-04-15 15:12:00,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {6482#false} ~cond := #in~cond; {6482#false} is VALID [2022-04-15 15:12:00,292 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-15 15:12:00,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {6482#false} assume !(#t~post6 < 5);havoc #t~post6; {6482#false} is VALID [2022-04-15 15:12:00,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {6482#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6482#false} is VALID [2022-04-15 15:12:00,292 INFO L290 TraceCheckUtils]: 50: Hoare triple {6638#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {6482#false} is VALID [2022-04-15 15:12:00,293 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-15 15:12:00,293 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-15 15:12:00,293 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6481#true} {6613#(<= ~counter~0 4)} #98#return; {6613#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:00,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 15:12:00,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 15:12:00,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 15:12:00,294 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-15 15:12:00,294 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-15 15:12:00,294 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-15 15:12:00,295 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-15 15:12:00,295 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6481#true} {6588#(<= ~counter~0 3)} #98#return; {6588#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:00,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 15:12:00,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 15:12:00,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 15:12:00,296 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-15 15:12:00,296 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-15 15:12:00,296 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-15 15:12:00,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {6563#(<= ~counter~0 2)} assume !(~r~0 > 0); {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,297 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6481#true} {6563#(<= ~counter~0 2)} #96#return; {6563#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:00,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 15:12:00,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 15:12:00,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 15:12:00,297 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-15 15:12:00,298 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-15 15:12:00,298 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-15 15:12:00,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {6538#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,299 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6481#true} {6538#(<= ~counter~0 1)} #94#return; {6538#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:00,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 15:12:00,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 15:12:00,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 15:12:00,303 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-15 15:12:00,303 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-15 15:12:00,304 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-15 15:12:00,304 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-15 15:12:00,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #92#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 15:12:00,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 15:12:00,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 15:12:00,305 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-15 15:12:00,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6481#true} {6489#(<= ~counter~0 0)} #90#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {6481#true} assume true; {6481#true} is VALID [2022-04-15 15:12:00,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {6481#true} assume !(0 == ~cond); {6481#true} is VALID [2022-04-15 15:12:00,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {6481#true} ~cond := #in~cond; {6481#true} is VALID [2022-04-15 15:12:00,306 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-15 15:12:00,306 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-15 15:12:00,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {6489#(<= ~counter~0 0)} call #t~ret9 := main(); {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6489#(<= ~counter~0 0)} {6481#true} #102#return; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {6489#(<= ~counter~0 0)} assume true; {6489#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:00,307 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-15 15:12:00,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {6481#true} call ULTIMATE.init(); {6481#true} is VALID [2022-04-15 15:12:00,307 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:12:00,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:00,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032409463] [2022-04-15 15:12:00,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:00,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710350292] [2022-04-15 15:12:00,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710350292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:00,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:00,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 15:12:00,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:00,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [433977467] [2022-04-15 15:12:00,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [433977467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:00,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:00,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027978414] [2022-04-15 15:12:00,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:00,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-15 15:12:00,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:00,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:00,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:00,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 15:12:00,342 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:00,628 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2022-04-15 15:12:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 15:12:00,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 57 [2022-04-15 15:12:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:12:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:12:00,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 15:12:00,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:00,707 INFO L225 Difference]: With dead ends: 132 [2022-04-15 15:12:00,707 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 15:12:00,707 INFO L912 BasicCegarLoop]: 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-15 15:12:00,707 INFO L913 BasicCegarLoop]: 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-15 15:12:00,708 INFO L914 BasicCegarLoop]: 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-15 15:12:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 15:12:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-15 15:12:00,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:00,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:00,785 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:00,786 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:00,787 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 15:12:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 15:12:00,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:00,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:00,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-15 15:12:00,788 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 95 states. [2022-04-15 15:12:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:00,790 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-15 15:12:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-15 15:12:00,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:00,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:00,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:00,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 116 transitions. [2022-04-15 15:12:00,792 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 116 transitions. Word has length 57 [2022-04-15 15:12:00,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:00,792 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 116 transitions. [2022-04-15 15:12:00,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:00,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 116 transitions. [2022-04-15 15:12:01,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-04-15 15:12:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 15:12:01,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:01,990 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:02,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:02,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 15:12:02,206 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:02,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 15:12:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:02,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705741788] [2022-04-15 15:12:02,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 15:12:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:02,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354046360] [2022-04-15 15:12:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:02,219 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:02,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [342329350] [2022-04-15 15:12:02,220 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:02,227 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:02,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 15:12:02,307 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:12:02,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:02,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:12:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:02,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:02,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-15 15:12:02,592 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-15 15:12:02,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,593 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-15 15:12:02,593 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-15 15:12:02,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,595 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-15 15:12:02,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {7484#(<= ~counter~0 0)} ~cond := #in~cond; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {7484#(<= ~counter~0 0)} assume !(0 == ~cond); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,596 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7484#(<= ~counter~0 0)} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,596 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-15 15:12:02,597 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-15 15:12:02,597 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-15 15:12:02,597 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-15 15:12:02,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {7533#(<= ~counter~0 1)} ~cond := #in~cond; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {7533#(<= ~counter~0 1)} assume !(0 == ~cond); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {7533#(<= ~counter~0 1)} assume true; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,599 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7533#(<= ~counter~0 1)} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,599 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-15 15:12:02,599 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-15 15:12:02,600 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-15 15:12:02,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {7558#(<= ~counter~0 2)} ~cond := #in~cond; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {7558#(<= ~counter~0 2)} assume !(0 == ~cond); {7558#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {7558#(<= ~counter~0 2)} assume true; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,601 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7558#(<= ~counter~0 2)} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,601 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-15 15:12:02,602 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-15 15:12:02,602 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-15 15:12:02,602 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-15 15:12:02,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {7583#(<= ~counter~0 3)} ~cond := #in~cond; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {7583#(<= ~counter~0 3)} assume !(0 == ~cond); {7583#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {7583#(<= ~counter~0 3)} assume true; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,604 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7583#(<= ~counter~0 3)} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,604 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-15 15:12:02,604 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-15 15:12:02,605 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-15 15:12:02,605 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-15 15:12:02,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {7608#(<= ~counter~0 4)} ~cond := #in~cond; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:02,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {7608#(<= ~counter~0 4)} assume !(0 == ~cond); {7608#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:02,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {7608#(<= ~counter~0 4)} assume true; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:02,606 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7608#(<= ~counter~0 4)} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:02,606 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-15 15:12:02,607 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-15 15:12:02,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-15 15:12:02,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-15 15:12:02,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-15 15:12:02,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-15 15:12:02,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-15 15:12:02,607 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-15 15:12:02,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-15 15:12:02,607 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-15 15:12:02,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-15 15:12:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:02,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {7477#false} assume !false; {7477#false} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {7477#false} assume 0 == ~cond; {7477#false} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {7477#false} ~cond := #in~cond; {7477#false} is VALID [2022-04-15 15:12:02,840 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-15 15:12:02,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {7477#false} assume !(#t~post6 < 5);havoc #t~post6; {7477#false} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {7477#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7477#false} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {7477#false} assume !(#t~post8 < 5);havoc #t~post8; {7477#false} is VALID [2022-04-15 15:12:02,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {7477#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7477#false} is VALID [2022-04-15 15:12:02,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {7633#(<= |main_#t~post7| 4)} assume !(#t~post7 < 5);havoc #t~post7; {7477#false} is VALID [2022-04-15 15:12:02,849 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-15 15:12:02,850 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-15 15:12:02,850 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7476#true} {7608#(<= ~counter~0 4)} #96#return; {7608#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:02,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 15:12:02,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 15:12:02,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 15:12:02,850 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-15 15:12:02,851 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-15 15:12:02,851 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-15 15:12:02,851 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-15 15:12:02,852 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7476#true} {7583#(<= ~counter~0 3)} #96#return; {7583#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:02,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 15:12:02,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 15:12:02,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 15:12:02,852 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-15 15:12:02,852 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-15 15:12:02,855 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-15 15:12:02,856 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-15 15:12:02,857 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7476#true} {7558#(<= ~counter~0 2)} #96#return; {7558#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:02,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 15:12:02,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 15:12:02,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 15:12:02,857 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-15 15:12:02,857 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-15 15:12:02,858 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-15 15:12:02,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {7533#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,859 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7476#true} {7533#(<= ~counter~0 1)} #94#return; {7533#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:02,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 15:12:02,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 15:12:02,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 15:12:02,859 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-15 15:12:02,859 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-15 15:12:02,860 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-15 15:12:02,860 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-15 15:12:02,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #92#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 15:12:02,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 15:12:02,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 15:12:02,861 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-15 15:12:02,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7476#true} {7484#(<= ~counter~0 0)} #90#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {7476#true} assume true; {7476#true} is VALID [2022-04-15 15:12:02,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {7476#true} assume !(0 == ~cond); {7476#true} is VALID [2022-04-15 15:12:02,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {7476#true} ~cond := #in~cond; {7476#true} is VALID [2022-04-15 15:12:02,861 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-15 15:12:02,862 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-15 15:12:02,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#(<= ~counter~0 0)} call #t~ret9 := main(); {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#(<= ~counter~0 0)} {7476#true} #102#return; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#(<= ~counter~0 0)} assume true; {7484#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:02,863 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-15 15:12:02,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {7476#true} call ULTIMATE.init(); {7476#true} is VALID [2022-04-15 15:12:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:12:02,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:02,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354046360] [2022-04-15 15:12:02,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342329350] [2022-04-15 15:12:02,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342329350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:02,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:02,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 15:12:02,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:02,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705741788] [2022-04-15 15:12:02,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705741788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:02,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:02,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:12:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6609750] [2022-04-15 15:12:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:02,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 15:12:02,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:02,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:02,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:02,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:12:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:12:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 15:12:02,904 INFO L87 Difference]: Start difference. First operand 94 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:03,177 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2022-04-15 15:12:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:12:03,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 15:12:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:12:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:12:03,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 15:12:03,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:03,260 INFO L225 Difference]: With dead ends: 133 [2022-04-15 15:12:03,260 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 15:12:03,260 INFO L912 BasicCegarLoop]: 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-15 15:12:03,261 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:03,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 163 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:12:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 15:12:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-15 15:12:03,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:03,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:03,339 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:03,339 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:03,340 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 15:12:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 15:12:03,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:03,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:03,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-15 15:12:03,341 INFO L87 Difference]: Start difference. First operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 96 states. [2022-04-15 15:12:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:03,343 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 15:12:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 15:12:03,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:03,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:03,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:03,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2) internal successors, (84), 70 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:12:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-04-15 15:12:03,345 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 59 [2022-04-15 15:12:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:03,345 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-04-15 15:12:03,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 15:12:03,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 118 transitions. [2022-04-15 15:12:05,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 117 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-15 15:12:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 15:12:05,511 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:05,511 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:05,517 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-15 15:12:05,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 15:12:05,715 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 15:12:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160214722] [2022-04-15 15:12:05,716 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 15:12:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897304144] [2022-04-15 15:12:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:05,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:05,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479383188] [2022-04-15 15:12:05,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:05,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:05,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:05,727 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:05,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 15:12:05,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:05,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 15:12:05,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 15:12:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 15:12:05,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 15:12:05,827 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 15:12:05,827 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 15:12:05,829 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 15:12:05,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:06,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:06,050 INFO L719 BasicCegarLoop]: Path program histogram: [6, 4, 4, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 15:12:06,051 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 15:12:06,060 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 15:12:06,061 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 15:12:06,062 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 15:12:06,062 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 15:12:06,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:12:06 BoogieIcfgContainer [2022-04-15 15:12:06,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 15:12:06,063 INFO L158 Benchmark]: Toolchain (without parser) took 59276.78ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 127.2MB in the beginning and 165.9MB in the end (delta: -38.7MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. [2022-04-15 15:12:06,063 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory was 143.5MB in the beginning and 143.3MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 15:12:06,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.48ms. Allocated memory is still 177.2MB. Free memory was 126.9MB in the beginning and 152.5MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 15:12:06,064 INFO L158 Benchmark]: Boogie Preprocessor took 34.85ms. Allocated memory is still 177.2MB. Free memory was 152.5MB in the beginning and 151.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 15:12:06,064 INFO L158 Benchmark]: RCFGBuilder took 296.48ms. Allocated memory is still 177.2MB. Free memory was 151.1MB in the beginning and 138.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 15:12:06,064 INFO L158 Benchmark]: TraceAbstraction took 58697.69ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 137.9MB in the beginning and 165.9MB in the end (delta: -28.0MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-04-15 15:12:06,065 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory was 143.5MB in the beginning and 143.3MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.48ms. Allocated memory is still 177.2MB. Free memory was 126.9MB in the beginning and 152.5MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.85ms. Allocated memory is still 177.2MB. Free memory was 152.5MB in the beginning and 151.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 296.48ms. Allocated memory is still 177.2MB. Free memory was 151.1MB in the beginning and 138.2MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 58697.69ms. Allocated memory was 177.2MB in the beginning and 220.2MB in the end (delta: 43.0MB). Free memory was 137.9MB in the beginning and 165.9MB in the end (delta: -28.0MB). Peak memory consumption was 16.0MB. 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.6s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 1598 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1071 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 443 IncrementalHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 527 mSDtfsCounter, 443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 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.8s 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-15 15:12:06,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...