/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:59:18,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:59:18,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:59:18,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:59:18,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:59:18,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:59:18,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:59:18,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:59:18,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:59:18,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:59:18,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:59:18,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:59:18,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:59:18,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:59:18,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:59:18,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:59:18,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:59:18,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:59:18,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:59:18,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:59:18,534 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:59:18,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:59:18,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:59:18,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:59:18,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:59:18,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:59:18,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:59:18,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:59:18,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:59:18,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:59:18,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:59:18,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:59:18,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:59:18,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:59:18,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:59:18,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:59:18,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:59:18,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:59:18,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:59:18,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:59:18,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:59:18,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:59:18,547 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:59:18,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:59:18,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:59:18,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:59:18,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:59:18,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:59:18,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:59:18,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:59:18,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:59:18,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:59:18,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:59:18,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:59:18,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:59:18,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:59:18,558 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:59:18,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:59:18,559 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:59:18,559 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:59:18,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:59:18,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:59:18,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:59:18,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:59:18,732 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:59:18,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2022-04-28 10:59:18,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c63ce3d5/5622c3a7805243c8b9a9bd265399f964/FLAGb7e2f4f7c [2022-04-28 10:59:19,129 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:59:19,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c [2022-04-28 10:59:19,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c63ce3d5/5622c3a7805243c8b9a9bd265399f964/FLAGb7e2f4f7c [2022-04-28 10:59:19,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c63ce3d5/5622c3a7805243c8b9a9bd265399f964 [2022-04-28 10:59:19,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:59:19,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:59:19,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:59:19,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:59:19,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:59:19,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@549abf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19, skipping insertion in model container [2022-04-28 10:59:19,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:59:19,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:59:19,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c[597,610] [2022-04-28 10:59:19,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:59:19,358 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:59:19,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound10.c[597,610] [2022-04-28 10:59:19,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:59:19,393 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:59:19,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19 WrapperNode [2022-04-28 10:59:19,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:59:19,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:59:19,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:59:19,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:59:19,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:59:19,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:59:19,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:59:19,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:59:19,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (1/1) ... [2022-04-28 10:59:19,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:59:19,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:19,447 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:59:19,477 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:59:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:59:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:59:19,488 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:59:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:59:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:59:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:59:19,489 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:59:19,489 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:59:19,489 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:59:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:59:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:59:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:59:19,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:59:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:59:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:59:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:59:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:59:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:59:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:59:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:59:19,531 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:59:19,532 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:59:19,689 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:59:19,693 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:59:19,694 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:59:19,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:59:19 BoogieIcfgContainer [2022-04-28 10:59:19,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:59:19,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:59:19,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:59:19,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:59:19,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:59:19" (1/3) ... [2022-04-28 10:59:19,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b793bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:59:19, skipping insertion in model container [2022-04-28 10:59:19,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:59:19" (2/3) ... [2022-04-28 10:59:19,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b793bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:59:19, skipping insertion in model container [2022-04-28 10:59:19,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:59:19" (3/3) ... [2022-04-28 10:59:19,715 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound10.c [2022-04-28 10:59:19,723 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:59:19,723 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:59:19,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:59:19,766 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@466acbcf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a4e7266 [2022-04-28 10:59:19,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:59:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:59:19,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:19,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:19,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 1 times [2022-04-28 10:59:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:19,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704533871] [2022-04-28 10:59:19,793 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:59:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 2 times [2022-04-28 10:59:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:19,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396716144] [2022-04-28 10:59:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:19,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:59:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:19,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-04-28 10:59:19,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:59:19,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #62#return; {28#true} is VALID [2022-04-28 10:59:19,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:59:19,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-04-28 10:59:19,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 10:59:19,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #62#return; {28#true} is VALID [2022-04-28 10:59:19,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2022-04-28 10:59:19,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {28#true} is VALID [2022-04-28 10:59:19,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-28 10:59:19,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {29#false} is VALID [2022-04-28 10:59:19,952 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {29#false} is VALID [2022-04-28 10:59:19,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 10:59:19,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 10:59:19,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 10:59:19,953 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:59:19,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:19,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396716144] [2022-04-28 10:59:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396716144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:19,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:59:19,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:19,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704533871] [2022-04-28 10:59:19,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704533871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:19,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:19,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:59:19,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103632372] [2022-04-28 10:59:19,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:19,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:59:19,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:19,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:19,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:19,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:59:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:59:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:59:20,003 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:20,135 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 10:59:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:59:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:59:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 10:59:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 10:59:20,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-28 10:59:20,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:20,220 INFO L225 Difference]: With dead ends: 45 [2022-04-28 10:59:20,220 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 10:59:20,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:59:20,226 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:20,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:59:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 10:59:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 10:59:20,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:20,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:20,247 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:20,247 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:20,249 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:59:20,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:59:20,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:20,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:20,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-28 10:59:20,250 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-04-28 10:59:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:20,252 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 10:59:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 10:59:20,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:20,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:20,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:20,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 10:59:20,255 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-28 10:59:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:20,256 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 10:59:20,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 10:59:20,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 10:59:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:59:20,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:20,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:20,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:59:20,279 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 1 times [2022-04-28 10:59:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:20,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728153376] [2022-04-28 10:59:20,280 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:59:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 2 times [2022-04-28 10:59:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:20,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414973614] [2022-04-28 10:59:20,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:20,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:20,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:20,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753997015] [2022-04-28 10:59:20,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:20,306 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:59:20,323 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:59:20,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:59:20,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:20,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:59:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:20,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:20,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2022-04-28 10:59:20,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {208#true} is VALID [2022-04-28 10:59:20,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2022-04-28 10:59:20,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #62#return; {208#true} is VALID [2022-04-28 10:59:20,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret9 := main(); {208#true} is VALID [2022-04-28 10:59:20,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {208#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:20,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:20,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {235#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-28 10:59:20,559 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {239#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:20,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {243#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:20,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {209#false} is VALID [2022-04-28 10:59:20,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#false} assume !false; {209#false} is VALID [2022-04-28 10:59:20,561 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:59:20,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:59:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:20,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414973614] [2022-04-28 10:59:20,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:20,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753997015] [2022-04-28 10:59:20,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753997015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:20,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:20,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:59:20,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:20,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728153376] [2022-04-28 10:59:20,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728153376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:20,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:59:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520691464] [2022-04-28 10:59:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:20,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:59:20,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:20,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:20,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:59:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:20,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:59:20,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:59:20,577 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:20,758 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-28 10:59:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:59:20,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:59:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 10:59:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 10:59:20,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 10:59:20,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:20,816 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:59:20,816 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:59:20,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:59:20,817 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:20,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:59:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:59:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-28 10:59:20,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:20,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:20,832 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:20,833 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:20,834 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 10:59:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:59:20,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:20,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:20,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 10:59:20,835 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 10:59:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:20,837 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-28 10:59:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-28 10:59:20,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:20,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:20,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:20,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-28 10:59:20,848 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2022-04-28 10:59:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:20,849 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-28 10:59:20,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:59:20,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-28 10:59:20,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 10:59:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:59:20,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:20,877 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:20,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 10:59:21,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:21,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 1 times [2022-04-28 10:59:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917139664] [2022-04-28 10:59:21,279 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:21,279 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 2 times [2022-04-28 10:59:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:21,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629096192] [2022-04-28 10:59:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:21,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:21,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508318615] [2022-04-28 10:59:21,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:21,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:21,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:21,327 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:59:21,328 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:59:21,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:21,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:21,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:59:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:21,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:21,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {435#true} is VALID [2022-04-28 10:59:21,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {435#true} is VALID [2022-04-28 10:59:21,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 10:59:21,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #62#return; {435#true} is VALID [2022-04-28 10:59:21,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret9 := main(); {435#true} is VALID [2022-04-28 10:59:21,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:21,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:21,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:21,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {435#true} is VALID [2022-04-28 10:59:21,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#true} ~cond := #in~cond; {435#true} is VALID [2022-04-28 10:59:21,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#true} assume !(0 == ~cond); {435#true} is VALID [2022-04-28 10:59:21,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 10:59:21,589 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {435#true} {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #58#return; {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:21,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:21,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {455#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {483#(and (= main_~x~0 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 10:59:21,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#(and (= main_~x~0 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 10:59:21,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 10:59:21,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {487#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {494#(and (= main_~xy~0 0) (= main_~Y~0 main_~yx~0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 10:59:21,593 INFO L272 TraceCheckUtils]: 18: Hoare triple {494#(and (= main_~xy~0 0) (= main_~Y~0 main_~yx~0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:21,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:21,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {436#false} is VALID [2022-04-28 10:59:21,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-28 10:59:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:59:21,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:21,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-04-28 10:59:21,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {502#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {436#false} is VALID [2022-04-28 10:59:21,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {498#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {502#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:21,746 INFO L272 TraceCheckUtils]: 18: Hoare triple {518#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {498#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:21,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {518#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 10:59:21,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {529#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {529#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 10:59:21,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,753 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {435#true} {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #58#return; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 10:59:21,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#true} assume !(0 == ~cond); {435#true} is VALID [2022-04-28 10:59:21,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#true} ~cond := #in~cond; {435#true} is VALID [2022-04-28 10:59:21,754 INFO L272 TraceCheckUtils]: 8: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {435#true} is VALID [2022-04-28 10:59:21,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {522#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:21,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret9 := main(); {435#true} is VALID [2022-04-28 10:59:21,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #62#return; {435#true} is VALID [2022-04-28 10:59:21,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2022-04-28 10:59:21,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {435#true} is VALID [2022-04-28 10:59:21,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {435#true} is VALID [2022-04-28 10:59:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:59:21,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:21,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629096192] [2022-04-28 10:59:21,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:21,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508318615] [2022-04-28 10:59:21,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508318615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:59:21,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:59:21,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 10:59:21,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:21,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917139664] [2022-04-28 10:59:21,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917139664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:21,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:21,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:59:21,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403105167] [2022-04-28 10:59:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:21,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 10:59:21,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:21,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:21,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:59:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:21,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:59:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:59:21,780 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:22,076 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-28 10:59:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:59:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 10:59:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 10:59:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 10:59:22,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 10:59:22,132 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:59:22,133 INFO L225 Difference]: With dead ends: 44 [2022-04-28 10:59:22,133 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:59:22,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:59:22,135 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:22,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:59:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:59:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-28 10:59:22,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:22,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:22,148 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:22,148 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:22,150 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 10:59:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-28 10:59:22,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:22,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:22,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-28 10:59:22,151 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 39 states. [2022-04-28 10:59:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:22,152 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 10:59:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-28 10:59:22,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:22,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:22,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:22,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 10:59:22,154 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 22 [2022-04-28 10:59:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:22,155 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 10:59:22,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:22,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 10:59:22,185 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:59:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 10:59:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:59:22,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:22,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:22,205 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:59:22,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 10:59:22,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 794559142, now seen corresponding path program 1 times [2022-04-28 10:59:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:22,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557612322] [2022-04-28 10:59:22,453 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:22,453 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash 794559142, now seen corresponding path program 2 times [2022-04-28 10:59:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:22,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927096841] [2022-04-28 10:59:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:22,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:22,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706841727] [2022-04-28 10:59:22,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:22,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:22,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:22,464 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:59:22,465 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:59:22,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:22,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:22,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:59:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:22,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:22,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2022-04-28 10:59:22,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {823#true} is VALID [2022-04-28 10:59:22,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 10:59:22,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #62#return; {823#true} is VALID [2022-04-28 10:59:22,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret9 := main(); {823#true} is VALID [2022-04-28 10:59:22,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:22,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:22,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:22,655 INFO L272 TraceCheckUtils]: 8: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {823#true} is VALID [2022-04-28 10:59:22,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2022-04-28 10:59:22,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2022-04-28 10:59:22,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 10:59:22,656 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {823#true} {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #58#return; {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:22,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 10:59:22,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {843#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {871#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 10:59:22,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {871#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 10:59:22,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 10:59:22,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {875#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {882#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 10:59:22,659 INFO L272 TraceCheckUtils]: 18: Hoare triple {882#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:22,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:22,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {824#false} is VALID [2022-04-28 10:59:22,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-04-28 10:59:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:59:22,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:22,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {824#false} assume !false; {824#false} is VALID [2022-04-28 10:59:22,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {824#false} is VALID [2022-04-28 10:59:22,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:22,796 INFO L272 TraceCheckUtils]: 18: Hoare triple {906#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:22,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {906#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 10:59:22,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {917#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 10:59:22,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,862 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {823#true} {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #58#return; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 10:59:22,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {823#true} assume !(0 == ~cond); {823#true} is VALID [2022-04-28 10:59:22,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {823#true} ~cond := #in~cond; {823#true} is VALID [2022-04-28 10:59:22,863 INFO L272 TraceCheckUtils]: 8: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {823#true} is VALID [2022-04-28 10:59:22,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {823#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {910#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 10:59:22,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {823#true} call #t~ret9 := main(); {823#true} is VALID [2022-04-28 10:59:22,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {823#true} {823#true} #62#return; {823#true} is VALID [2022-04-28 10:59:22,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#true} assume true; {823#true} is VALID [2022-04-28 10:59:22,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {823#true} is VALID [2022-04-28 10:59:22,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {823#true} call ULTIMATE.init(); {823#true} is VALID [2022-04-28 10:59:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 10:59:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927096841] [2022-04-28 10:59:22,866 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:22,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706841727] [2022-04-28 10:59:22,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706841727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:59:22,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:59:22,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-28 10:59:22,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:22,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557612322] [2022-04-28 10:59:22,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557612322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:22,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:22,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:59:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329381053] [2022-04-28 10:59:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 10:59:22,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:22,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:22,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:22,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:59:22,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:22,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:59:22,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:59:22,887 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:23,153 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-04-28 10:59:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:59:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-28 10:59:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 10:59:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 10:59:23,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 10:59:23,194 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:59:23,195 INFO L225 Difference]: With dead ends: 53 [2022-04-28 10:59:23,195 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 10:59:23,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:59:23,198 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:23,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 111 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:59:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 10:59:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-04-28 10:59:23,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:23,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:23,214 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:23,214 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:23,216 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 10:59:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-28 10:59:23,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:23,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:23,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-28 10:59:23,217 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 51 states. [2022-04-28 10:59:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:23,219 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-28 10:59:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-28 10:59:23,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:23,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:23,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:23,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:23,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-28 10:59:23,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 22 [2022-04-28 10:59:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:23,222 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-28 10:59:23,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:23,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-28 10:59:23,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-28 10:59:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:59:23,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:23,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:23,287 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:59:23,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:23,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:23,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 1 times [2022-04-28 10:59:23,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:23,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781722306] [2022-04-28 10:59:23,534 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:23,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 2 times [2022-04-28 10:59:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:23,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101078393] [2022-04-28 10:59:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:23,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:23,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175102505] [2022-04-28 10:59:23,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:23,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:23,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:23,546 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:59:23,548 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:59:23,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:23,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:23,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:59:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:23,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:23,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2022-04-28 10:59:23,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 10:59:23,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#(<= ~counter~0 0)} assume true; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 10:59:23,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1277#(<= ~counter~0 0)} {1269#true} #62#return; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 10:59:23,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {1277#(<= ~counter~0 0)} call #t~ret9 := main(); {1277#(<= ~counter~0 0)} is VALID [2022-04-28 10:59:23,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#(<= ~counter~0 0)} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1277#(<= ~counter~0 0)} is VALID [2022-04-28 10:59:23,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {1277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1293#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,712 INFO L272 TraceCheckUtils]: 8: Hoare triple {1293#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {1293#(<= ~counter~0 1)} ~cond := #in~cond; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {1293#(<= ~counter~0 1)} assume !(0 == ~cond); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {1293#(<= ~counter~0 1)} assume true; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,714 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1293#(<= ~counter~0 1)} {1293#(<= ~counter~0 1)} #58#return; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {1293#(<= ~counter~0 1)} assume !!(~x~0 <= ~X~0); {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {1293#(<= ~counter~0 1)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {1293#(<= ~counter~0 1)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1293#(<= ~counter~0 1)} is VALID [2022-04-28 10:59:23,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {1293#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1324#(<= |main_#t~post6| 1)} is VALID [2022-04-28 10:59:23,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {1324#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {1270#false} is VALID [2022-04-28 10:59:23,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1270#false} is VALID [2022-04-28 10:59:23,717 INFO L272 TraceCheckUtils]: 19: Hoare triple {1270#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1270#false} is VALID [2022-04-28 10:59:23,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {1270#false} ~cond := #in~cond; {1270#false} is VALID [2022-04-28 10:59:23,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {1270#false} assume 0 == ~cond; {1270#false} is VALID [2022-04-28 10:59:23,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2022-04-28 10:59:23,718 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:59:23,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:23,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2022-04-28 10:59:23,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {1270#false} assume 0 == ~cond; {1270#false} is VALID [2022-04-28 10:59:23,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {1270#false} ~cond := #in~cond; {1270#false} is VALID [2022-04-28 10:59:23,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {1270#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1270#false} is VALID [2022-04-28 10:59:23,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {1270#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1270#false} is VALID [2022-04-28 10:59:23,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {1358#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1270#false} is VALID [2022-04-28 10:59:23,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {1362#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1358#(< |main_#t~post6| 10)} is VALID [2022-04-28 10:59:23,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {1362#(< ~counter~0 10)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1362#(< ~counter~0 10)} is VALID [2022-04-28 10:59:23,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {1362#(< ~counter~0 10)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1362#(< ~counter~0 10)} is VALID [2022-04-28 10:59:23,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1362#(< ~counter~0 10)} assume !!(~x~0 <= ~X~0); {1362#(< ~counter~0 10)} is VALID [2022-04-28 10:59:23,878 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1269#true} {1362#(< ~counter~0 10)} #58#return; {1362#(< ~counter~0 10)} is VALID [2022-04-28 10:59:23,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {1269#true} assume true; {1269#true} is VALID [2022-04-28 10:59:23,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {1269#true} assume !(0 == ~cond); {1269#true} is VALID [2022-04-28 10:59:23,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#true} ~cond := #in~cond; {1269#true} is VALID [2022-04-28 10:59:23,879 INFO L272 TraceCheckUtils]: 8: Hoare triple {1362#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1269#true} is VALID [2022-04-28 10:59:23,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {1362#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1362#(< ~counter~0 10)} is VALID [2022-04-28 10:59:23,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {1393#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1362#(< ~counter~0 10)} is VALID [2022-04-28 10:59:23,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#(< ~counter~0 9)} 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; {1393#(< ~counter~0 9)} is VALID [2022-04-28 10:59:23,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#(< ~counter~0 9)} call #t~ret9 := main(); {1393#(< ~counter~0 9)} is VALID [2022-04-28 10:59:23,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#(< ~counter~0 9)} {1269#true} #62#return; {1393#(< ~counter~0 9)} is VALID [2022-04-28 10:59:23,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#(< ~counter~0 9)} assume true; {1393#(< ~counter~0 9)} is VALID [2022-04-28 10:59:23,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {1269#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1393#(< ~counter~0 9)} is VALID [2022-04-28 10:59:23,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2022-04-28 10:59:23,894 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:59:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:23,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101078393] [2022-04-28 10:59:23,894 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:23,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175102505] [2022-04-28 10:59:23,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175102505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:59:23,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:59:23,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 10:59:23,895 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781722306] [2022-04-28 10:59:23,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781722306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:23,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:23,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:59:23,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075397155] [2022-04-28 10:59:23,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:23,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 10:59:23,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:23,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:23,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:59:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:59:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:59:23,912 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:23,999 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-28 10:59:23,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:59:23,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-28 10:59:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 10:59:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 10:59:24,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 10:59:24,033 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:59:24,034 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:59:24,034 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:59:24,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 10:59:24,035 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:24,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:59:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:59:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 10:59:24,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:24,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:24,062 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:24,062 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:24,064 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 10:59:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 10:59:24,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:24,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:24,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 10:59:24,065 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 10:59:24,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:24,067 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-28 10:59:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 10:59:24,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:24,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:24,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:24,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:59:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-28 10:59:24,069 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 23 [2022-04-28 10:59:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:24,069 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-28 10:59:24,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:59:24,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-28 10:59:24,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-28 10:59:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:59:24,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:24,123 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:24,152 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:59:24,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:24,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 1 times [2022-04-28 10:59:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:24,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808763408] [2022-04-28 10:59:24,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:24,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 2 times [2022-04-28 10:59:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:24,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543223594] [2022-04-28 10:59:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:24,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:24,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061439415] [2022-04-28 10:59:24,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:59:24,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:24,403 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:59:24,414 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:59:24,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:59:24,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:59:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:24,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:24,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1708#true} call ULTIMATE.init(); {1708#true} is VALID [2022-04-28 10:59:24,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1708#true} is VALID [2022-04-28 10:59:24,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1708#true} assume true; {1708#true} is VALID [2022-04-28 10:59:24,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1708#true} {1708#true} #62#return; {1708#true} is VALID [2022-04-28 10:59:24,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {1708#true} call #t~ret9 := main(); {1708#true} is VALID [2022-04-28 10:59:24,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {1708#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; {1728#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:24,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#(and (= main_~x~0 0) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1728#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:24,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1728#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:24,911 INFO L272 TraceCheckUtils]: 8: Hoare triple {1728#(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)); {1708#true} is VALID [2022-04-28 10:59:24,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {1708#true} ~cond := #in~cond; {1708#true} is VALID [2022-04-28 10:59:24,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {1708#true} assume !(0 == ~cond); {1708#true} is VALID [2022-04-28 10:59:24,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {1708#true} assume true; {1708#true} is VALID [2022-04-28 10:59:24,912 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1708#true} {1728#(and (= main_~x~0 0) (= main_~y~0 0))} #58#return; {1728#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:24,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1753#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 10:59:24,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {1753#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1757#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-28 10:59:24,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {1757#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1761#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:59:24,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {1761#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1761#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:59:24,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {1761#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (<= main_~x~0 (+ main_~X~0 1)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1768#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:59:24,915 INFO L272 TraceCheckUtils]: 18: Hoare triple {1768#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1708#true} is VALID [2022-04-28 10:59:24,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {1708#true} ~cond := #in~cond; {1775#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:24,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:24,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:24,917 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} {1768#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #58#return; {1786#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:59:24,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {1790#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 10:59:24,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {1790#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1794#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 10:59:24,921 INFO L272 TraceCheckUtils]: 25: Hoare triple {1794#(and (not (<= 1 main_~X~0)) (= main_~y~0 main_~xy~0) (= main_~y~0 1) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:24,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:24,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1709#false} is VALID [2022-04-28 10:59:24,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {1709#false} assume !false; {1709#false} is VALID [2022-04-28 10:59:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:59:24,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:59:25,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {1709#false} assume !false; {1709#false} is VALID [2022-04-28 10:59:25,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {1802#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1709#false} is VALID [2022-04-28 10:59:25,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1802#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:59:25,516 INFO L272 TraceCheckUtils]: 25: Hoare triple {1818#(= (+ (* 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)); {1798#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:59:25,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {1822#(= (+ (* 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; {1818#(= (+ (* 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:59:25,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {1826#(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); {1822#(= (+ (* 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:59:25,518 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} {1830#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #58#return; {1826#(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:59:25,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:25,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {1840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1779#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:59:25,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {1708#true} ~cond := #in~cond; {1840#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:59:25,520 INFO L272 TraceCheckUtils]: 18: Hoare triple {1830#(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)); {1708#true} is VALID [2022-04-28 10:59:25,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {1847#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1830#(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:59:25,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {1847#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1847#(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:59:25,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1854#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {1847#(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:59:25,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {1854#(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:59:25,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {1708#true} assume !!(~x~0 <= ~X~0); {1858#(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:59:25,526 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1708#true} {1708#true} #58#return; {1708#true} is VALID [2022-04-28 10:59:25,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {1708#true} assume true; {1708#true} is VALID [2022-04-28 10:59:25,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {1708#true} assume !(0 == ~cond); {1708#true} is VALID [2022-04-28 10:59:25,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {1708#true} ~cond := #in~cond; {1708#true} is VALID [2022-04-28 10:59:25,526 INFO L272 TraceCheckUtils]: 8: Hoare triple {1708#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1708#true} is VALID [2022-04-28 10:59:25,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {1708#true} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1708#true} is VALID [2022-04-28 10:59:25,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {1708#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {1708#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; {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {1708#true} call #t~ret9 := main(); {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1708#true} {1708#true} #62#return; {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1708#true} assume true; {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {1708#true} call ULTIMATE.init(); {1708#true} is VALID [2022-04-28 10:59:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:59:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:59:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543223594] [2022-04-28 10:59:25,528 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:59:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061439415] [2022-04-28 10:59:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061439415] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:59:25,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:59:25,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-28 10:59:25,528 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:59:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808763408] [2022-04-28 10:59:25,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808763408] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:59:25,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:59:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:59:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171547998] [2022-04-28 10:59:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:59:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 10:59:25,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:59:25,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:25,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:59:25,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:59:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:59:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:59:25,556 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:26,011 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-28 10:59:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:59:26,012 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 10:59:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:59:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-28 10:59:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2022-04-28 10:59:26,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 48 transitions. [2022-04-28 10:59:26,051 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:59:26,052 INFO L225 Difference]: With dead ends: 57 [2022-04-28 10:59:26,052 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 10:59:26,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 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:59:26,053 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:59:26,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 107 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:59:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 10:59:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2022-04-28 10:59:26,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:59:26,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:26,073 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:26,074 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:26,075 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-28 10:59:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-28 10:59:26,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:26,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:26,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 49 states. [2022-04-28 10:59:26,076 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 49 states. [2022-04-28 10:59:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:59:26,077 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-28 10:59:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-04-28 10:59:26,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:59:26,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:59:26,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:59:26,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:59:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:59:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-28 10:59:26,078 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2022-04-28 10:59:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:59:26,079 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-28 10:59:26,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:59:26,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-28 10:59:26,116 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:59:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 10:59:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:59:26,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:59:26,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:59:26,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 10:59:26,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:26,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:59:26,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:59:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1603460440, now seen corresponding path program 3 times [2022-04-28 10:59:26,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:59:26,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269223407] [2022-04-28 10:59:26,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:59:26,361 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:59:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1603460440, now seen corresponding path program 4 times [2022-04-28 10:59:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:59:26,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740293314] [2022-04-28 10:59:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:59:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:59:26,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:59:26,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15279445] [2022-04-28 10:59:26,371 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:59:26,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:59:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:59:26,381 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:59:26,382 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:59:26,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:59:26,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:59:26,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:59:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:59:26,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:59:29,773 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:01:15,025 WARN L232 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:01:25,065 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 2) c_main_~X~0 c_main_~y~0)) (.cse0 (* 2 c_main_~Y~0 c_main_~x~0))) (and (= c_main_~v~0 (+ (* c_main_~Y~0 4) .cse0 (* (- 1) c_main_~X~0) .cse1)) (or (= (mod (let ((.cse2 (* (- 2) c_main_~Y~0))) (+ (div (+ (* (- 1) .cse1) .cse2 (* (- 1) .cse0)) (- 2)) .cse2 (* c_main_~X~0 c_main_~y~0))) c_main_~Y~0) 0) (= c_main_~Y~0 0)))) is different from true [2022-04-28 11:01:53,144 WARN L232 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:02:11,247 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:02:17,280 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:02:23,300 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:02:31,670 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:02:51,442 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_main_~Y~0 0))) (let ((.cse0 (= c_main_~X~0 0)) (.cse5 (= c_main_~yx~0 0)) (.cse1 (not .cse4))) (or (and .cse0 (= c_main_~xy~0 0) (or (let ((.cse2 (div c_main_~yx~0 c_main_~Y~0))) (and (= (mod c_main_~yx~0 c_main_~Y~0) 0) .cse1 (= (+ (* .cse2 c_main_~Y~0) c_main_~Y~0 (div (+ c_main_~v~0 c_main_~X~0) (- 2))) 0) (exists ((main_~y~0 Int)) (= (mod (let ((.cse3 (* (- 2) c_main_~Y~0))) (+ .cse3 (div (+ (* (* (- 2) main_~y~0 c_main_~X~0) (- 1)) .cse3 (* (- 1) (* (+ (- 1) (div c_main_~yx~0 c_main_~Y~0)) 2 c_main_~Y~0))) (- 2)) (* main_~y~0 c_main_~X~0))) c_main_~Y~0) 0)) (= (mod (+ c_main_~v~0 c_main_~X~0 (* .cse2 (- 2) c_main_~Y~0)) 2) 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* 2 c_main_~Y~0) (* 2 (* main_~x~0 c_main_~Y~0))) (+ (* 2 (* main_~y~0 c_main_~X~0)) c_main_~v~0 c_main_~X~0))) .cse4 .cse5))) (and (not .cse0) (= (mod c_main_~xy~0 c_main_~X~0) 0) (let ((.cse13 (div c_main_~xy~0 c_main_~X~0))) (let ((.cse11 (* .cse13 (- 2) c_main_~X~0))) (let ((.cse8 (= (mod (+ .cse11 c_main_~v~0 c_main_~X~0) 2) 0)) (.cse6 (* .cse13 c_main_~X~0)) (.cse7 (div (+ (* (- 1) c_main_~X~0) (* (- 1) c_main_~v~0)) (- 2)))) (or (and (= (+ .cse6 .cse7) c_main_~Y~0) .cse8 .cse5) (let ((.cse12 (+ (* (- 1) c_main_~Y~0) .cse6 .cse7))) (let ((.cse10 (div .cse12 c_main_~Y~0))) (and (= (mod (let ((.cse9 (* (- 2) c_main_~Y~0))) (+ .cse6 .cse9 (div (+ (* (* 2 c_main_~Y~0 (+ .cse10 (- 1))) (- 1)) .cse9 (* (- 1) .cse11)) (- 2)))) c_main_~Y~0) 0) .cse1 (= (mod .cse12 c_main_~Y~0) 0) .cse8 (= c_main_~yx~0 (* .cse10 c_main_~Y~0))))))))))))) is different from true [2022-04-28 11:02:58,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {2201#true} call ULTIMATE.init(); {2201#true} is VALID [2022-04-28 11:02:58,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {2201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2201#true} is VALID [2022-04-28 11:02:58,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {2201#true} assume true; {2201#true} is VALID [2022-04-28 11:02:58,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2201#true} {2201#true} #62#return; {2201#true} is VALID [2022-04-28 11:02:58,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {2201#true} call #t~ret9 := main(); {2201#true} is VALID [2022-04-28 11:02:58,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {2201#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; {2201#true} is VALID [2022-04-28 11:02:58,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {2201#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2201#true} is VALID [2022-04-28 11:02:58,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2201#true} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2227#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 11:02:58,574 INFO L272 TraceCheckUtils]: 8: Hoare triple {2227#(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)); {2201#true} is VALID [2022-04-28 11:02:58,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {2201#true} ~cond := #in~cond; {2234#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:02:58,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {2234#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:58,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:02:58,576 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} {2227#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #58#return; {2245#(= (+ (* 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 11:02:58,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {2245#(= (+ (* 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); {2245#(= (+ (* 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 11:02:58,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {2245#(= (+ (* 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; {2252#(= 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 11:03:00,579 WARN L290 TraceCheckUtils]: 15: Hoare triple {2252#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2256#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} is UNKNOWN [2022-04-28 11:03:00,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {2256#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2256#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} is VALID [2022-04-28 11:03:00,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {2256#(or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2263#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} is VALID [2022-04-28 11:03:00,581 INFO L272 TraceCheckUtils]: 18: Hoare triple {2263#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2201#true} is VALID [2022-04-28 11:03:00,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {2201#true} ~cond := #in~cond; {2234#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:03:00,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:03:00,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:03:00,584 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} {2263#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (or (and (= (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (= main_~Y~0 0)) (and (<= (+ (div (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 1) main_~x~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) main_~X~0 main_~y~0)) 2) 0) (not (= main_~Y~0 0)) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0))))} #58#return; {2279#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:03:00,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {2279#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {2279#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:03:01,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {2279#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2286#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (* main_~Y~0 main_~x~0 2) (- 1)) (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)))} is VALID [2022-04-28 11:03:03,831 WARN L290 TraceCheckUtils]: 25: Hoare triple {2286#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (* main_~Y~0 main_~x~0 2) (- 1)) (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2290#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} is UNKNOWN [2022-04-28 11:03:03,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {2290#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2290#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} is VALID [2022-04-28 11:03:05,840 WARN L290 TraceCheckUtils]: 27: Hoare triple {2290#(and (or (= (mod (+ (* main_~X~0 main_~y~0) (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= main_~Y~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2297#(or (and (= main_~xy~0 0) (or (and (exists ((main_~y~0 Int)) (= (mod (+ (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) main_~Y~0) 0)) (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0))) (= main_~X~0 0)) (and (not (= main_~X~0 0)) (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (* (- 1) (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)))) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-28 11:03:05,853 INFO L272 TraceCheckUtils]: 28: Hoare triple {2297#(or (and (= main_~xy~0 0) (or (and (exists ((main_~y~0 Int)) (= (mod (+ (div (+ (* (- 1) (* (- 2) main_~X~0 main_~y~0)) (* (- 1) (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0 2)) (* (- 2) main_~Y~0)) (- 2)) (* main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) main_~Y~0) 0)) (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0))) (= main_~X~0 0)) (and (not (= main_~X~0 0)) (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) (* (- 1) (* main_~Y~0 2 (+ (- 1) (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)))) (* (- 2) main_~Y~0)) (- 2)) (* (- 2) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0) 0) (= (* main_~Y~0 (div (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0) (not (= main_~Y~0 0)))) (= (mod main_~xy~0 main_~X~0) 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:03:05,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {2301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:03:05,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {2305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2202#false} is VALID [2022-04-28 11:03:05,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {2202#false} assume !false; {2202#false} is VALID [2022-04-28 11:03:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 2 refuted. 2 times theorem prover too weak. 4 trivial. 3 not checked. [2022-04-28 11:03:05,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:03:11,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {2202#false} assume !false; {2202#false} is VALID [2022-04-28 11:03:11,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {2305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2202#false} is VALID [2022-04-28 11:03:11,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {2301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:03:11,049 INFO L272 TraceCheckUtils]: 28: Hoare triple {2321#(= (+ (* 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)); {2301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:03:11,052 INFO L290 TraceCheckUtils]: 27: Hoare triple {2245#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2321#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 11:03:11,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {2245#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2245#(= (+ (* 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 11:03:11,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {2252#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2245#(= (+ (* 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 11:03:11,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {2245#(= (+ (* 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; {2252#(= 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 11:03:11,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {2245#(= (+ (* 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); {2245#(= (+ (* 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 11:03:11,056 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} {2340#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #58#return; {2245#(= (+ (* 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 11:03:11,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:03:11,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {2350#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2238#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:03:11,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {2201#true} ~cond := #in~cond; {2350#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:03:11,057 INFO L272 TraceCheckUtils]: 18: Hoare triple {2340#(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)); {2201#true} is VALID [2022-04-28 11:03:11,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {2201#true} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2340#(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 11:03:11,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {2201#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2201#true} is VALID [2022-04-28 11:03:11,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {2201#true} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2201#true} is VALID [2022-04-28 11:03:11,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {2201#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2201#true} is VALID [2022-04-28 11:03:11,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {2201#true} assume !!(~x~0 <= ~X~0); {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2201#true} {2201#true} #58#return; {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {2201#true} assume true; {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {2201#true} assume !(0 == ~cond); {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {2201#true} ~cond := #in~cond; {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L272 TraceCheckUtils]: 8: Hoare triple {2201#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2201#true} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {2201#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2201#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; {2201#true} is VALID [2022-04-28 11:03:11,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {2201#true} call #t~ret9 := main(); {2201#true} is VALID [2022-04-28 11:03:11,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2201#true} {2201#true} #62#return; {2201#true} is VALID [2022-04-28 11:03:11,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {2201#true} assume true; {2201#true} is VALID [2022-04-28 11:03:11,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {2201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2201#true} is VALID [2022-04-28 11:03:11,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {2201#true} call ULTIMATE.init(); {2201#true} is VALID [2022-04-28 11:03:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 11:03:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:03:11,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740293314] [2022-04-28 11:03:11,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:03:11,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15279445] [2022-04-28 11:03:11,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15279445] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:03:11,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:03:11,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 18 [2022-04-28 11:03:11,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:03:11,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269223407] [2022-04-28 11:03:11,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269223407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:03:11,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:03:11,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 11:03:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844072414] [2022-04-28 11:03:11,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:03:11,063 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-28 11:03:11,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:03:11,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 11:03:18,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 26 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 11:03:18,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 11:03:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:03:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 11:03:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=185, Unknown=16, NotChecked=58, Total=306 [2022-04-28 11:03:18,073 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 11:03:20,141 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_main_~Y~0 (+ (- 1) c_main_~x~0))) (.cse1 (* (- 2) c_main_~X~0 c_main_~y~0)) (.cse0 (* (- 2) c_main_~Y~0)) (.cse5 (* (- 1) c_main_~X~0)) (.cse4 (= c_main_~Y~0 0)) (.cse3 (* c_main_~X~0 c_main_~y~0))) (and (or (= (mod (+ .cse0 (div (+ (* (- 1) .cse1) .cse0 (* (- 1) .cse2)) (- 2)) .cse3) c_main_~Y~0) 0) .cse4) (= (+ (* c_main_~Y~0 4) .cse2 .cse5 .cse1) c_main_~v~0) (or (= (mod (+ .cse0 (div (+ .cse5 (* (- 1) c_main_~v~0)) (- 2)) .cse3) c_main_~Y~0) 0) .cse4) (= (+ (* 2 (* c_main_~Y~0 c_main_~x~0)) (* 2 c_main_~Y~0)) (+ (* 2 .cse3) c_main_~v~0 c_main_~X~0)))) is different from true [2022-04-28 11:03:22,159 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_main_~Y~0 (+ (- 1) c_main_~x~0))) (.cse4 (= c_main_~Y~0 0)) (.cse0 (* (- 2) c_main_~Y~0)) (.cse5 (* (- 1) c_main_~X~0)) (.cse3 (* c_main_~X~0 c_main_~y~0)) (.cse1 (* (- 2) c_main_~X~0 c_main_~y~0))) (and (or (= (mod (+ .cse0 (div (+ (* (- 1) .cse1) .cse0 (* (- 1) .cse2)) (- 2)) .cse3) c_main_~Y~0) 0) .cse4) (= (+ (* c_main_~Y~0 4) .cse2 .cse5 .cse1) c_main_~v~0) (let ((.cse6 (= 0 (mod (+ .cse1 c_main_~v~0 c_main_~X~0) 2))) (.cse7 (+ .cse0 (div (+ .cse5 (* (- 1) c_main_~v~0)) (- 2)) .cse3))) (or (and .cse6 (not .cse4) (= (mod .cse7 c_main_~Y~0) 0) (<= (+ (div .cse7 c_main_~Y~0) 1) c_main_~x~0)) (and .cse6 (= .cse7 0) .cse4))))) is different from true [2022-04-28 11:03:24,166 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_main_~Y~0 0))) (let ((.cse4 (* (- 2) c_main_~Y~0)) (.cse1 (not .cse3)) (.cse5 (div (+ (* (- 1) c_main_~X~0) (* (- 1) c_main_~v~0)) (- 2))) (.cse6 (* c_main_~X~0 c_main_~y~0))) (and (let ((.cse0 (= 0 (mod (+ (* (- 2) c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2))) (.cse2 (+ .cse4 .cse5 .cse6))) (or (and .cse0 .cse1 (= (mod .cse2 c_main_~Y~0) 0) (<= (+ (div .cse2 c_main_~Y~0) 1) c_main_~x~0)) (and .cse0 (= .cse2 0) .cse3))) (let ((.cse7 (= c_main_~X~0 0)) (.cse10 (= c_main_~yx~0 0))) (or (and .cse7 (= c_main_~xy~0 0) (or (let ((.cse8 (div c_main_~yx~0 c_main_~Y~0))) (and (= (mod c_main_~yx~0 c_main_~Y~0) 0) .cse1 (= (+ (* .cse8 c_main_~Y~0) c_main_~Y~0 (div (+ c_main_~v~0 c_main_~X~0) (- 2))) 0) (exists ((main_~y~0 Int)) (= (mod (let ((.cse9 (* (- 2) c_main_~Y~0))) (+ .cse9 (div (+ (* (* (- 2) main_~y~0 c_main_~X~0) (- 1)) .cse9 (* (- 1) (* (+ (- 1) (div c_main_~yx~0 c_main_~Y~0)) 2 c_main_~Y~0))) (- 2)) (* main_~y~0 c_main_~X~0))) c_main_~Y~0) 0)) (= (mod (+ c_main_~v~0 c_main_~X~0 (* .cse8 (- 2) c_main_~Y~0)) 2) 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* 2 c_main_~Y~0) (* 2 (* main_~x~0 c_main_~Y~0))) (+ (* 2 (* main_~y~0 c_main_~X~0)) c_main_~v~0 c_main_~X~0))) .cse3 .cse10))) (and (not .cse7) (= (mod c_main_~xy~0 c_main_~X~0) 0) (let ((.cse16 (div c_main_~xy~0 c_main_~X~0))) (let ((.cse14 (* .cse16 (- 2) c_main_~X~0))) (let ((.cse12 (= (mod (+ .cse14 c_main_~v~0 c_main_~X~0) 2) 0)) (.cse11 (* .cse16 c_main_~X~0))) (or (and (= (+ .cse11 .cse5) c_main_~Y~0) .cse12 .cse10) (let ((.cse15 (+ (* (- 1) c_main_~Y~0) .cse11 .cse5))) (let ((.cse13 (div .cse15 c_main_~Y~0))) (and (= (mod (+ .cse11 .cse4 (div (+ (* (* 2 c_main_~Y~0 (+ .cse13 (- 1))) (- 1)) .cse4 (* (- 1) .cse14)) (- 2))) c_main_~Y~0) 0) .cse1 (= (mod .cse15 c_main_~Y~0) 0) .cse12 (= c_main_~yx~0 (* .cse13 c_main_~Y~0)))))))))))) (= c_main_~yx~0 (* c_main_~Y~0 c_main_~x~0)) (= c_main_~xy~0 .cse6)))) is different from false [2022-04-28 11:03:26,169 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_main_~Y~0 0))) (let ((.cse4 (* (- 2) c_main_~Y~0)) (.cse1 (not .cse3)) (.cse5 (div (+ (* (- 1) c_main_~X~0) (* (- 1) c_main_~v~0)) (- 2))) (.cse6 (* c_main_~X~0 c_main_~y~0))) (and (let ((.cse0 (= 0 (mod (+ (* (- 2) c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2))) (.cse2 (+ .cse4 .cse5 .cse6))) (or (and .cse0 .cse1 (= (mod .cse2 c_main_~Y~0) 0) (<= (+ (div .cse2 c_main_~Y~0) 1) c_main_~x~0)) (and .cse0 (= .cse2 0) .cse3))) (let ((.cse7 (= c_main_~X~0 0)) (.cse10 (= c_main_~yx~0 0))) (or (and .cse7 (= c_main_~xy~0 0) (or (let ((.cse8 (div c_main_~yx~0 c_main_~Y~0))) (and (= (mod c_main_~yx~0 c_main_~Y~0) 0) .cse1 (= (+ (* .cse8 c_main_~Y~0) c_main_~Y~0 (div (+ c_main_~v~0 c_main_~X~0) (- 2))) 0) (exists ((main_~y~0 Int)) (= (mod (let ((.cse9 (* (- 2) c_main_~Y~0))) (+ .cse9 (div (+ (* (* (- 2) main_~y~0 c_main_~X~0) (- 1)) .cse9 (* (- 1) (* (+ (- 1) (div c_main_~yx~0 c_main_~Y~0)) 2 c_main_~Y~0))) (- 2)) (* main_~y~0 c_main_~X~0))) c_main_~Y~0) 0)) (= (mod (+ c_main_~v~0 c_main_~X~0 (* .cse8 (- 2) c_main_~Y~0)) 2) 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* 2 c_main_~Y~0) (* 2 (* main_~x~0 c_main_~Y~0))) (+ (* 2 (* main_~y~0 c_main_~X~0)) c_main_~v~0 c_main_~X~0))) .cse3 .cse10))) (and (not .cse7) (= (mod c_main_~xy~0 c_main_~X~0) 0) (let ((.cse16 (div c_main_~xy~0 c_main_~X~0))) (let ((.cse14 (* .cse16 (- 2) c_main_~X~0))) (let ((.cse12 (= (mod (+ .cse14 c_main_~v~0 c_main_~X~0) 2) 0)) (.cse11 (* .cse16 c_main_~X~0))) (or (and (= (+ .cse11 .cse5) c_main_~Y~0) .cse12 .cse10) (let ((.cse15 (+ (* (- 1) c_main_~Y~0) .cse11 .cse5))) (let ((.cse13 (div .cse15 c_main_~Y~0))) (and (= (mod (+ .cse11 .cse4 (div (+ (* (* 2 c_main_~Y~0 (+ .cse13 (- 1))) (- 1)) .cse4 (* (- 1) .cse14)) (- 2))) c_main_~Y~0) 0) .cse1 (= (mod .cse15 c_main_~Y~0) 0) .cse12 (= c_main_~yx~0 (* .cse13 c_main_~Y~0)))))))))))) (= c_main_~yx~0 (* c_main_~Y~0 c_main_~x~0)) (= c_main_~xy~0 .cse6)))) is different from true [2022-04-28 11:03:28,319 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 11:03:30,345 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 11:03:32,371 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 11:03:34,401 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 11:03:36,405 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 11:03:38,437 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 11:03:40,456 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 11:03:58,692 WARN L232 SmtUtils]: Spent 16.17s on a formula simplification. DAG size of input: 45 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:04:00,768 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 11:04:02,799 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 11:04:04,827 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 11:04:06,839 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 11:04:08,853 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 2) c_main_~X~0 c_main_~y~0)) (.cse0 (* 2 c_main_~Y~0 c_main_~x~0)) (.cse2 (* c_main_~X~0 c_main_~y~0))) (and (= c_main_~v~0 (+ (* c_main_~Y~0 4) .cse0 (* (- 1) c_main_~X~0) .cse1)) (= c_main_~yx~0 (* c_main_~Y~0 c_main_~x~0)) (= c_main_~xy~0 .cse2) (or (= (mod (let ((.cse3 (* (- 2) c_main_~Y~0))) (+ (div (+ (* (- 1) .cse1) .cse3 (* (- 1) .cse0)) (- 2)) .cse3 .cse2)) c_main_~Y~0) 0) (= c_main_~Y~0 0)))) is different from true [2022-04-28 11:04:10,864 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 11:04:12,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:04:14,951 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 11:04:17,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 11:04:19,308 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 11:04:21,322 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 11:04:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:21,351 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-28 11:04:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:04:21,351 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-28 11:04:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:04:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 11:04:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2022-04-28 11:04:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 11:04:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2022-04-28 11:04:21,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2022-04-28 11:04:31,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 38 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:31,603 INFO L225 Difference]: With dead ends: 59 [2022-04-28 11:04:31,603 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 11:04:31,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=77, Invalid=267, Unknown=22, NotChecked=234, Total=600 [2022-04-28 11:04:31,604 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 11 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 34.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:04:31,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 91 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 130 Invalid, 17 Unknown, 91 Unchecked, 34.4s Time] [2022-04-28 11:04:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 11:04:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-04-28 11:04:31,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:04:31,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:04:31,639 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:04:31,639 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:04:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:31,642 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 11:04:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 11:04:31,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:31,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:31,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-04-28 11:04:31,644 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 55 states. [2022-04-28 11:04:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:31,645 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-28 11:04:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-28 11:04:31,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:31,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:31,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:04:31,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:04:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 11:04:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-28 11:04:31,647 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2022-04-28 11:04:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:04:31,647 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-28 11:04:31,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 14 states have internal predecessors, (21), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 11:04:31,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-28 11:04:33,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-28 11:04:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 11:04:33,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:04:33,817 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:04:33,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 11:04:34,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:34,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:04:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:04:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1756989579, now seen corresponding path program 1 times [2022-04-28 11:04:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:34,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829229267] [2022-04-28 11:04:34,073 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:04:34,073 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:04:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1756989579, now seen corresponding path program 2 times [2022-04-28 11:04:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:04:34,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126880506] [2022-04-28 11:04:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:04:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:04:34,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:04:34,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714042702] [2022-04-28 11:04:34,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:04:34,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:34,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:04:34,085 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 11:04:34,086 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 11:04:34,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:04:34,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:04:34,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:04:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:04:34,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:04:34,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {2735#true} call ULTIMATE.init(); {2735#true} is VALID [2022-04-28 11:04:34,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {2735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2743#(<= ~counter~0 0)} is VALID [2022-04-28 11:04:34,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2743#(<= ~counter~0 0)} assume true; {2743#(<= ~counter~0 0)} is VALID [2022-04-28 11:04:34,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2743#(<= ~counter~0 0)} {2735#true} #62#return; {2743#(<= ~counter~0 0)} is VALID [2022-04-28 11:04:34,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2743#(<= ~counter~0 0)} call #t~ret9 := main(); {2743#(<= ~counter~0 0)} is VALID [2022-04-28 11:04:34,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {2743#(<= ~counter~0 0)} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2743#(<= ~counter~0 0)} is VALID [2022-04-28 11:04:34,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {2743#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {2759#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,287 INFO L272 TraceCheckUtils]: 8: Hoare triple {2759#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {2759#(<= ~counter~0 1)} ~cond := #in~cond; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {2759#(<= ~counter~0 1)} assume !(0 == ~cond); {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {2759#(<= ~counter~0 1)} assume true; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,289 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2759#(<= ~counter~0 1)} {2759#(<= ~counter~0 1)} #58#return; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {2759#(<= ~counter~0 1)} assume !!(~x~0 <= ~X~0); {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {2759#(<= ~counter~0 1)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {2759#(<= ~counter~0 1)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2759#(<= ~counter~0 1)} is VALID [2022-04-28 11:04:34,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {2759#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {2790#(<= ~counter~0 2)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,291 INFO L272 TraceCheckUtils]: 18: Hoare triple {2790#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {2790#(<= ~counter~0 2)} ~cond := #in~cond; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {2790#(<= ~counter~0 2)} assume !(0 == ~cond); {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {2790#(<= ~counter~0 2)} assume true; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,293 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2790#(<= ~counter~0 2)} {2790#(<= ~counter~0 2)} #58#return; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {2790#(<= ~counter~0 2)} assume !!(~x~0 <= ~X~0); {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {2790#(<= ~counter~0 2)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {2790#(<= ~counter~0 2)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2790#(<= ~counter~0 2)} is VALID [2022-04-28 11:04:34,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {2790#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2821#(<= |main_#t~post6| 2)} is VALID [2022-04-28 11:04:34,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {2821#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {2736#false} is VALID [2022-04-28 11:04:34,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {2736#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2736#false} is VALID [2022-04-28 11:04:34,295 INFO L272 TraceCheckUtils]: 29: Hoare triple {2736#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)); {2736#false} is VALID [2022-04-28 11:04:34,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {2736#false} ~cond := #in~cond; {2736#false} is VALID [2022-04-28 11:04:34,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {2736#false} assume 0 == ~cond; {2736#false} is VALID [2022-04-28 11:04:34,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {2736#false} assume !false; {2736#false} is VALID [2022-04-28 11:04:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 11:04:34,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:04:34,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {2736#false} assume !false; {2736#false} is VALID [2022-04-28 11:04:34,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {2736#false} assume 0 == ~cond; {2736#false} is VALID [2022-04-28 11:04:34,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {2736#false} ~cond := #in~cond; {2736#false} is VALID [2022-04-28 11:04:34,461 INFO L272 TraceCheckUtils]: 29: Hoare triple {2736#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)); {2736#false} is VALID [2022-04-28 11:04:34,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {2736#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2736#false} is VALID [2022-04-28 11:04:34,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {2855#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {2736#false} is VALID [2022-04-28 11:04:34,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {2859#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2855#(< |main_#t~post6| 10)} is VALID [2022-04-28 11:04:34,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {2859#(< ~counter~0 10)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2859#(< ~counter~0 10)} is VALID [2022-04-28 11:04:34,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {2859#(< ~counter~0 10)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2859#(< ~counter~0 10)} is VALID [2022-04-28 11:04:34,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {2859#(< ~counter~0 10)} assume !!(~x~0 <= ~X~0); {2859#(< ~counter~0 10)} is VALID [2022-04-28 11:04:34,464 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2735#true} {2859#(< ~counter~0 10)} #58#return; {2859#(< ~counter~0 10)} is VALID [2022-04-28 11:04:34,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {2735#true} assume true; {2735#true} is VALID [2022-04-28 11:04:34,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2735#true} assume !(0 == ~cond); {2735#true} is VALID [2022-04-28 11:04:34,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {2735#true} ~cond := #in~cond; {2735#true} is VALID [2022-04-28 11:04:34,464 INFO L272 TraceCheckUtils]: 18: Hoare triple {2859#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2735#true} is VALID [2022-04-28 11:04:34,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {2859#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2859#(< ~counter~0 10)} is VALID [2022-04-28 11:04:34,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {2890#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2859#(< ~counter~0 10)} is VALID [2022-04-28 11:04:34,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {2890#(< ~counter~0 9)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {2890#(< ~counter~0 9)} is VALID [2022-04-28 11:04:34,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {2890#(< ~counter~0 9)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2890#(< ~counter~0 9)} is VALID [2022-04-28 11:04:34,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {2890#(< ~counter~0 9)} assume !!(~x~0 <= ~X~0); {2890#(< ~counter~0 9)} is VALID [2022-04-28 11:04:34,467 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2735#true} {2890#(< ~counter~0 9)} #58#return; {2890#(< ~counter~0 9)} is VALID [2022-04-28 11:04:34,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {2735#true} assume true; {2735#true} is VALID [2022-04-28 11:04:34,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {2735#true} assume !(0 == ~cond); {2735#true} is VALID [2022-04-28 11:04:34,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {2735#true} ~cond := #in~cond; {2735#true} is VALID [2022-04-28 11:04:34,467 INFO L272 TraceCheckUtils]: 8: Hoare triple {2890#(< ~counter~0 9)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2735#true} is VALID [2022-04-28 11:04:34,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {2890#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2890#(< ~counter~0 9)} is VALID [2022-04-28 11:04:34,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {2921#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2890#(< ~counter~0 9)} is VALID [2022-04-28 11:04:34,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {2921#(< ~counter~0 8)} 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; {2921#(< ~counter~0 8)} is VALID [2022-04-28 11:04:34,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {2921#(< ~counter~0 8)} call #t~ret9 := main(); {2921#(< ~counter~0 8)} is VALID [2022-04-28 11:04:34,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2921#(< ~counter~0 8)} {2735#true} #62#return; {2921#(< ~counter~0 8)} is VALID [2022-04-28 11:04:34,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {2921#(< ~counter~0 8)} assume true; {2921#(< ~counter~0 8)} is VALID [2022-04-28 11:04:34,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {2735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2921#(< ~counter~0 8)} is VALID [2022-04-28 11:04:34,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {2735#true} call ULTIMATE.init(); {2735#true} is VALID [2022-04-28 11:04:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 11:04:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:04:34,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126880506] [2022-04-28 11:04:34,471 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:04:34,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714042702] [2022-04-28 11:04:34,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714042702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:04:34,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:04:34,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 11:04:34,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:04:34,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829229267] [2022-04-28 11:04:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829229267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:04:34,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:04:34,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:04:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102070017] [2022-04-28 11:04:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:04:34,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-28 11:04:34,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:04:34,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 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 11:04:34,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:34,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:04:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:34,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:04:34,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:04:34,490 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 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 11:04:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:34,604 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-28 11:04:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:04:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-04-28 11:04:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:04:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 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 11:04:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 11:04:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 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 11:04:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-28 11:04:34,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-28 11:04:34,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:34,658 INFO L225 Difference]: With dead ends: 50 [2022-04-28 11:04:34,659 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 11:04:34,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:04:34,659 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:04:34,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:04:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 11:04:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 11:04:34,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:04:34,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 11:04:34,696 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 11:04:34,697 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 11:04:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:34,698 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 11:04:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 11:04:34,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:34,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:34,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 44 states. [2022-04-28 11:04:34,699 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 44 states. [2022-04-28 11:04:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:04:34,700 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-28 11:04:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 11:04:34,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:04:34,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:04:34,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:04:34,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:04:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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 11:04:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-28 11:04:34,702 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 33 [2022-04-28 11:04:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:04:34,703 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-28 11:04:34,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 5 states have call successors, (5), 5 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 11:04:34,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-28 11:04:38,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 46 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:04:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-28 11:04:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 11:04:38,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:04:38,864 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:04:38,880 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 11:04:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:39,081 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:04:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:04:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1565736524, now seen corresponding path program 1 times [2022-04-28 11:04:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:04:39,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1416454053] [2022-04-28 11:04:39,130 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:04:39,130 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:04:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1565736524, now seen corresponding path program 2 times [2022-04-28 11:04:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:04:39,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701401293] [2022-04-28 11:04:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:04:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:04:39,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:04:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377278105] [2022-04-28 11:04:39,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:04:39,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:04:39,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:04:39,141 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 11:04:39,142 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 11:04:39,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:04:39,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:04:39,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:04:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:04:39,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:04:53,402 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:05:02,462 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:05:45,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {3222#true} call ULTIMATE.init(); {3222#true} is VALID [2022-04-28 11:05:45,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {3222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3222#true} is VALID [2022-04-28 11:05:45,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {3222#true} assume true; {3222#true} is VALID [2022-04-28 11:05:45,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3222#true} {3222#true} #62#return; {3222#true} is VALID [2022-04-28 11:05:45,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {3222#true} call #t~ret9 := main(); {3222#true} is VALID [2022-04-28 11:05:45,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {3222#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; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {3242#(= main_~y~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {3242#(= main_~y~0 0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,077 INFO L272 TraceCheckUtils]: 8: Hoare triple {3242#(= 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)); {3222#true} is VALID [2022-04-28 11:05:45,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {3222#true} ~cond := #in~cond; {3222#true} is VALID [2022-04-28 11:05:45,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {3222#true} assume !(0 == ~cond); {3222#true} is VALID [2022-04-28 11:05:45,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {3222#true} assume true; {3222#true} is VALID [2022-04-28 11:05:45,078 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3222#true} {3242#(= main_~y~0 0)} #58#return; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {3242#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {3242#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {3242#(= main_~y~0 0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {3242#(= main_~y~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {3242#(= main_~y~0 0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,080 INFO L272 TraceCheckUtils]: 18: Hoare triple {3242#(= 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)); {3222#true} is VALID [2022-04-28 11:05:45,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#true} ~cond := #in~cond; {3222#true} is VALID [2022-04-28 11:05:45,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#true} assume !(0 == ~cond); {3222#true} is VALID [2022-04-28 11:05:45,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#true} assume true; {3222#true} is VALID [2022-04-28 11:05:45,081 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3222#true} {3242#(= main_~y~0 0)} #58#return; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {3242#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {3242#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#(= main_~y~0 0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {3242#(= main_~y~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:45,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {3242#(= main_~y~0 0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3309#(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 11:05:45,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(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)); {3222#true} is VALID [2022-04-28 11:05:45,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {3222#true} ~cond := #in~cond; {3316#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:45,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {3316#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:45,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:45,085 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} {3309#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #58#return; {3327#(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 11:05:45,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {3327#(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); {3327#(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 11:05:47,088 WARN L290 TraceCheckUtils]: 34: Hoare triple {3327#(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; {3334#(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 11:05:47,090 INFO L272 TraceCheckUtils]: 35: Hoare triple {3334#(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)); {3338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:47,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {3338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:47,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {3342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3223#false} is VALID [2022-04-28 11:05:47,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {3223#false} assume !false; {3223#false} is VALID [2022-04-28 11:05:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:05:47,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:05:51,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {3223#false} assume !false; {3223#false} is VALID [2022-04-28 11:05:51,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {3342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3223#false} is VALID [2022-04-28 11:05:51,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {3338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:05:51,252 INFO L272 TraceCheckUtils]: 35: Hoare triple {3358#(= (+ (* 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)); {3338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:05:51,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {3362#(= (+ (* 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; {3358#(= (+ (* 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 11:05:51,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {3362#(= (+ (* 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); {3362#(= (+ (* 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 11:05:51,255 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} {3369#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #58#return; {3362#(= (+ (* 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 11:05:51,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:51,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {3379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:05:51,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {3222#true} ~cond := #in~cond; {3379#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:05:51,256 INFO L272 TraceCheckUtils]: 28: Hoare triple {3369#(= (+ (* 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)); {3222#true} is VALID [2022-04-28 11:05:51,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {3242#(= main_~y~0 0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3369#(= (+ (* 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 11:05:51,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {3242#(= main_~y~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#(= main_~y~0 0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {3242#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {3242#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,258 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3222#true} {3242#(= main_~y~0 0)} #58#return; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {3222#true} assume true; {3222#true} is VALID [2022-04-28 11:05:51,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {3222#true} assume !(0 == ~cond); {3222#true} is VALID [2022-04-28 11:05:51,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {3222#true} ~cond := #in~cond; {3222#true} is VALID [2022-04-28 11:05:51,258 INFO L272 TraceCheckUtils]: 18: Hoare triple {3242#(= 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)); {3222#true} is VALID [2022-04-28 11:05:51,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {3242#(= main_~y~0 0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3242#(= main_~y~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {3242#(= main_~y~0 0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {3242#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {3242#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,261 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3222#true} {3242#(= main_~y~0 0)} #58#return; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {3222#true} assume true; {3222#true} is VALID [2022-04-28 11:05:51,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {3222#true} assume !(0 == ~cond); {3222#true} is VALID [2022-04-28 11:05:51,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {3222#true} ~cond := #in~cond; {3222#true} is VALID [2022-04-28 11:05:51,261 INFO L272 TraceCheckUtils]: 8: Hoare triple {3242#(= 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)); {3222#true} is VALID [2022-04-28 11:05:51,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {3242#(= main_~y~0 0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {3242#(= main_~y~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {3222#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; {3242#(= main_~y~0 0)} is VALID [2022-04-28 11:05:51,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {3222#true} call #t~ret9 := main(); {3222#true} is VALID [2022-04-28 11:05:51,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3222#true} {3222#true} #62#return; {3222#true} is VALID [2022-04-28 11:05:51,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {3222#true} assume true; {3222#true} is VALID [2022-04-28 11:05:51,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {3222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3222#true} is VALID [2022-04-28 11:05:51,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {3222#true} call ULTIMATE.init(); {3222#true} is VALID [2022-04-28 11:05:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 11:05:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:05:51,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701401293] [2022-04-28 11:05:51,263 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:05:51,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377278105] [2022-04-28 11:05:51,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377278105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:05:51,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:05:51,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-28 11:05:51,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:05:51,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1416454053] [2022-04-28 11:05:51,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1416454053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:05:51,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:05:51,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:05:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885917124] [2022-04-28 11:05:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:05:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 39 [2022-04-28 11:05:51,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:05:51,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 11:05:53,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:05:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:05:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:05:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:05:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:05:53,289 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 11:05:55,339 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 11:05:59,419 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 11:06:01,430 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 11:06:03,442 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 11:06:05,547 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 11:06:07,573 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 11:06:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:09,900 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-04-28 11:06:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:06:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 39 [2022-04-28 11:06:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:06:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 11:06:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:06:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 11:06:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:06:09,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-28 11:06:11,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:11,942 INFO L225 Difference]: With dead ends: 67 [2022-04-28 11:06:11,942 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 11:06:11,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2022-04-28 11:06:11,942 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:06:11,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 78 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 12.2s Time] [2022-04-28 11:06:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 11:06:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-28 11:06:12,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:06:12,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:06:12,010 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:06:12,010 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:06:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:12,012 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 11:06:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-28 11:06:12,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:12,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:06:12,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 61 states. [2022-04-28 11:06:12,012 INFO L87 Difference]: Start difference. First operand has 59 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 61 states. [2022-04-28 11:06:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:12,020 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-28 11:06:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-04-28 11:06:12,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:12,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:06:12,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:06:12,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:06:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 11:06:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-04-28 11:06:12,022 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 39 [2022-04-28 11:06:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:06:12,022 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-04-28 11:06:12,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 11:06:12,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 68 transitions. [2022-04-28 11:06:20,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 64 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-04-28 11:06:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 11:06:20,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:06:20,293 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:06:20,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 11:06:20,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 11:06:20,494 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:06:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:06:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1449367094, now seen corresponding path program 1 times [2022-04-28 11:06:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:06:20,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975461026] [2022-04-28 11:06:20,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:06:20,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:06:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1449367094, now seen corresponding path program 2 times [2022-04-28 11:06:20,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:06:20,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011415526] [2022-04-28 11:06:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:06:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:06:20,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:06:20,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083713120] [2022-04-28 11:06:20,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:06:20,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:06:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:06:20,611 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:06:20,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 11:06:20,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:06:20,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:06:20,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 11:06:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:06:20,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:06:21,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-28 11:06:21,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3851#true} is VALID [2022-04-28 11:06:21,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #62#return; {3851#true} is VALID [2022-04-28 11:06:21,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret9 := main(); {3851#true} is VALID [2022-04-28 11:06:21,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#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; {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:06:21,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:06:21,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:06:21,456 INFO L272 TraceCheckUtils]: 8: Hoare triple {3871#(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)); {3851#true} is VALID [2022-04-28 11:06:21,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#true} ~cond := #in~cond; {3851#true} is VALID [2022-04-28 11:06:21,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {3851#true} assume !(0 == ~cond); {3851#true} is VALID [2022-04-28 11:06:21,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,457 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3851#true} {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #58#return; {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:06:21,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {3871#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 11:06:21,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {3871#(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; {3899#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:06:21,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {3899#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:06:21,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:06:21,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:06:21,460 INFO L272 TraceCheckUtils]: 18: Hoare triple {3903#(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)); {3851#true} is VALID [2022-04-28 11:06:21,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {3851#true} ~cond := #in~cond; {3851#true} is VALID [2022-04-28 11:06:21,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {3851#true} assume !(0 == ~cond); {3851#true} is VALID [2022-04-28 11:06:21,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,461 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3851#true} {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #58#return; {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:06:21,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {3903#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 11:06:21,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {3903#(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~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {3931#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:06:21,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {3931#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:06:21,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:06:21,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:06:21,464 INFO L272 TraceCheckUtils]: 28: Hoare triple {3935#(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)); {3851#true} is VALID [2022-04-28 11:06:21,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {3851#true} ~cond := #in~cond; {3851#true} is VALID [2022-04-28 11:06:21,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {3851#true} assume !(0 == ~cond); {3851#true} is VALID [2022-04-28 11:06:21,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,465 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3851#true} {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #58#return; {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 11:06:21,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {3935#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {3852#false} is VALID [2022-04-28 11:06:21,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {3852#false} is VALID [2022-04-28 11:06:21,466 INFO L272 TraceCheckUtils]: 35: Hoare triple {3852#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)); {3852#false} is VALID [2022-04-28 11:06:21,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-28 11:06:21,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-28 11:06:21,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-28 11:06:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:06:21,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:06:21,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-28 11:06:21,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-28 11:06:21,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-28 11:06:21,808 INFO L272 TraceCheckUtils]: 35: Hoare triple {3852#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)); {3852#false} is VALID [2022-04-28 11:06:21,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {3852#false} is VALID [2022-04-28 11:06:21,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {3990#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {3852#false} is VALID [2022-04-28 11:06:21,809 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3851#true} {3990#(<= main_~x~0 main_~X~0)} #58#return; {3990#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:06:21,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {3851#true} assume !(0 == ~cond); {3851#true} is VALID [2022-04-28 11:06:21,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {3851#true} ~cond := #in~cond; {3851#true} is VALID [2022-04-28 11:06:21,810 INFO L272 TraceCheckUtils]: 28: Hoare triple {3990#(<= 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)); {3851#true} is VALID [2022-04-28 11:06:21,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {3990#(<= main_~x~0 main_~X~0)} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3990#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:06:21,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {3990#(<= main_~x~0 main_~X~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3990#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:06:21,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {4015#(<= (+ main_~x~0 1) main_~X~0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {3990#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 11:06:21,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {4019#(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~post7 := ~y~0;~y~0 := 1 + #t~post7;havoc #t~post7; {4015#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 11:06:21,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:06:21,813 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3851#true} {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #58#return; {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:06:21,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {3851#true} assume !(0 == ~cond); {3851#true} is VALID [2022-04-28 11:06:21,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {3851#true} ~cond := #in~cond; {3851#true} is VALID [2022-04-28 11:06:21,813 INFO L272 TraceCheckUtils]: 18: Hoare triple {4019#(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)); {3851#true} is VALID [2022-04-28 11:06:21,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:06:21,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:06:21,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {4047#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {4019#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 11:06:21,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {4051#(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; {4047#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 11:06:21,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {4051#(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); {4051#(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 11:06:21,817 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3851#true} {4051#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #58#return; {4051#(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 11:06:21,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {3851#true} assume !(0 == ~cond); {3851#true} is VALID [2022-04-28 11:06:21,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {3851#true} ~cond := #in~cond; {3851#true} is VALID [2022-04-28 11:06:21,817 INFO L272 TraceCheckUtils]: 8: Hoare triple {4051#(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)); {3851#true} is VALID [2022-04-28 11:06:21,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {4051#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4051#(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 11:06:21,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {4051#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4051#(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 11:06:21,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#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; {4051#(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 11:06:21,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret9 := main(); {3851#true} is VALID [2022-04-28 11:06:21,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #62#return; {3851#true} is VALID [2022-04-28 11:06:21,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-28 11:06:21,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3851#true} is VALID [2022-04-28 11:06:21,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-28 11:06:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 11:06:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:06:21,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011415526] [2022-04-28 11:06:21,822 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:06:21,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083713120] [2022-04-28 11:06:21,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083713120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:06:21,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:06:21,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 11:06:21,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:06:21,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975461026] [2022-04-28 11:06:21,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975461026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:06:21,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:06:21,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:06:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676766224] [2022-04-28 11:06:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:06:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 39 [2022-04-28 11:06:21,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:06:21,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 11:06:21,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:21,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:06:21,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:06:21,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:06:21,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:06:21,855 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 11:06:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:22,189 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-28 11:06:22,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:06:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 39 [2022-04-28 11:06:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:06:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 11:06:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-28 11:06:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 11:06:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-28 11:06:22,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-28 11:06:22,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:22,246 INFO L225 Difference]: With dead ends: 72 [2022-04-28 11:06:22,246 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 11:06:22,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 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 11:06:22,247 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:06:22,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 85 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:06:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 11:06:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-28 11:06:22,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:06:22,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:06:22,337 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:06:22,337 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:06:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:22,338 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 11:06:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:06:22,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:22,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:06:22,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-28 11:06:22,339 INFO L87 Difference]: Start difference. First operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 66 states. [2022-04-28 11:06:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:06:22,341 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2022-04-28 11:06:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-04-28 11:06:22,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:06:22,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:06:22,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:06:22,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:06:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 11:06:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2022-04-28 11:06:22,343 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 39 [2022-04-28 11:06:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:06:22,343 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2022-04-28 11:06:22,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 11:06:22,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 74 transitions. [2022-04-28 11:06:33,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 69 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 11:06:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-28 11:06:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 11:06:33,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:06:33,120 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:06:33,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 11:06:33,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:06:33,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:06:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:06:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1425187914, now seen corresponding path program 3 times [2022-04-28 11:06:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:06:33,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2023249647] [2022-04-28 11:06:33,395 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:06:33,396 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:06:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1425187914, now seen corresponding path program 4 times [2022-04-28 11:06:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:06:33,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153235107] [2022-04-28 11:06:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:06:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:06:33,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:06:33,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [381550986] [2022-04-28 11:06:33,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:06:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:06:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:06:33,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:06:33,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 11:06:34,139 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:06:34,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:06:34,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 11:06:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:06:34,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:06:50,546 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:06:59,580 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:07:05,621 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful