/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:43:15,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:43:15,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:43:15,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:43:15,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:43:15,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:43:15,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:43:15,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:43:15,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:43:15,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:43:15,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:43:15,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:43:15,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:43:15,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:43:15,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:43:15,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:43:15,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:43:15,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:43:15,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:43:15,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:43:15,569 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:43:15,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:43:15,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:43:15,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:43:15,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:43:15,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:43:15,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:43:15,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:43:15,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:43:15,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:43:15,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:43:15,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:43:15,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:43:15,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:43:15,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:43:15,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:43:15,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:43:15,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:43:15,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:43:15,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:43:15,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:43:15,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:43:15,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:43:15,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:43:15,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:43:15,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:43:15,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:43:15,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:43:15,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:43:15,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:43:15,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:43:15,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:43:15,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:43:15,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:43:15,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:43:15,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:43:15,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:43:15,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:43:15,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:43:15,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:43:15,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:43:15,598 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:43:15,598 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:43:15,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:43:15,598 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:43:15,598 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 10:43:15,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:43:15,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:43:15,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:43:15,778 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:43:15,779 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:43:15,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-28 10:43:15,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eec99168/d225f52d63e0464aa6d2f714e06e5fc6/FLAG05cd971b0 [2022-04-28 10:43:16,174 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:43:16,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-28 10:43:16,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eec99168/d225f52d63e0464aa6d2f714e06e5fc6/FLAG05cd971b0 [2022-04-28 10:43:16,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eec99168/d225f52d63e0464aa6d2f714e06e5fc6 [2022-04-28 10:43:16,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:43:16,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:43:16,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:43:16,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:43:16,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:43:16,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50079a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16, skipping insertion in model container [2022-04-28 10:43:16,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:43:16,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:43:16,396 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/bresenham-ll.c[597,610] [2022-04-28 10:43:16,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:43:16,431 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:43:16,443 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/bresenham-ll.c[597,610] [2022-04-28 10:43:16,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:43:16,469 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:43:16,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16 WrapperNode [2022-04-28 10:43:16,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:43:16,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:43:16,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:43:16,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:43:16,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:43:16,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:43:16,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:43:16,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:43:16,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (1/1) ... [2022-04-28 10:43:16,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:43:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:16,537 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 10:43:16,547 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 10:43:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:43:16,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:43:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:43:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:43:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:43:16,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:43:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:43:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:43:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:43:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:43:16,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:43:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:43:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:43:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:43:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:43:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:43:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:43:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:43:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:43:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:43:16,619 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:43:16,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:43:16,778 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:43:16,794 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:43:16,794 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:43:16,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:43:16 BoogieIcfgContainer [2022-04-28 10:43:16,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:43:16,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:43:16,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:43:16,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:43:16,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:43:16" (1/3) ... [2022-04-28 10:43:16,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bc80f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:43:16, skipping insertion in model container [2022-04-28 10:43:16,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:43:16" (2/3) ... [2022-04-28 10:43:16,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bc80f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:43:16, skipping insertion in model container [2022-04-28 10:43:16,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:43:16" (3/3) ... [2022-04-28 10:43:16,815 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll.c [2022-04-28 10:43:16,825 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:43:16,825 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:43:16,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:43:16,888 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@17aca07d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f2bafc8 [2022-04-28 10:43:16,888 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:43:16,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 10:43:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:43:16,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:16,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:16,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:16,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 1 times [2022-04-28 10:43:16,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:16,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373770839] [2022-04-28 10:43:16,927 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:43:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 2 times [2022-04-28 10:43:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024418818] [2022-04-28 10:43:16,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:16,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:17,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:17,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [339892016] [2022-04-28 10:43:17,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:17,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:17,028 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 10:43:17,030 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 10:43:17,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:43:17,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:17,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:43:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:17,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:17,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-28 10:43:17,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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); {27#true} is VALID [2022-04-28 10:43:17,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 10:43:17,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #61#return; {27#true} is VALID [2022-04-28 10:43:17,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-28 10:43:17,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#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; {47#(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 10:43:17,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {51#(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 10:43:17,322 INFO L272 TraceCheckUtils]: 7: Hoare triple {51#(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)); {55#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:17,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {59#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:17,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28#false} is VALID [2022-04-28 10:43:17,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 10:43:17,325 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 10:43:17,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:43:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:17,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024418818] [2022-04-28 10:43:17,325 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339892016] [2022-04-28 10:43:17,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339892016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:17,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:17,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:17,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:17,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373770839] [2022-04-28 10:43:17,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373770839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:17,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:17,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:43:17,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954161680] [2022-04-28 10:43:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-28 10:43:17,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:17,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 10:43:17,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:17,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:43:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:17,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:43:17,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:43:17,373 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 10:43:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:17,622 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-04-28 10:43:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:43:17,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-28 10:43:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 10:43:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 10:43:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 10:43:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 10:43:17,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 10:43:17,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:17,692 INFO L225 Difference]: With dead ends: 55 [2022-04-28 10:43:17,692 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 10:43:17,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:43:17,696 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:17,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 10:43:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-28 10:43:17,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:17,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 10:43:17,724 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 10:43:17,725 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 10:43:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:17,728 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 10:43:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 10:43:17,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:17,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:17,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 27 states. [2022-04-28 10:43:17,729 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 27 states. [2022-04-28 10:43:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:17,731 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 10:43:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 10:43:17,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:17,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:17,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:17,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 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 10:43:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 10:43:17,738 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2022-04-28 10:43:17,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:17,739 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 10:43:17,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 10:43:17,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 10:43:17,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 10:43:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:43:17,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:17,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:17,788 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 10:43:17,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 10:43:17,982 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 1 times [2022-04-28 10:43:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:17,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695831850] [2022-04-28 10:43:18,058 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:18,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 2 times [2022-04-28 10:43:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:18,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33773916] [2022-04-28 10:43:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:18,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:18,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196048593] [2022-04-28 10:43:18,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:18,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:18,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:18,071 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 10:43:18,099 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 10:43:18,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:18,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:18,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:43:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:18,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:18,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-28 10:43:18,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#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); {285#true} is VALID [2022-04-28 10:43:18,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-28 10:43:18,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #61#return; {285#true} is VALID [2022-04-28 10:43:18,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret8 := main(); {285#true} is VALID [2022-04-28 10:43:18,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#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; {305#(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 10:43:18,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {305#(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 10:43:18,340 INFO L272 TraceCheckUtils]: 7: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~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)); {285#true} is VALID [2022-04-28 10:43:18,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} ~cond := #in~cond; {285#true} is VALID [2022-04-28 10:43:18,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume !(0 == ~cond); {285#true} is VALID [2022-04-28 10:43:18,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-28 10:43:18,342 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {285#true} {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #57#return; {305#(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 10:43:18,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {305#(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 10:43:18,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {330#(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 10:43:18,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {330#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {334#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 10:43:18,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {334#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {338#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 10:43:18,346 INFO L272 TraceCheckUtils]: 16: Hoare triple {338#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~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 then 1 else 0)); {342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:18,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:18,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-28 10:43:18,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-28 10:43:18,347 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 10:43:18,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:18,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-28 10:43:18,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-28 10:43:18,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:18,508 INFO L272 TraceCheckUtils]: 16: Hoare triple {362#(= (+ (* 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)); {342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:18,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {362#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 10:43:18,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(= (+ (* (* 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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {366#(= (+ (* 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 10:43:18,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#(= (+ (* 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; {370#(= (+ (* (* 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 10:43:18,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#(= (+ (* 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); {366#(= (+ (* 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 10:43:18,513 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {285#true} {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #57#return; {366#(= (+ (* 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 10:43:18,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-28 10:43:18,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume !(0 == ~cond); {285#true} is VALID [2022-04-28 10:43:18,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} ~cond := #in~cond; {285#true} is VALID [2022-04-28 10:43:18,514 INFO L272 TraceCheckUtils]: 7: Hoare triple {366#(= (+ (* 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)); {285#true} is VALID [2022-04-28 10:43:18,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {366#(= (+ (* 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 10:43:18,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#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; {366#(= (+ (* 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 10:43:18,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret8 := main(); {285#true} is VALID [2022-04-28 10:43:18,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #61#return; {285#true} is VALID [2022-04-28 10:43:18,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-28 10:43:18,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#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); {285#true} is VALID [2022-04-28 10:43:18,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-28 10:43:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:43:18,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33773916] [2022-04-28 10:43:18,520 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196048593] [2022-04-28 10:43:18,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196048593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:18,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:43:18,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 10:43:18,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:18,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695831850] [2022-04-28 10:43:18,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695831850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:18,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:18,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:43:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651314111] [2022-04-28 10:43:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:18,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 20 [2022-04-28 10:43:18,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:18,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:18,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:18,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:43:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:18,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:43:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:43:18,540 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:18,818 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-28 10:43:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:43:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 20 [2022-04-28 10:43:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:43:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:43:18,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 10:43:18,857 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 10:43:18,858 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:43:18,859 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:43:18,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 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 10:43:18,860 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:18,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:43:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-28 10:43:18,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:18,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:18,872 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:18,872 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:18,874 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 10:43:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 10:43:18,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:18,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:18,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 36 states. [2022-04-28 10:43:18,875 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 36 states. [2022-04-28 10:43:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:18,877 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 10:43:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-28 10:43:18,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:18,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:18,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:18,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-28 10:43:18,879 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2022-04-28 10:43:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:18,879 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-28 10:43:18,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:18,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-28 10:43:18,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 10:43:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:43:18,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:18,908 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:18,929 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 10:43:19,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 10:43:19,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607563, now seen corresponding path program 1 times [2022-04-28 10:43:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:19,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818729600] [2022-04-28 10:43:19,261 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:19,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607563, now seen corresponding path program 2 times [2022-04-28 10:43:19,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:19,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856405958] [2022-04-28 10:43:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:19,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:19,280 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:19,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984925568] [2022-04-28 10:43:19,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:19,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:19,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:19,296 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 10:43:19,296 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 10:43:19,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:19,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:19,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:43:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:19,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:19,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2022-04-28 10:43:19,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#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); {641#true} is VALID [2022-04-28 10:43:19,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-28 10:43:19,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #61#return; {641#true} is VALID [2022-04-28 10:43:19,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2022-04-28 10:43:19,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#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; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:43:19,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:43:19,489 INFO L272 TraceCheckUtils]: 7: Hoare triple {661#(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)); {641#true} is VALID [2022-04-28 10:43:19,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} ~cond := #in~cond; {641#true} is VALID [2022-04-28 10:43:19,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(0 == ~cond); {641#true} is VALID [2022-04-28 10:43:19,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-28 10:43:19,490 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {641#true} {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #57#return; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:43:19,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:43:19,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {661#(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~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {686#(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 10:43:19,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {690#(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 10:43:19,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {690#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {694#(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 10:43:19,496 INFO L272 TraceCheckUtils]: 16: Hoare triple {694#(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)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:19,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:19,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {642#false} is VALID [2022-04-28 10:43:19,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-04-28 10:43:19,497 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 10:43:19,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:19,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-04-28 10:43:19,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {642#false} is VALID [2022-04-28 10:43:19,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:19,667 INFO L272 TraceCheckUtils]: 16: Hoare triple {718#(= (+ (* 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)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:19,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {722#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {718#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 10:43:19,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(= (+ (* (* 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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {722#(= (+ (* 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 10:43:19,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(= (+ (* 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~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {726#(= (+ (* (* 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 10:43:19,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {722#(= (+ (* 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); {722#(= (+ (* 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 10:43:19,730 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {641#true} {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #57#return; {722#(= (+ (* 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 10:43:19,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-28 10:43:19,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(0 == ~cond); {641#true} is VALID [2022-04-28 10:43:19,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} ~cond := #in~cond; {641#true} is VALID [2022-04-28 10:43:19,731 INFO L272 TraceCheckUtils]: 7: Hoare triple {722#(= (+ (* 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)); {641#true} is VALID [2022-04-28 10:43:19,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {722#(= (+ (* 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 10:43:19,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#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; {722#(= (+ (* 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 10:43:19,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2022-04-28 10:43:19,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #61#return; {641#true} is VALID [2022-04-28 10:43:19,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-28 10:43:19,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#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); {641#true} is VALID [2022-04-28 10:43:19,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2022-04-28 10:43:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:43:19,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:19,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856405958] [2022-04-28 10:43:19,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:19,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984925568] [2022-04-28 10:43:19,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984925568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:19,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:43:19,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 10:43:19,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:19,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818729600] [2022-04-28 10:43:19,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818729600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:19,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:19,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:43:19,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430750522] [2022-04-28 10:43:19,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 20 [2022-04-28 10:43:19,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:19,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:19,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:19,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:43:19,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:43:19,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:43:19,752 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:20,029 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-28 10:43:20,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:43:20,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 20 [2022-04-28 10:43:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:43:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-28 10:43:20,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-28 10:43:20,068 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 10:43:20,069 INFO L225 Difference]: With dead ends: 48 [2022-04-28 10:43:20,069 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:43:20,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 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 10:43:20,070 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:20,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:43:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:43:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-04-28 10:43:20,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:20,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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 10:43:20,085 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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 10:43:20,086 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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 10:43:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:20,087 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 10:43:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:43:20,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:20,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:20,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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 10:43:20,088 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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 10:43:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:20,090 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 10:43:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:43:20,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:20,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:20,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:20,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 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 10:43:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-28 10:43:20,092 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2022-04-28 10:43:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:20,092 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-28 10:43:20,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 10:43:20,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-28 10:43:20,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-28 10:43:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:43:20,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:20,127 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:20,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 10:43:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:20,336 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 1 times [2022-04-28 10:43:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:20,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690196086] [2022-04-28 10:43:20,396 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:20,396 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:20,396 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 2 times [2022-04-28 10:43:20,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:20,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009584305] [2022-04-28 10:43:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:20,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:20,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:20,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [295179786] [2022-04-28 10:43:20,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:43:20,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:20,431 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 10:43:20,432 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 10:43:20,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:43:20,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:20,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:43:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:20,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:20,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2022-04-28 10:43:20,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#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); {1047#true} is VALID [2022-04-28 10:43:20,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-28 10:43:20,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2022-04-28 10:43:20,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret8 := main(); {1047#true} is VALID [2022-04-28 10:43:20,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {1047#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; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:43:20,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:43:20,828 INFO L272 TraceCheckUtils]: 7: Hoare triple {1067#(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)); {1047#true} is VALID [2022-04-28 10:43:20,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#true} ~cond := #in~cond; {1047#true} is VALID [2022-04-28 10:43:20,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !(0 == ~cond); {1047#true} is VALID [2022-04-28 10:43:20,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-28 10:43:20,829 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1047#true} {1067#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:43:20,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1089#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:43:20,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#(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~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1093#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:43:20,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1097#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:43:20,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* 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 10:43:20,837 INFO L272 TraceCheckUtils]: 16: Hoare triple {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* 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)); {1047#true} is VALID [2022-04-28 10:43:20,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {1047#true} ~cond := #in~cond; {1108#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:20,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {1108#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:20,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:20,839 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* 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)))} #57#return; {1119#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) 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)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:43:20,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) 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)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {1123#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) 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)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:43:20,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) 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)) (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; {1127#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 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 10:43:20,844 INFO L272 TraceCheckUtils]: 23: Hoare triple {1127#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 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)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:20,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:20,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1048#false} is VALID [2022-04-28 10:43:20,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2022-04-28 10:43:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:43:20,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:43:21,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2022-04-28 10:43:21,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1048#false} is VALID [2022-04-28 10:43:21,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:43:21,593 INFO L272 TraceCheckUtils]: 23: Hoare triple {1151#(= (+ (* 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)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:43:21,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {1155#(= (+ (* 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; {1151#(= (+ (* 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 10:43:21,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {1159#(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); {1155#(= (+ (* 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 10:43:21,595 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} {1163#(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)))))} #57#return; {1159#(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 10:43:21,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:21,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:43:21,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1047#true} ~cond := #in~cond; {1173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:43:21,597 INFO L272 TraceCheckUtils]: 16: Hoare triple {1163#(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)); {1047#true} is VALID [2022-04-28 10:43:21,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#(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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1163#(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 10:43:21,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1184#(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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1180#(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 10:43:21,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(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~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1184#(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 10:43:21,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {1047#true} assume !!(~x~0 <= ~X~0); {1188#(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 10:43:21,602 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1047#true} {1047#true} #57#return; {1047#true} is VALID [2022-04-28 10:43:21,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !(0 == ~cond); {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#true} ~cond := #in~cond; {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L272 TraceCheckUtils]: 7: Hoare triple {1047#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {1047#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1047#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; {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret8 := main(); {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-28 10:43:21,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#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); {1047#true} is VALID [2022-04-28 10:43:21,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2022-04-28 10:43:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:43:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:43:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009584305] [2022-04-28 10:43:21,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:43:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295179786] [2022-04-28 10:43:21,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295179786] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:43:21,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:43:21,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-28 10:43:21,605 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:43:21,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690196086] [2022-04-28 10:43:21,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690196086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:43:21,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:43:21,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:43:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169400847] [2022-04-28 10:43:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:43:21,606 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 27 [2022-04-28 10:43:21,606 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:43:21,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 10:43:21,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:43:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:43:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:43:21,627 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 10:43:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:22,161 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-28 10:43:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:43:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 27 [2022-04-28 10:43:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:43:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 10:43:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-28 10:43:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 10:43:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-28 10:43:22,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2022-04-28 10:43:22,197 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 10:43:22,198 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:43:22,199 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 10:43:22,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-04-28 10:43:22,200 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:43:22,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 99 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:43:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 10:43:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-04-28 10:43:22,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:43:22,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:22,213 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:22,213 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:22,214 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 10:43:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 10:43:22,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:22,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:22,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 45 states. [2022-04-28 10:43:22,215 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 45 states. [2022-04-28 10:43:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:43:22,217 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 10:43:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 10:43:22,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:43:22,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:43:22,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:43:22,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:43:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 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 10:43:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-28 10:43:22,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2022-04-28 10:43:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:43:22,219 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-28 10:43:22,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 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 10:43:22,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-28 10:43:22,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:43:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-28 10:43:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:43:22,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:43:22,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:43:22,270 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 10:43:22,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:22,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:43:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:43:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1671149437, now seen corresponding path program 3 times [2022-04-28 10:43:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:43:22,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254692744] [2022-04-28 10:43:22,508 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:43:22,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:43:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1671149437, now seen corresponding path program 4 times [2022-04-28 10:43:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:43:22,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215511331] [2022-04-28 10:43:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:43:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:43:22,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:43:22,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398471958] [2022-04-28 10:43:22,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:43:22,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:43:22,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:43:22,520 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 10:43:22,522 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 10:43:22,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:43:22,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:43:22,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:43:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:43:22,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:43:32,008 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:43:34,946 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:43:44,995 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:44:29,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2022-04-28 10:44:29,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#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); {1506#true} is VALID [2022-04-28 10:44:29,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-28 10:44:29,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #61#return; {1506#true} is VALID [2022-04-28 10:44:29,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret8 := main(); {1506#true} is VALID [2022-04-28 10:44:29,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#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; {1506#true} is VALID [2022-04-28 10:44:29,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 10:44:29,416 INFO L272 TraceCheckUtils]: 7: Hoare triple {1529#(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)); {1506#true} is VALID [2022-04-28 10:44:29,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} ~cond := #in~cond; {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:29,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:29,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:29,418 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1547#(= (+ (* 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 10:44:29,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {1547#(= (+ (* 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); {1547#(= (+ (* 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 10:44:29,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {1547#(= (+ (* 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; {1554#(= 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 10:44:29,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(= 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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* 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 10:44:29,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1561#(and (= (+ (* 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_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 10:44:29,421 INFO L272 TraceCheckUtils]: 16: Hoare triple {1561#(and (= (+ (* 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_~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)); {1506#true} is VALID [2022-04-28 10:44:29,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} ~cond := #in~cond; {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:29,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:29,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:29,423 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1561#(and (= (+ (* 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_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1547#(= (+ (* 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 10:44:29,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(= (+ (* 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); {1547#(= (+ (* 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 10:44:29,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(= (+ (* 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; {1554#(= 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 10:44:29,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(= 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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* 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 10:44:31,428 WARN L290 TraceCheckUtils]: 24: Hoare triple {1547#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1589#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (+ (* (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)))) (and (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 main_~yx~0 main_~Y~0) 0) (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) (+ (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 2))) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-28 10:44:31,433 INFO L272 TraceCheckUtils]: 25: Hoare triple {1589#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (+ (* (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)))) (and (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 main_~yx~0 main_~Y~0) 0) (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) (+ (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 2))) (not (= main_~Y~0 0)))) (not (= main_~X~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)); {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:31,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:31,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {1597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1507#false} is VALID [2022-04-28 10:44:31,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-04-28 10:44:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 10:44:31,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:44:34,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-04-28 10:44:34,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {1597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1507#false} is VALID [2022-04-28 10:44:34,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:44:34,839 INFO L272 TraceCheckUtils]: 25: Hoare triple {1613#(= (+ (* 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)); {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:44:34,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {1547#(= (+ (* 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 !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1613#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 10:44:34,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(= 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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* 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 10:44:34,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(= (+ (* 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; {1554#(= 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 10:44:34,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(= (+ (* 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); {1547#(= (+ (* 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 10:44:34,844 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1629#(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)))))} #57#return; {1547#(= (+ (* 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 10:44:34,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:34,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {1639#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:44:34,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} ~cond := #in~cond; {1639#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:44:34,845 INFO L272 TraceCheckUtils]: 16: Hoare triple {1629#(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)); {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1629#(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 10:44:34,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {1506#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {1506#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1506#true} assume !!(~x~0 <= ~X~0); {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1506#true} {1506#true} #57#return; {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#true} assume !(0 == ~cond); {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} ~cond := #in~cond; {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L272 TraceCheckUtils]: 7: Hoare triple {1506#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-28 10:44:34,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#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; {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret8 := main(); {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #61#return; {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#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); {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2022-04-28 10:44:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:44:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:44:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215511331] [2022-04-28 10:44:34,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:44:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398471958] [2022-04-28 10:44:34,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398471958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:44:34,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:44:34,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2022-04-28 10:44:34,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:44:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254692744] [2022-04-28 10:44:34,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254692744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:44:34,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:44:34,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:44:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395747583] [2022-04-28 10:44:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:44:34,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 10:44:34,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:44:34,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:44:36,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:44:36,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:44:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:44:36,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:44:36,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-04-28 10:44:36,873 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:45:09,472 WARN L232 SmtUtils]: Spent 32.44s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 10:45:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:09,669 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-28 10:45:09,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:45:09,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 10:45:09,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:45:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:45:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 10:45:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:45:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-28 10:45:09,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-28 10:45:11,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:11,739 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:45:11,739 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:45:11,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2022-04-28 10:45:11,740 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:45:11,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-04-28 10:45:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:45:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 10:45:11,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:45:11,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 10:45:11,758 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 10:45:11,758 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 10:45:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:11,759 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 10:45:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 10:45:11,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:11,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:11,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 37 states. [2022-04-28 10:45:11,760 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 37 states. [2022-04-28 10:45:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:45:11,761 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 10:45:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 10:45:11,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:45:11,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:45:11,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:45:11,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:45:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 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 10:45:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 10:45:11,762 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 29 [2022-04-28 10:45:11,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:45:11,762 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 10:45:11,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:45:11,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 10:45:13,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:45:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 10:45:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:45:13,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:45:13,838 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:45:13,854 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 10:45:14,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:14,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:45:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:45:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 1 times [2022-04-28 10:45:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:45:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697326293] [2022-04-28 10:45:14,100 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:45:14,100 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:45:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 2 times [2022-04-28 10:45:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:45:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414276071] [2022-04-28 10:45:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:45:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:45:14,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:45:14,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444920813] [2022-04-28 10:45:14,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:45:14,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:45:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:45:14,111 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 10:45:14,112 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 10:45:14,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:45:14,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:45:14,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:45:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:45:14,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:45:29,338 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:45:35,472 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:45:57,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-28 10:45:57,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#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); {1929#true} is VALID [2022-04-28 10:45:57,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 10:45:57,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #61#return; {1929#true} is VALID [2022-04-28 10:45:57,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret8 := main(); {1929#true} is VALID [2022-04-28 10:45:57,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#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; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,902 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#(= 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)); {1929#true} is VALID [2022-04-28 10:45:57,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-28 10:45:57,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-28 10:45:57,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 10:45:57,903 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,904 INFO L272 TraceCheckUtils]: 16: Hoare triple {1949#(= 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)); {1929#true} is VALID [2022-04-28 10:45:57,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-28 10:45:57,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-28 10:45:57,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 10:45:57,905 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:45:57,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2007#(and (= (* 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 10:45:57,907 INFO L272 TraceCheckUtils]: 25: Hoare triple {2007#(and (= (* 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)); {1929#true} is VALID [2022-04-28 10:45:57,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {1929#true} ~cond := #in~cond; {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:45:57,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:45:57,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:45:57,909 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {2025#(and (= (+ (* 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_~y~0 0))} is VALID [2022-04-28 10:45:57,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {2025#(and (= (+ (* 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_~y~0 0))} assume !(~x~0 <= ~X~0); {2025#(and (= (+ (* 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_~y~0 0))} is VALID [2022-04-28 10:45:59,912 WARN L290 TraceCheckUtils]: 31: Hoare triple {2025#(and (= (+ (* 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_~y~0 0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2032#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is UNKNOWN [2022-04-28 10:45:59,914 INFO L272 TraceCheckUtils]: 32: Hoare triple {2032#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~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)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:45:59,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:45:59,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1930#false} is VALID [2022-04-28 10:45:59,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-28 10:45:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:45:59,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:46:07,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-28 10:46:07,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1930#false} is VALID [2022-04-28 10:46:07,191 INFO L290 TraceCheckUtils]: 33: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:46:07,191 INFO L272 TraceCheckUtils]: 32: Hoare triple {2056#(= (+ (* 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)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:46:07,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {2060#(= (+ (* 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; {2056#(= (+ (* 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 10:46:07,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {2060#(= (+ (* 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); {2060#(= (+ (* 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 10:46:07,197 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2067#(= (+ (* 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))))} #57#return; {2060#(= (+ (* 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 10:46:07,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:46:07,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {2077#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:46:07,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {1929#true} ~cond := #in~cond; {2077#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:46:07,199 INFO L272 TraceCheckUtils]: 25: Hoare triple {2067#(= (+ (* 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)); {1929#true} is VALID [2022-04-28 10:46:07,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2067#(= (+ (* 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 10:46:07,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,202 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 10:46:07,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-28 10:46:07,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-28 10:46:07,202 INFO L272 TraceCheckUtils]: 16: Hoare triple {1949#(= 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)); {1929#true} is VALID [2022-04-28 10:46:07,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,212 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 10:46:07,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-28 10:46:07,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-28 10:46:07,213 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#(= 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)); {1929#true} is VALID [2022-04-28 10:46:07,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#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; {1949#(= main_~y~0 0)} is VALID [2022-04-28 10:46:07,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret8 := main(); {1929#true} is VALID [2022-04-28 10:46:07,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #61#return; {1929#true} is VALID [2022-04-28 10:46:07,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-28 10:46:07,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#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); {1929#true} is VALID [2022-04-28 10:46:07,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-28 10:46:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:46:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414276071] [2022-04-28 10:46:07,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:46:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444920813] [2022-04-28 10:46:07,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444920813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:46:07,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:46:07,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 10:46:07,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:46:07,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697326293] [2022-04-28 10:46:07,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697326293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:07,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:07,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:46:07,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926990326] [2022-04-28 10:46:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:46:07,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 36 [2022-04-28 10:46:07,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:46:07,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 10:46:09,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:09,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:46:09,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:09,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:46:09,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:46:09,239 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 10:46:11,281 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 10:46:15,351 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 10:46:17,362 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 10:46:19,376 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 10:46:21,479 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 10:46:23,536 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 10:46:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:25,669 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-28 10:46:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:46:25,669 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 36 [2022-04-28 10:46:25,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 10:46:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-28 10:46:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 10:46:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-28 10:46:25,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-28 10:46:27,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:27,707 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:46:27,707 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:46:27,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2022-04-28 10:46:27,708 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:27,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 12.1s Time] [2022-04-28 10:46:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:46:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-28 10:46:27,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:27,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:27,727 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:27,727 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:27,729 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 10:46:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:46:27,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:27,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:27,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-28 10:46:27,730 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-28 10:46:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:27,731 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-28 10:46:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:46:27,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:27,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:27,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:27,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:46:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-28 10:46:27,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2022-04-28 10:46:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:27,733 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-28 10:46:27,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 10:46:27,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-28 10:46:31,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-28 10:46:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:46:31,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:31,905 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:31,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 10:46:32,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:32,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:32,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:32,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1189350692, now seen corresponding path program 1 times [2022-04-28 10:46:32,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:32,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406348806] [2022-04-28 10:46:32,199 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:46:32,199 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:46:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1189350692, now seen corresponding path program 2 times [2022-04-28 10:46:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501329939] [2022-04-28 10:46:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:32,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:46:32,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735380969] [2022-04-28 10:46:32,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:46:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:32,224 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 10:46:32,225 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 10:46:32,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:46:32,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:32,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:46:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:32,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:32,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2022-04-28 10:46:32,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#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); {2452#true} is VALID [2022-04-28 10:46:32,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:32,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #61#return; {2452#true} is VALID [2022-04-28 10:46:32,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret8 := main(); {2452#true} is VALID [2022-04-28 10:46:32,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {2452#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; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 10:46:32,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 10:46:32,952 INFO L272 TraceCheckUtils]: 7: Hoare triple {2472#(and (<= main_~x~0 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)); {2452#true} is VALID [2022-04-28 10:46:32,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-28 10:46:32,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-28 10:46:32,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:32,953 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #57#return; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 10:46:32,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 10:46:32,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2497#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 10:46:32,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {2497#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 10:46:32,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 10:46:32,956 INFO L272 TraceCheckUtils]: 16: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-28 10:46:32,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-28 10:46:32,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-28 10:46:32,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:32,956 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2452#true} {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #57#return; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 10:46:32,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 10:46:32,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2526#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 10:46:32,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 10:46:32,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 10:46:32,958 INFO L272 TraceCheckUtils]: 25: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-28 10:46:32,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-28 10:46:32,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-28 10:46:32,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:32,967 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2452#true} {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #57#return; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 10:46:32,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {2453#false} is VALID [2022-04-28 10:46:32,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {2453#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2453#false} is VALID [2022-04-28 10:46:32,968 INFO L272 TraceCheckUtils]: 32: Hoare triple {2453#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)); {2453#false} is VALID [2022-04-28 10:46:32,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2022-04-28 10:46:32,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2022-04-28 10:46:32,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-04-28 10:46:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:46:32,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:46:33,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-04-28 10:46:33,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2022-04-28 10:46:33,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2022-04-28 10:46:33,211 INFO L272 TraceCheckUtils]: 32: Hoare triple {2453#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)); {2453#false} is VALID [2022-04-28 10:46:33,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {2453#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2453#false} is VALID [2022-04-28 10:46:33,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {2582#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {2453#false} is VALID [2022-04-28 10:46:33,212 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2452#true} {2582#(<= main_~x~0 main_~X~0)} #57#return; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 10:46:33,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:33,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-28 10:46:33,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-28 10:46:33,213 INFO L272 TraceCheckUtils]: 25: Hoare triple {2582#(<= main_~x~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)); {2452#true} is VALID [2022-04-28 10:46:33,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {2582#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 10:46:33,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 10:46:33,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2604#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 10:46:33,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 10:46:33,215 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2452#true} {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #57#return; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 10:46:33,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:33,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-28 10:46:33,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-28 10:46:33,215 INFO L272 TraceCheckUtils]: 16: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) 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)); {2452#true} is VALID [2022-04-28 10:46:33,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 10:46:33,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {2633#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 10:46:33,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2633#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 10:46:33,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 10:46:33,218 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #57#return; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 10:46:33,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:33,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-28 10:46:33,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-28 10:46:33,218 INFO L272 TraceCheckUtils]: 7: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-28 10:46:33,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 10:46:33,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {2452#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; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 10:46:33,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret8 := main(); {2452#true} is VALID [2022-04-28 10:46:33,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #61#return; {2452#true} is VALID [2022-04-28 10:46:33,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-28 10:46:33,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#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); {2452#true} is VALID [2022-04-28 10:46:33,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2022-04-28 10:46:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 10:46:33,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:46:33,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501329939] [2022-04-28 10:46:33,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:46:33,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735380969] [2022-04-28 10:46:33,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735380969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:46:33,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:46:33,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 10:46:33,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:46:33,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406348806] [2022-04-28 10:46:33,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406348806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:46:33,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:46:33,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:46:33,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943932535] [2022-04-28 10:46:33,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:46:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-28 10:46:33,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:46:33,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:46:33,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:33,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:46:33,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:33,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:46:33,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:46:33,246 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:46:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:33,480 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 10:46:33,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:46:33,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-28 10:46:33,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:46:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:46:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-28 10:46:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:46:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-28 10:46:33,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-28 10:46:33,520 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 10:46:33,521 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:46:33,521 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:46:33,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:46:33,522 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:46:33,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:46:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:46:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-04-28 10:46:33,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:46:33,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:46:33,565 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:46:33,565 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:46:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:33,566 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 10:46:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 10:46:33,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:33,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:33,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-28 10:46:33,567 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-28 10:46:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:46:33,568 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-28 10:46:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-28 10:46:33,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:46:33,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:46:33,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:46:33,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:46:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:46:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-28 10:46:33,570 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 36 [2022-04-28 10:46:33,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:46:33,570 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-28 10:46:33,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:46:33,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 57 transitions. [2022-04-28 10:46:39,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 54 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 10:46:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-28 10:46:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:46:39,765 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:46:39,765 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:46:39,783 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 10:46:39,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:39,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:46:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:46:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 3 times [2022-04-28 10:46:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:46:39,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [362025979] [2022-04-28 10:46:40,045 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:46:40,045 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:46:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 4 times [2022-04-28 10:46:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:46:40,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779811218] [2022-04-28 10:46:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:46:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:46:40,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:46:40,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696183737] [2022-04-28 10:46:40,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:46:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:46:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:46:40,060 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 10:46:40,079 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 10:46:40,565 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:46:40,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:46:40,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:46:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:46:40,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:46:53,364 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:47:01,566 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:47:07,585 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:47:36,732 WARN L232 SmtUtils]: Spent 22.98s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 10:55:25,756 WARN L833 $PredicateComparison]: unable to prove that (or (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~v~0_BEFORE_CALL_33 Int) (aux_div_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93 Int) (v_main_~Y~0_BEFORE_CALL_35 Int) (v_main_~y~0_BEFORE_CALL_20 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 Int) (aux_div_v_main_~X~0_BEFORE_CALL_39_65 Int) (aux_div_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115 Int)) (let ((.cse8 (* 2 aux_div_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139))) (let ((.cse2 (* aux_div_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115 2)) (.cse10 (* 2 aux_div_v_main_~X~0_BEFORE_CALL_39_65)) (.cse3 (* (- 1) v_main_~Y~0_BEFORE_CALL_35)) (.cse5 (* (- 1) v_main_~v~0_BEFORE_CALL_33 v_main_~y~0_BEFORE_CALL_20)) (.cse6 (* 2 v_main_~y~0_BEFORE_CALL_20 aux_div_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139)) (.cse7 (* v_main_~y~0_BEFORE_CALL_20 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139)) (.cse1 (* 2 aux_div_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93)) (.cse0 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 .cse8)) (.cse4 (+ (* (- 1) v_main_~v~0_BEFORE_CALL_33) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 .cse8))) (and (< .cse0 (+ 2 .cse1)) (<= .cse2 .cse0) (= (mod (+ .cse3 aux_div_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115 (* .cse4 v_main_~y~0_BEFORE_CALL_20)) v_main_~Y~0_BEFORE_CALL_35) 0) (< .cse0 (+ 2 .cse2)) (<= (+ v_main_~v~0_BEFORE_CALL_33 (div (+ .cse3 .cse5 .cse6 .cse7 aux_div_v_main_~X~0_BEFORE_CALL_39_65) v_main_~Y~0_BEFORE_CALL_35)) (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 .cse8 1)) (not (let ((.cse9 (div (+ .cse3 (* aux_div_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115 2 v_main_~y~0_BEFORE_CALL_20) (* (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 (* aux_div_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115 (- 2)) .cse8) v_main_~y~0_BEFORE_CALL_20) aux_div_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 .cse5) v_main_~Y~0_BEFORE_CALL_35))) (= (+ (* 2 (* .cse9 v_main_~y~0_BEFORE_CALL_20)) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 .cse8) (+ (* 2 (* .cse9 v_main_~Y~0_BEFORE_CALL_35)) (* 2 v_main_~y~0_BEFORE_CALL_20) (* 2 v_main_~Y~0_BEFORE_CALL_35))))) (not (= v_main_~Y~0_BEFORE_CALL_35 0)) (< .cse0 (+ .cse10 2)) (<= .cse10 .cse0) (< .cse0 (+ v_main_~v~0_BEFORE_CALL_33 (div (+ .cse3 aux_div_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93 .cse5 .cse6 .cse7) v_main_~Y~0_BEFORE_CALL_35))) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139 2) (<= .cse1 .cse0) (= (mod (+ (* .cse4 2 v_main_~y~0_BEFORE_CALL_20) aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139) 2) 0) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~X~0_BEFORE_CALL_39_65_93_115_139)))))) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false