/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:29:40,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:29:40,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:29:40,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:29:40,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:29:40,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:29:40,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:29:40,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:29:40,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:29:40,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:29:40,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:29:40,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:29:40,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:29:40,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:29:40,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:29:40,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:29:40,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:29:40,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:29:40,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:29:40,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:29:40,288 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:29:40,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:29:40,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:29:40,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:29:40,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:29:40,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:29:40,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:29:40,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:29:40,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:29:40,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:29:40,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:29:40,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:29:40,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:29:40,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:29:40,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:29:40,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:29:40,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:29:40,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:29:40,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:29:40,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:29:40,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:29:40,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:29:40,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:29:40,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:29:40,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:29:40,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:29:40,327 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:29:40,330 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:29:40,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:29:40,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:29:40,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:29:40,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:29:40,331 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:29:40,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:29:40,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:29:40,332 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:29:40,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:29:40,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:29:40,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:29:40,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:29:40,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:29:40,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:29:40,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:29:40,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:29:40,337 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:29:40,338 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:29:40,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:29:40,338 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:29:40,338 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:29:40,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:29:40,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:29:40,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:29:40,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:29:40,574 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:29:40,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound2.c [2022-04-28 04:29:40,651 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7892f4c64/f2fcfefde6a84831b258fccf066d77b7/FLAGba5fd4729 [2022-04-28 04:29:41,031 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:29:41,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound2.c [2022-04-28 04:29:41,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7892f4c64/f2fcfefde6a84831b258fccf066d77b7/FLAGba5fd4729 [2022-04-28 04:29:41,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7892f4c64/f2fcfefde6a84831b258fccf066d77b7 [2022-04-28 04:29:41,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:29:41,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:29:41,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:29:41,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:29:41,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:29:41,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a663b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41, skipping insertion in model container [2022-04-28 04:29:41,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:29:41,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:29:41,227 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/bresenham-ll_unwindbound2.c[597,610] [2022-04-28 04:29:41,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:29:41,252 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:29:41,280 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/bresenham-ll_unwindbound2.c[597,610] [2022-04-28 04:29:41,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:29:41,305 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:29:41,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41 WrapperNode [2022-04-28 04:29:41,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:29:41,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:29:41,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:29:41,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:29:41,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:29:41,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:29:41,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:29:41,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:29:41,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (1/1) ... [2022-04-28 04:29:41,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:29:41,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:41,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:29:41,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:29:41,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:29:41,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:29:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:29:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:29:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:29:41,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:29:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:29:41,406 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:29:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:29:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:29:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:29:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:29:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:29:41,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:29:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:29:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:29:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:29:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:29:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:29:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:29:41,462 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:29:41,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:29:41,671 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:29:41,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:29:41,678 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:29:41,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:29:41 BoogieIcfgContainer [2022-04-28 04:29:41,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:29:41,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:29:41,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:29:41,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:29:41,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:29:41" (1/3) ... [2022-04-28 04:29:41,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbc8805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:29:41, skipping insertion in model container [2022-04-28 04:29:41,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:29:41" (2/3) ... [2022-04-28 04:29:41,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbc8805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:29:41, skipping insertion in model container [2022-04-28 04:29:41,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:29:41" (3/3) ... [2022-04-28 04:29:41,694 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound2.c [2022-04-28 04:29:41,706 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:29:41,706 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:29:41,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:29:41,756 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3163525a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53d17194 [2022-04-28 04:29:41,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:29:41,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:29:41,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:41,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:41,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 1 times [2022-04-28 04:29:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:41,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143825592] [2022-04-28 04:29:41,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:29:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 2 times [2022-04-28 04:29:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:41,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727249380] [2022-04-28 04:29:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:29:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:42,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-04-28 04:29:42,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 04:29:42,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #62#return; {28#true} is VALID [2022-04-28 04:29:42,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:29:42,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-04-28 04:29:42,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 04:29:42,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #62#return; {28#true} is VALID [2022-04-28 04:29:42,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2022-04-28 04:29:42,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {28#true} is VALID [2022-04-28 04:29:42,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 04:29:42,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {29#false} is VALID [2022-04-28 04:29:42,073 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {29#false} is VALID [2022-04-28 04:29:42,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 04:29:42,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 04:29:42,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 04:29:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:29:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:29:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727249380] [2022-04-28 04:29:42,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727249380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:42,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:42,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:29:42,078 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:29:42,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143825592] [2022-04-28 04:29:42,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143825592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:42,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:42,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:29:42,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849516317] [2022-04-28 04:29:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:29:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:29:42,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:29:42,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:42,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:29:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:42,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:29:42,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:29:42,142 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:42,256 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 04:29:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:29:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:29:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:29:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 04:29:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 04:29:42,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-28 04:29:42,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:42,333 INFO L225 Difference]: With dead ends: 45 [2022-04-28 04:29:42,333 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:29:42,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:29:42,338 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:29:42,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:29:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:29:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 04:29:42,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:29:42,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:42,389 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:42,389 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:42,392 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 04:29:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 04:29:42,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:42,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:42,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-28 04:29:42,394 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-28 04:29:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:42,396 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 04:29:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 04:29:42,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:42,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:42,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:29:42,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:29:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 04:29:42,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-28 04:29:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:29:42,401 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 04:29:42,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 04:29:42,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 04:29:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:29:42,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:42,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:42,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:29:42,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:42,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 1 times [2022-04-28 04:29:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:42,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710258394] [2022-04-28 04:29:42,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:29:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 2 times [2022-04-28 04:29:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:42,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496890785] [2022-04-28 04:29:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:42,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:29:42,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368494613] [2022-04-28 04:29:42,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:29:42,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:42,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:42,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:29:42,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:29:42,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:29:42,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:29:42,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:29:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:42,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:29:42,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-28 04:29:42,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {208#true} is VALID [2022-04-28 04:29:42,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-28 04:29:42,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #62#return; {208#true} is VALID [2022-04-28 04:29:42,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret9 := main(); {208#true} is VALID [2022-04-28 04:29:42,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:42,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:42,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {235#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-28 04:29:42,737 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:42,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:42,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {209#false} is VALID [2022-04-28 04:29:42,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-28 04:29:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:29:42,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:29:42,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:29:42,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496890785] [2022-04-28 04:29:42,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:29:42,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368494613] [2022-04-28 04:29:42,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368494613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:42,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:42,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:29:42,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:29:42,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710258394] [2022-04-28 04:29:42,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710258394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:42,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:42,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:29:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49395846] [2022-04-28 04:29:42,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:29:42,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:29:42,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:29:42,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:42,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:29:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:42,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:29:42,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:29:42,759 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:42,999 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-28 04:29:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:29:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 04:29:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:29:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 04:29:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 04:29:43,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 04:29:43,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:43,050 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:29:43,051 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:29:43,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:29:43,053 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:29:43,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:29:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:29:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-28 04:29:43,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:29:43,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:43,074 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:43,075 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:43,077 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 04:29:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 04:29:43,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:43,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:43,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 04:29:43,081 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 04:29:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:43,086 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 04:29:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 04:29:43,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:43,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:43,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:29:43,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:29:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-28 04:29:43,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2022-04-28 04:29:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:29:43,091 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-28 04:29:43,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:29:43,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-28 04:29:43,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 04:29:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:29:43,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:43,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:43,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:29:43,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:43,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:43,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 1 times [2022-04-28 04:29:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:43,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240285305] [2022-04-28 04:29:43,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:29:43,468 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:29:43,468 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:29:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 2 times [2022-04-28 04:29:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664231037] [2022-04-28 04:29:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:43,481 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:29:43,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844839322] [2022-04-28 04:29:43,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:29:43,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:43,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:43,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:29:43,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:29:43,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:29:43,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:29:43,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 04:29:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:43,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:29:43,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {435#true} is VALID [2022-04-28 04:29:43,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {435#true} is VALID [2022-04-28 04:29:43,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 04:29:43,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #62#return; {435#true} is VALID [2022-04-28 04:29:43,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret9 := main(); {435#true} is VALID [2022-04-28 04:29:43,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:43,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:43,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:43,800 INFO L272 TraceCheckUtils]: 8: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {435#true} is VALID [2022-04-28 04:29:43,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#true} ~cond := #in~cond; {435#true} is VALID [2022-04-28 04:29:43,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#true} assume !(0 == ~cond); {435#true} is VALID [2022-04-28 04:29:43,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 04:29:43,801 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {435#true} {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #58#return; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:43,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:43,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {483#(and (= main_~x~0 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:29:43,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#(and (= main_~x~0 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:29:43,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:29:43,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {494#(and (= main_~xy~0 0) (= main_~Y~0 main_~yx~0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:29:43,812 INFO L272 TraceCheckUtils]: 18: Hoare triple {494#(and (= main_~xy~0 0) (= main_~Y~0 main_~yx~0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:43,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:43,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {436#false} is VALID [2022-04-28 04:29:43,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-28 04:29:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:29:43,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:29:44,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-28 04:29:44,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {436#false} is VALID [2022-04-28 04:29:44,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:44,007 INFO L272 TraceCheckUtils]: 18: Hoare triple {518#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:44,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {518#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:29:44,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {529#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {529#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:29:44,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,057 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {435#true} {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #58#return; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 04:29:44,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#true} assume !(0 == ~cond); {435#true} is VALID [2022-04-28 04:29:44,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#true} ~cond := #in~cond; {435#true} is VALID [2022-04-28 04:29:44,058 INFO L272 TraceCheckUtils]: 8: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {435#true} is VALID [2022-04-28 04:29:44,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:44,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret9 := main(); {435#true} is VALID [2022-04-28 04:29:44,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #62#return; {435#true} is VALID [2022-04-28 04:29:44,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 04:29:44,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {435#true} is VALID [2022-04-28 04:29:44,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {435#true} is VALID [2022-04-28 04:29:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:29:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:29:44,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664231037] [2022-04-28 04:29:44,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:29:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844839322] [2022-04-28 04:29:44,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844839322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:29:44,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:29:44,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 04:29:44,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:29:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240285305] [2022-04-28 04:29:44,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240285305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:44,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:44,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:29:44,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935646962] [2022-04-28 04:29:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:29:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 04:29:44,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:29:44,064 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), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:44,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:29:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:44,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:29:44,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:29:44,098 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:44,495 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 04:29:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:29:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 04:29:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:29:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:29:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:29:44,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 04:29:44,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:44,547 INFO L225 Difference]: With dead ends: 44 [2022-04-28 04:29:44,547 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 04:29:44,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:29:44,548 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:29:44,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:29:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 04:29:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-28 04:29:44,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:29:44,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:44,563 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:44,563 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:44,566 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 04:29:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-28 04:29:44,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:44,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:44,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-28 04:29:44,567 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-28 04:29:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:44,569 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 04:29:44,569 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-28 04:29:44,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:44,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:44,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:29:44,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:29:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 04:29:44,571 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 22 [2022-04-28 04:29:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:29:44,572 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 04:29:44,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:44,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 04:29:44,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 04:29:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:29:44,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:44,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:44,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:29:44,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 04:29:44,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 794559142, now seen corresponding path program 1 times [2022-04-28 04:29:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:44,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [684897029] [2022-04-28 04:29:44,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 6 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:29:44,901 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:29:44,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:29:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 794559142, now seen corresponding path program 2 times [2022-04-28 04:29:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:44,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587403505] [2022-04-28 04:29:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:44,913 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:29:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078968309] [2022-04-28 04:29:44,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:29:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:44,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:29:44,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:29:44,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:29:44,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:29:44,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 04:29:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:44,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:29:45,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2022-04-28 04:29:45,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {823#true} is VALID [2022-04-28 04:29:45,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 04:29:45,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #62#return; {823#true} is VALID [2022-04-28 04:29:45,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret9 := main(); {823#true} is VALID [2022-04-28 04:29:45,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:45,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:45,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:45,174 INFO L272 TraceCheckUtils]: 8: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {823#true} is VALID [2022-04-28 04:29:45,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2022-04-28 04:29:45,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2022-04-28 04:29:45,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 04:29:45,175 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {823#true} {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #58#return; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:45,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:29:45,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {871#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 04:29:45,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {871#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 04:29:45,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 04:29:45,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {882#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 04:29:45,180 INFO L272 TraceCheckUtils]: 18: Hoare triple {882#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:45,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:45,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {824#false} is VALID [2022-04-28 04:29:45,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-04-28 04:29:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:29:45,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:29:45,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-04-28 04:29:45,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {824#false} is VALID [2022-04-28 04:29:45,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:45,360 INFO L272 TraceCheckUtils]: 18: Hoare triple {906#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:45,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {906#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:29:45,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {917#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:29:45,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,367 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {823#true} {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #58#return; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 04:29:45,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2022-04-28 04:29:45,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2022-04-28 04:29:45,368 INFO L272 TraceCheckUtils]: 8: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {823#true} is VALID [2022-04-28 04:29:45,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,371 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:45,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret9 := main(); {823#true} is VALID [2022-04-28 04:29:45,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #62#return; {823#true} is VALID [2022-04-28 04:29:45,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 04:29:45,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {823#true} is VALID [2022-04-28 04:29:45,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2022-04-28 04:29:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 04:29:45,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:29:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587403505] [2022-04-28 04:29:45,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:29:45,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078968309] [2022-04-28 04:29:45,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078968309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:29:45,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:29:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 04:29:45,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:29:45,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [684897029] [2022-04-28 04:29:45,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [684897029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:45,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:29:45,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938647827] [2022-04-28 04:29:45,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:29:45,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 04:29:45,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:29:45,376 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), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:45,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:45,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:29:45,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:45,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:29:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:29:45,401 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:45,743 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-28 04:29:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:29:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 04:29:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:29:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:29:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:29:45,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 04:29:45,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:45,795 INFO L225 Difference]: With dead ends: 53 [2022-04-28 04:29:45,795 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:29:45,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:29:45,796 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:29:45,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:29:45,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:29:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-28 04:29:45,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:29:45,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:45,818 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:45,819 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:45,821 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 04:29:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-28 04:29:45,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:45,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:45,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-28 04:29:45,822 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-28 04:29:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:45,824 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 04:29:45,824 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-28 04:29:45,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:45,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:45,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:29:45,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:29:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 04:29:45,827 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 22 [2022-04-28 04:29:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:29:45,827 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 04:29:45,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:45,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 04:29:45,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 04:29:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:29:45,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:45,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:45,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:29:46,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:46,083 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 1 times [2022-04-28 04:29:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:46,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1351708622] [2022-04-28 04:29:46,156 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 6 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:29:46,157 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:29:46,157 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:29:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 2 times [2022-04-28 04:29:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:46,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859685412] [2022-04-28 04:29:46,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:46,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:46,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:29:46,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422339224] [2022-04-28 04:29:46,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:29:46,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:46,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:46,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:29:46,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:29:46,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:29:46,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:29:46,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:29:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:46,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:29:46,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2022-04-28 04:29:46,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#(<= ~counter~0 0)} assume true; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1277#(<= ~counter~0 0)} {1269#true} #62#return; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {1277#(<= ~counter~0 0)} call #t~ret9 := main(); {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#(<= ~counter~0 0)} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {1293#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,357 INFO L272 TraceCheckUtils]: 8: Hoare triple {1293#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(<= ~counter~0 1)} ~cond := #in~cond; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {1293#(<= ~counter~0 1)} assume !(0 == ~cond); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#(<= ~counter~0 1)} assume true; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,359 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1293#(<= ~counter~0 1)} {1293#(<= ~counter~0 1)} #58#return; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {1293#(<= ~counter~0 1)} assume !!(~x~0 <= ~X~0); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {1293#(<= ~counter~0 1)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {1293#(<= ~counter~0 1)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,361 INFO L290 TraceCheckUtils]: 16: Hoare triple {1293#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1324#(<= |main_#t~post6| 1)} is VALID [2022-04-28 04:29:46,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {1324#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {1270#false} is VALID [2022-04-28 04:29:46,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1270#false} is VALID [2022-04-28 04:29:46,362 INFO L272 TraceCheckUtils]: 19: Hoare triple {1270#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1270#false} is VALID [2022-04-28 04:29:46,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {1270#false} ~cond := #in~cond; {1270#false} is VALID [2022-04-28 04:29:46,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {1270#false} assume 0 == ~cond; {1270#false} is VALID [2022-04-28 04:29:46,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2022-04-28 04:29:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:29:46,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:29:46,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2022-04-28 04:29:46,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {1270#false} assume 0 == ~cond; {1270#false} is VALID [2022-04-28 04:29:46,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {1270#false} ~cond := #in~cond; {1270#false} is VALID [2022-04-28 04:29:46,483 INFO L272 TraceCheckUtils]: 19: Hoare triple {1270#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1270#false} is VALID [2022-04-28 04:29:46,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1270#false} is VALID [2022-04-28 04:29:46,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {1324#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {1270#false} is VALID [2022-04-28 04:29:46,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {1293#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1324#(<= |main_#t~post6| 1)} is VALID [2022-04-28 04:29:46,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {1293#(<= ~counter~0 1)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {1293#(<= ~counter~0 1)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {1293#(<= ~counter~0 1)} assume !!(~x~0 <= ~X~0); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,486 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1269#true} {1293#(<= ~counter~0 1)} #58#return; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#true} assume true; {1269#true} is VALID [2022-04-28 04:29:46,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {1269#true} assume !(0 == ~cond); {1269#true} is VALID [2022-04-28 04:29:46,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#true} ~cond := #in~cond; {1269#true} is VALID [2022-04-28 04:29:46,486 INFO L272 TraceCheckUtils]: 8: Hoare triple {1293#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1269#true} is VALID [2022-04-28 04:29:46,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1293#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 04:29:46,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#(<= ~counter~0 0)} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1277#(<= ~counter~0 0)} call #t~ret9 := main(); {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1277#(<= ~counter~0 0)} {1269#true} #62#return; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#(<= ~counter~0 0)} assume true; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 04:29:46,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2022-04-28 04:29:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:29:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:29:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859685412] [2022-04-28 04:29:46,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:29:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422339224] [2022-04-28 04:29:46,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422339224] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:29:46,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:29:46,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-28 04:29:46,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:29:46,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1351708622] [2022-04-28 04:29:46,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1351708622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:46,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:46,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:29:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168570578] [2022-04-28 04:29:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:29:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 04:29:46,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:29:46,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:46,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:46,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:29:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:29:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:29:46,510 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:46,600 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-28 04:29:46,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:29:46,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 04:29:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:29:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:29:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:29:46,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 04:29:46,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:46,635 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:29:46,635 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 04:29:46,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:29:46,636 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:29:46,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:29:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 04:29:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 04:29:46,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:29:46,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:46,668 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:46,668 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:46,672 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 04:29:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 04:29:46,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:46,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:46,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 04:29:46,676 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 04:29:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:46,679 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 04:29:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 04:29:46,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:46,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:46,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:29:46,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:29:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:29:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-28 04:29:46,689 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 23 [2022-04-28 04:29:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:29:46,690 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-28 04:29:46,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:29:46,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-28 04:29:46,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 04:29:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 04:29:46,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:46,740 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:46,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:29:46,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:46,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 1 times [2022-04-28 04:29:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:46,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [948821261] [2022-04-28 04:29:47,024 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 6 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:29:47,024 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:29:47,024 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:29:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 2 times [2022-04-28 04:29:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:47,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9654622] [2022-04-28 04:29:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:47,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:29:47,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886141477] [2022-04-28 04:29:47,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:29:47,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:47,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:47,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:29:47,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 04:29:47,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:29:47,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:29:47,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 04:29:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:47,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:29:47,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2022-04-28 04:29:47,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1705#true} is VALID [2022-04-28 04:29:47,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {1705#true} assume true; {1705#true} is VALID [2022-04-28 04:29:47,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1705#true} {1705#true} #62#return; {1705#true} is VALID [2022-04-28 04:29:47,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {1705#true} call #t~ret9 := main(); {1705#true} is VALID [2022-04-28 04:29:47,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {1705#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1725#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:47,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {1725#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1725#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:47,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {1725#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1725#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:47,597 INFO L272 TraceCheckUtils]: 8: Hoare triple {1725#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1705#true} is VALID [2022-04-28 04:29:47,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {1705#true} ~cond := #in~cond; {1705#true} is VALID [2022-04-28 04:29:47,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {1705#true} assume !(0 == ~cond); {1705#true} is VALID [2022-04-28 04:29:47,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#true} assume true; {1705#true} is VALID [2022-04-28 04:29:47,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1705#true} {1725#(and (= main_~x~0 0) (= main_~y~0 0))} #58#return; {1725#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:47,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {1725#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1750#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:29:47,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1754#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-28 04:29:47,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {1754#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1758#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:29:47,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {1758#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1758#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:29:47,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {1758#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1765#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:29:47,601 INFO L272 TraceCheckUtils]: 18: Hoare triple {1765#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1705#true} is VALID [2022-04-28 04:29:47,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {1705#true} ~cond := #in~cond; {1772#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:47,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {1772#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:29:47,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:29:47,604 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} {1765#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #58#return; {1783#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:29:47,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {1783#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {1787#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:29:47,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {1787#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1791#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 04:29:47,608 INFO L272 TraceCheckUtils]: 25: Hoare triple {1791#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:47,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:47,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {1799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1706#false} is VALID [2022-04-28 04:29:47,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2022-04-28 04:29:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:29:47,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:29:48,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2022-04-28 04:29:48,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {1799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1706#false} is VALID [2022-04-28 04:29:48,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:29:48,442 INFO L272 TraceCheckUtils]: 25: Hoare triple {1815#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:29:48,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {1819#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1815#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:29:48,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1819#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:29:48,445 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} {1827#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #58#return; {1823#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:29:48,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:29:48,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1837#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1776#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:29:48,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {1705#true} ~cond := #in~cond; {1837#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:29:48,446 INFO L272 TraceCheckUtils]: 18: Hoare triple {1827#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1705#true} is VALID [2022-04-28 04:29:48,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {1844#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1827#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:29:48,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {1844#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1844#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-28 04:29:48,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {1851#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1844#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-28 04:29:48,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {1855#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1851#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} is VALID [2022-04-28 04:29:48,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {1705#true} assume !!(~x~0 <= ~X~0); {1855#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 04:29:48,457 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1705#true} {1705#true} #58#return; {1705#true} is VALID [2022-04-28 04:29:48,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#true} assume true; {1705#true} is VALID [2022-04-28 04:29:48,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {1705#true} assume !(0 == ~cond); {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {1705#true} ~cond := #in~cond; {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L272 TraceCheckUtils]: 8: Hoare triple {1705#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {1705#true} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {1705#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {1705#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {1705#true} call #t~ret9 := main(); {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1705#true} {1705#true} #62#return; {1705#true} is VALID [2022-04-28 04:29:48,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1705#true} assume true; {1705#true} is VALID [2022-04-28 04:29:48,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1705#true} is VALID [2022-04-28 04:29:48,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2022-04-28 04:29:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:29:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:29:48,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9654622] [2022-04-28 04:29:48,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:29:48,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886141477] [2022-04-28 04:29:48,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886141477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:29:48,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:29:48,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-28 04:29:48,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:29:48,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [948821261] [2022-04-28 04:29:48,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [948821261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:29:48,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:29:48,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:29:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687115893] [2022-04-28 04:29:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:29:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 04:29:48,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:29:48,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:48,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:48,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:29:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:29:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:29:48,503 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:49,269 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-28 04:29:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:29:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 04:29:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:29:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-28 04:29:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-28 04:29:49,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 48 transitions. [2022-04-28 04:29:49,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:49,319 INFO L225 Difference]: With dead ends: 57 [2022-04-28 04:29:49,319 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 04:29:49,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:29:49,320 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:29:49,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 152 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:29:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 04:29:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2022-04-28 04:29:49,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:29:49,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:49,344 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:49,344 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:49,346 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-28 04:29:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-28 04:29:49,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:49,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:49,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 49 states. [2022-04-28 04:29:49,346 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 49 states. [2022-04-28 04:29:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:29:49,347 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-28 04:29:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-28 04:29:49,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:29:49,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:29:49,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:29:49,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:29:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:29:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 04:29:49,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2022-04-28 04:29:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:29:49,349 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 04:29:49,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:29:49,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 04:29:49,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:29:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 04:29:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:29:49,396 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:29:49,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:29:49,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 04:29:49,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:49,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:29:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:29:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1603460440, now seen corresponding path program 3 times [2022-04-28 04:29:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:29:49,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1764042191] [2022-04-28 04:29:49,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:29:49,664 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:29:49,664 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:29:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1603460440, now seen corresponding path program 4 times [2022-04-28 04:29:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:29:49,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390163843] [2022-04-28 04:29:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:29:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:29:49,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:29:49,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466534651] [2022-04-28 04:29:49,681 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:29:49,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:29:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:29:49,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:29:49,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 04:29:49,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:29:49,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:29:49,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 04:29:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:29:49,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:29:54,869 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:31:26,665 WARN L232 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:31:49,054 WARN L232 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:32:15,186 WARN L232 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:32:29,808 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:32:33,869 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:32:37,316 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:32:43,812 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:33:38,846 WARN L232 SmtUtils]: Spent 32.36s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:33:50,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #62#return; {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret9 := main(); {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {2198#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {2198#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2198#true} is VALID [2022-04-28 04:33:50,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {2198#true} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2224#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:33:50,808 INFO L272 TraceCheckUtils]: 8: Hoare triple {2224#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2198#true} is VALID [2022-04-28 04:33:50,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {2198#true} ~cond := #in~cond; {2231#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:33:50,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {2231#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:33:50,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:33:50,812 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} {2224#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #58#return; {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:33:50,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:33:50,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2249#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-28 04:33:52,816 WARN L290 TraceCheckUtils]: 15: Hoare triple {2249#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2253#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} is UNKNOWN [2022-04-28 04:33:52,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {2253#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2253#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} is VALID [2022-04-28 04:33:52,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {2253#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2260#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} is VALID [2022-04-28 04:33:52,818 INFO L272 TraceCheckUtils]: 18: Hoare triple {2260#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2198#true} is VALID [2022-04-28 04:33:52,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {2198#true} ~cond := #in~cond; {2231#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:33:52,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:33:52,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:33:52,822 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} {2260#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} #58#return; {2276#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:33:52,823 INFO L290 TraceCheckUtils]: 23: Hoare triple {2276#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {2276#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:33:53,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {2276#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2283#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (* main_~Y~0 main_~x~0 2) (- 1)) (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)))} is VALID [2022-04-28 04:33:55,805 WARN L290 TraceCheckUtils]: 25: Hoare triple {2283#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (* main_~Y~0 main_~x~0 2) (- 1)) (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2287#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} is UNKNOWN [2022-04-28 04:33:55,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {2287#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2287#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} is VALID [2022-04-28 04:33:57,810 WARN L290 TraceCheckUtils]: 27: Hoare triple {2287#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2294#(or (and (= main_~xy~0 0) (or (and (exists ((main_~y~0 Int)) (= (mod (+ (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) main_~Y~0) 0)) (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0))) (= main_~X~0 0)) (and (not (= main_~X~0 0)) (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (* (- 1) (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)))) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-28 04:33:57,820 INFO L272 TraceCheckUtils]: 28: Hoare triple {2294#(or (and (= main_~xy~0 0) (or (and (exists ((main_~y~0 Int)) (= (mod (+ (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) main_~Y~0) 0)) (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0))) (= main_~X~0 0)) (and (not (= main_~X~0 0)) (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (* (- 1) (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)))) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (= (mod main_~xy~0 main_~X~0) 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:33:57,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {2298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:33:57,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {2302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2199#false} is VALID [2022-04-28 04:33:57,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2022-04-28 04:33:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 3 refuted. 3 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:33:57,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:34:08,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2022-04-28 04:34:08,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {2302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2199#false} is VALID [2022-04-28 04:34:08,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {2298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:34:08,114 INFO L272 TraceCheckUtils]: 28: Hoare triple {2318#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:34:08,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2318#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:34:08,115 INFO L290 TraceCheckUtils]: 26: Hoare triple {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:34:08,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {2249#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:34:08,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2249#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-28 04:34:08,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:34:08,120 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} {2337#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #58#return; {2242#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:34:08,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:34:08,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {2347#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2235#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:34:08,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {2198#true} ~cond := #in~cond; {2347#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:34:08,122 INFO L272 TraceCheckUtils]: 18: Hoare triple {2337#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {2198#true} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2337#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {2198#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {2198#true} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {2198#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {2198#true} assume !!(~x~0 <= ~X~0); {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2198#true} {2198#true} #58#return; {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {2198#true} assume !(0 == ~cond); {2198#true} is VALID [2022-04-28 04:34:08,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {2198#true} ~cond := #in~cond; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L272 TraceCheckUtils]: 8: Hoare triple {2198#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2198#true} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {2198#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {2198#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret9 := main(); {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #62#return; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2198#true} is VALID [2022-04-28 04:34:08,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2022-04-28 04:34:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 04:34:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:34:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390163843] [2022-04-28 04:34:08,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:34:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466534651] [2022-04-28 04:34:08,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466534651] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:34:08,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:34:08,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 18 [2022-04-28 04:34:08,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:34:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1764042191] [2022-04-28 04:34:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1764042191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:34:08,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:34:08,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:34:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657384078] [2022-04-28 04:34:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:34:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-28 04:34:08,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:34:08,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:34:15,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 26 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 04:34:15,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:34:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:34:15,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:34:15,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=236, Unknown=21, NotChecked=0, Total=306 [2022-04-28 04:34:15,311 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:34:21,738 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_main_~Y~0 (+ (- 1) c_main_~x~0))) (.cse1 (* (- 2) c_main_~X~0 c_main_~y~0)) (.cse0 (* (- 2) c_main_~Y~0)) (.cse5 (* (- 1) c_main_~X~0)) (.cse4 (= c_main_~Y~0 0)) (.cse3 (* c_main_~X~0 c_main_~y~0))) (and (or (= (mod (+ .cse0 (div (+ (* (- 1) .cse1) .cse0 (* (- 1) .cse2)) (- 2)) .cse3) c_main_~Y~0) 0) .cse4) (= (+ (* c_main_~Y~0 4) .cse2 .cse5 .cse1) c_main_~v~0) (or (= (mod (+ .cse0 (div (+ .cse5 (* (- 1) c_main_~v~0)) (- 2)) .cse3) c_main_~Y~0) 0) .cse4) (= (+ (* 2 (* c_main_~Y~0 c_main_~x~0)) (* 2 c_main_~Y~0)) (+ (* 2 .cse3) c_main_~v~0 c_main_~X~0)))) is different from true [2022-04-28 04:35:03,522 WARN L232 SmtUtils]: Spent 32.23s on a formula simplification. DAG size of input: 47 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:38:17,903 WARN L232 SmtUtils]: Spent 3.04m on a formula simplification. DAG size of input: 120 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:38:20,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:22,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:24,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:28,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:32,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:35,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:43,472 WARN L232 SmtUtils]: Spent 2.79m on a formula simplification. DAG size of input: 106 DAG size of output: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:41:45,692 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:49,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:52,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:41:52,104 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 04:41:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:41:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-28 04:41:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:41:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:41:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-28 04:41:52,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:41:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2022-04-28 04:41:52,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2022-04-28 04:42:01,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 31 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:01,173 INFO L225 Difference]: With dead ends: 46 [2022-04-28 04:42:01,173 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 04:42:01,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 534.2s TimeCoverageRelationStatistics Valid=95, Invalid=383, Unknown=32, NotChecked=42, Total=552 [2022-04-28 04:42:01,174 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:42:01,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 9 Unknown, 51 Unchecked, 19.0s Time] [2022-04-28 04:42:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 04:42:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-28 04:42:01,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:42:01,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:42:01,206 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:42:01,206 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:42:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:01,208 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-28 04:42:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-28 04:42:01,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:42:01,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:42:01,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-28 04:42:01,208 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-28 04:42:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:01,210 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-28 04:42:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-28 04:42:01,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:42:01,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:42:01,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:42:01,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:42:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:42:01,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 04:42:01,212 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2022-04-28 04:42:01,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:42:01,212 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 04:42:01,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:42:01,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 04:42:08,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 40 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 04:42:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:42:08,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:42:08,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:42:08,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 04:42:08,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:42:08,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:42:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:42:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1756989579, now seen corresponding path program 1 times [2022-04-28 04:42:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:42:08,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324285679] [2022-04-28 04:42:08,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:42:08,549 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:42:08,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:42:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1756989579, now seen corresponding path program 2 times [2022-04-28 04:42:08,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:42:08,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994697301] [2022-04-28 04:42:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:42:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:42:08,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:42:08,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058942036] [2022-04-28 04:42:08,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:42:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:42:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:42:08,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:42:08,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 04:42:08,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:42:08,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:42:08,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 04:42:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:42:08,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:42:08,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {2676#true} call ULTIMATE.init(); {2676#true} is VALID [2022-04-28 04:42:08,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {2676#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2676#true} is VALID [2022-04-28 04:42:08,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-28 04:42:08,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2676#true} {2676#true} #62#return; {2676#true} is VALID [2022-04-28 04:42:08,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {2676#true} call #t~ret9 := main(); {2676#true} is VALID [2022-04-28 04:42:08,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {2676#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,983 INFO L272 TraceCheckUtils]: 8: Hoare triple {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2676#true} is VALID [2022-04-28 04:42:08,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {2676#true} ~cond := #in~cond; {2676#true} is VALID [2022-04-28 04:42:08,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {2676#true} assume !(0 == ~cond); {2676#true} is VALID [2022-04-28 04:42:08,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-28 04:42:08,984 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2676#true} {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #58#return; {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {2696#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2724#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {2724#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2735#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:42:08,986 INFO L272 TraceCheckUtils]: 18: Hoare triple {2735#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2676#true} is VALID [2022-04-28 04:42:08,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {2676#true} ~cond := #in~cond; {2742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:42:08,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {2742#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:42:08,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:42:08,988 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} {2735#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #58#return; {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} is VALID [2022-04-28 04:42:08,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {2728#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2759#(and (= main_~x~0 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:42:08,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {2759#(and (= main_~x~0 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2763#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:42:08,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {2763#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2763#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:42:08,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {2763#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !(#t~post6 < 2);havoc #t~post6; {2763#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:42:08,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {2763#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2773#(and (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:42:08,992 INFO L272 TraceCheckUtils]: 29: Hoare triple {2773#(and (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:42:08,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:42:08,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2677#false} is VALID [2022-04-28 04:42:08,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {2677#false} assume !false; {2677#false} is VALID [2022-04-28 04:42:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:42:08,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:42:11,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {2677#false} assume !false; {2677#false} is VALID [2022-04-28 04:42:11,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {2781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2677#false} is VALID [2022-04-28 04:42:11,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:42:11,615 INFO L272 TraceCheckUtils]: 29: Hoare triple {2797#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:42:11,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {2801#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2797#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:42:11,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {2801#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} assume !(#t~post6 < 2);havoc #t~post6; {2801#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:42:11,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {2801#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2801#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:42:11,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {2811#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2801#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:42:11,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {2815#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2811#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:42:11,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {2815#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2815#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:42:11,623 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} {2822#(or (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #58#return; {2815#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:42:11,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:42:11,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {2832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2746#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:42:11,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {2676#true} ~cond := #in~cond; {2832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:42:11,624 INFO L272 TraceCheckUtils]: 18: Hoare triple {2822#(or (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2676#true} is VALID [2022-04-28 04:42:11,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2839#(or (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2822#(or (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:42:11,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {2839#(or (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2839#(or (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:42:11,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {2846#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2839#(or (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:42:11,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2846#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2))))} is VALID [2022-04-28 04:42:11,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} assume !!(~x~0 <= ~X~0); {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} is VALID [2022-04-28 04:42:11,713 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2676#true} {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} #58#return; {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} is VALID [2022-04-28 04:42:11,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-28 04:42:11,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {2676#true} assume !(0 == ~cond); {2676#true} is VALID [2022-04-28 04:42:11,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {2676#true} ~cond := #in~cond; {2676#true} is VALID [2022-04-28 04:42:11,713 INFO L272 TraceCheckUtils]: 8: Hoare triple {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2676#true} is VALID [2022-04-28 04:42:11,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} assume !!(#t~post6 < 2);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} is VALID [2022-04-28 04:42:11,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} is VALID [2022-04-28 04:42:11,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {2676#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2850#(or (not (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)) (+ main_~v~0 (* main_~Y~0 2)))) (= (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) (* (* main_~y~0 (+ main_~x~0 2)) 2) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 6))))} is VALID [2022-04-28 04:42:11,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {2676#true} call #t~ret9 := main(); {2676#true} is VALID [2022-04-28 04:42:11,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2676#true} {2676#true} #62#return; {2676#true} is VALID [2022-04-28 04:42:11,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {2676#true} assume true; {2676#true} is VALID [2022-04-28 04:42:11,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {2676#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(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2676#true} is VALID [2022-04-28 04:42:11,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {2676#true} call ULTIMATE.init(); {2676#true} is VALID [2022-04-28 04:42:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:42:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:42:11,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994697301] [2022-04-28 04:42:11,716 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:42:11,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058942036] [2022-04-28 04:42:11,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058942036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:42:11,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:42:11,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-04-28 04:42:11,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:42:11,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324285679] [2022-04-28 04:42:11,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324285679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:42:11,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:42:11,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:42:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956819411] [2022-04-28 04:42:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:42:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-28 04:42:11,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:42:11,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:42:11,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:11,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:42:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:42:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:42:11,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:42:11,747 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:42:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:12,430 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-04-28 04:42:12,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:42:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-28 04:42:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:42:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:42:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-28 04:42:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:42:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-28 04:42:12,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-28 04:42:12,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:12,490 INFO L225 Difference]: With dead ends: 67 [2022-04-28 04:42:12,490 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 04:42:12,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:42:12,491 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:42:12,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:42:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 04:42:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2022-04-28 04:42:12,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:42:12,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:42:12,538 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:42:12,538 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:42:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:12,540 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-28 04:42:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-28 04:42:12,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:42:12,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:42:12,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 60 states. [2022-04-28 04:42:12,541 INFO L87 Difference]: Start difference. First operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 60 states. [2022-04-28 04:42:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:12,543 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-04-28 04:42:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-28 04:42:12,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:42:12,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:42:12,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:42:12,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:42:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:42:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 04:42:12,545 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 33 [2022-04-28 04:42:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:42:12,545 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 04:42:12,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:42:12,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 04:42:19,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 51 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 04:42:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 04:42:19,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:42:19,319 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:42:19,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 04:42:19,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:42:19,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:42:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:42:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1857919347, now seen corresponding path program 1 times [2022-04-28 04:42:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:42:19,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875818920] [2022-04-28 04:42:19,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:42:19,623 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:42:19,623 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:42:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1857919347, now seen corresponding path program 2 times [2022-04-28 04:42:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:42:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488640925] [2022-04-28 04:42:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:42:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:42:19,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:42:19,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210158017] [2022-04-28 04:42:19,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:42:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:42:19,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:42:19,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:42:19,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 04:42:19,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:42:19,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 04:42:19,684 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 04:42:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 04:42:19,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 04:42:19,740 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 04:42:19,741 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 04:42:19,742 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:42:19,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 04:42:19,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 04:42:19,984 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 04:42:19,986 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-28 04:42:19,996 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 04:42:19,997 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-28 04:42:19,997 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:42:19,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:42:19 BoogieIcfgContainer [2022-04-28 04:42:19,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:42:19,999 INFO L158 Benchmark]: Toolchain (without parser) took 758946.03ms. Allocated memory was 173.0MB in the beginning and 209.7MB in the end (delta: 36.7MB). Free memory was 123.7MB in the beginning and 147.3MB in the end (delta: -23.6MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-28 04:42:19,999 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:42:19,999 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.33ms. Allocated memory is still 173.0MB. Free memory was 123.5MB in the beginning and 148.4MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:42:20,000 INFO L158 Benchmark]: Boogie Preprocessor took 27.35ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:42:20,000 INFO L158 Benchmark]: RCFGBuilder took 345.00ms. Allocated memory is still 173.0MB. Free memory was 146.8MB in the beginning and 135.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:42:20,000 INFO L158 Benchmark]: TraceAbstraction took 758317.39ms. Allocated memory was 173.0MB in the beginning and 209.7MB in the end (delta: 36.7MB). Free memory was 134.5MB in the beginning and 147.3MB in the end (delta: -12.9MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. [2022-04-28 04:42:20,001 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.13ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.33ms. Allocated memory is still 173.0MB. Free memory was 123.5MB in the beginning and 148.4MB in the end (delta: -24.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.35ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 146.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 345.00ms. Allocated memory is still 173.0MB. Free memory was 146.8MB in the beginning and 135.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 758317.39ms. Allocated memory was 173.0MB in the beginning and 209.7MB in the end (delta: 36.7MB). Free memory was 134.5MB in the beginning and 147.3MB in the end (delta: -12.9MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 [L31] EXPR counter++ [L31] COND TRUE counter++<2 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) [L14] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) [L35] COND FALSE !(!(x <= X)) [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y [L45] x++ [L31] EXPR counter++ [L31] COND TRUE counter++<2 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) [L14] COND FALSE !(!(cond)) [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) [L35] COND FALSE !(!(x <= X)) [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ [L45] x++ [L31] EXPR counter++ [L31] COND FALSE !(counter++<2) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) [L14] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 758.2s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 468.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 19.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 19.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 51 IncrementalHoareTripleChecker+Unchecked, 600 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 938 IncrementalHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 156 mSDtfsCounter, 938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 239 SyntacticMatches, 11 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 535.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 04:42:20,120 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...