/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:24:55,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:24:55,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:24:55,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:24:55,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:24:55,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:24:55,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:24:55,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:24:55,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:24:55,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:24:55,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:24:55,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:24:55,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:24:55,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:24:55,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:24:55,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:24:55,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:24:55,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:24:55,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:24:55,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:24:55,332 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:24:55,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:24:55,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:24:55,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:24:55,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:24:55,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:24:55,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:24:55,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:24:55,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:24:55,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:24:55,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:24:55,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:24:55,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:24:55,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:24:55,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:24:55,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:24:55,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:24:55,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:24:55,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:24:55,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:24:55,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:24:55,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:24:55,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:24:55,370 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:24:55,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:24:55,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:24:55,372 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:24:55,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:24:55,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:24:55,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:24:55,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:24:55,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:24:55,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:24:55,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:24:55,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:24:55,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:24:55,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:24:55,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:24:55,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:24:55,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:24:55,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:24:55,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:24:55,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:24:55,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:24:55,374 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:24:55,375 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:24:55,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:24:55,375 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:24:55,375 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 10:24:55,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:24:55,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:24:55,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:24:55,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:24:55,593 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:24:55,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-15 10:24:55,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dd27171/e96bc201653d46a4b9e6cce080419571/FLAGf4600efb2 [2022-04-15 10:24:56,023 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:24:56,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound10.c [2022-04-15 10:24:56,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dd27171/e96bc201653d46a4b9e6cce080419571/FLAGf4600efb2 [2022-04-15 10:24:56,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9dd27171/e96bc201653d46a4b9e6cce080419571 [2022-04-15 10:24:56,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:24:56,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:24:56,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:24:56,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:24:56,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:24:56,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cdc2ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56, skipping insertion in model container [2022-04-15 10:24:56,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:24:56,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:24:56,609 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/prod4br-ll_valuebound10.c[524,537] [2022-04-15 10:24:56,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:24:56,638 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:24:56,647 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/prod4br-ll_valuebound10.c[524,537] [2022-04-15 10:24:56,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:24:56,671 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:24:56,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56 WrapperNode [2022-04-15 10:24:56,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:24:56,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:24:56,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:24:56,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:24:56,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:24:56,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:24:56,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:24:56,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:24:56,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (1/1) ... [2022-04-15 10:24:56,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:24:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:24:56,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 10:24:56,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 10:24:56,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 10:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:24:56,830 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:24:56,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:24:57,073 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:24:57,079 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:24:57,079 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:24:57,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:24:57 BoogieIcfgContainer [2022-04-15 10:24:57,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:24:57,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:24:57,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:24:57,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:24:57,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:24:56" (1/3) ... [2022-04-15 10:24:57,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1298d58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:24:57, skipping insertion in model container [2022-04-15 10:24:57,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:24:56" (2/3) ... [2022-04-15 10:24:57,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1298d58e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:24:57, skipping insertion in model container [2022-04-15 10:24:57,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:24:57" (3/3) ... [2022-04-15 10:24:57,088 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound10.c [2022-04-15 10:24:57,092 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:24:57,092 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:24:57,124 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:24:57,130 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 10:24:57,130 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:24:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:24:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 10:24:57,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:24:57,153 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:24:57,153 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:24:57,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:24:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-15 10:24:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:24:57,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273767961] [2022-04-15 10:24:57,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:24:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-15 10:24:57,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:24:57,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686959367] [2022-04-15 10:24:57,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:24:57,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:24:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:24:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:57,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-15 10:24:57,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 10:24:57,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-15 10:24:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:24:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:57,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 10:24:57,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 10:24:57,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 10:24:57,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-15 10:24:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 10:24:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:57,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 10:24:57,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 10:24:57,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 10:24:57,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-15 10:24:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 10:24:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:57,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 10:24:57,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 10:24:57,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 10:24:57,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-15 10:24:57,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:24:57,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-15 10:24:57,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 10:24:57,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-15 10:24:57,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-15 10:24:57,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-15 10:24:57,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-15 10:24:57,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 10:24:57,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 10:24:57,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 10:24:57,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-15 10:24:57,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-15 10:24:57,349 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {37#true} is VALID [2022-04-15 10:24:57,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 10:24:57,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 10:24:57,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 10:24:57,351 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-15 10:24:57,351 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-15 10:24:57,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 10:24:57,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 10:24:57,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 10:24:57,352 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-15 10:24:57,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-15 10:24:57,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-15 10:24:57,353 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-15 10:24:57,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-15 10:24:57,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-15 10:24:57,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-15 10:24:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:24:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:24:57,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686959367] [2022-04-15 10:24:57,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686959367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:24:57,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:24:57,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:24:57,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:24:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273767961] [2022-04-15 10:24:57,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273767961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:24:57,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:24:57,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:24:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836745055] [2022-04-15 10:24:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:24:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 10:24:57,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:24:57,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 10:24:57,394 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-15 10:24:57,394 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:24:57,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:24:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:24:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:24:57,420 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 10:24:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:24:57,606 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-15 10:24:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:24:57,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 10:24:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:24:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 10:24:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-15 10:24:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 10:24:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-15 10:24:57,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-15 10:24:57,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:24:57,725 INFO L225 Difference]: With dead ends: 61 [2022-04-15 10:24:57,726 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 10:24:57,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-15 10:24:57,731 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:24:57,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:24:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 10:24:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 10:24:57,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:24:57,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:24:57,762 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:24:57,762 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:24:57,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:24:57,767 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 10:24:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 10:24:57,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:24:57,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:24:57,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 10:24:57,769 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 10:24:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:24:57,775 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 10:24:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 10:24:57,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:24:57,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:24:57,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:24:57,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:24:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:24:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-15 10:24:57,785 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-15 10:24:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:24:57,785 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-15 10:24:57,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 10:24:57,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-15 10:24:57,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:24:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 10:24:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 10:24:57,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:24:57,831 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:24:57,832 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:24:57,833 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:24:57,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:24:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-15 10:24:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:24:57,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2018339981] [2022-04-15 10:24:57,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:24:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-15 10:24:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:24:57,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021726374] [2022-04-15 10:24:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:24:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:24:57,895 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:24:57,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [999350057] [2022-04-15 10:24:57,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:24:57,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:24:57,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:24:57,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:24:57,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 10:24:57,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:24:57,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:24:57,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 10:24:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:57,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:24:58,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-15 10:24:58,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-15 10:24:58,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 10:24:58,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-15 10:24:58,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-15 10:24:58,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {295#true} is VALID [2022-04-15 10:24:58,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {295#true} is VALID [2022-04-15 10:24:58,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-15 10:24:58,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-15 10:24:58,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 10:24:58,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-15 10:24:58,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {295#true} is VALID [2022-04-15 10:24:58,218 INFO L272 TraceCheckUtils]: 12: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {295#true} is VALID [2022-04-15 10:24:58,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-15 10:24:58,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-15 10:24:58,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 10:24:58,218 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-15 10:24:58,219 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {295#true} is VALID [2022-04-15 10:24:58,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-15 10:24:58,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-15 10:24:58,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-15 10:24:58,219 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-15 10:24:58,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:24:58,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:24:58,225 INFO L272 TraceCheckUtils]: 24: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:24:58,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:24:58,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-15 10:24:58,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-15 10:24:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:24:58,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:24:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:24:58,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021726374] [2022-04-15 10:24:58,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:24:58,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999350057] [2022-04-15 10:24:58,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999350057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:24:58,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:24:58,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:24:58,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:24:58,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2018339981] [2022-04-15 10:24:58,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2018339981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:24:58,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:24:58,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:24:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737930670] [2022-04-15 10:24:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:24:58,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 10:24:58,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:24:58,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 10:24:58,271 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-15 10:24:58,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:24:58,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:24:58,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:24:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:24:58,273 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 10:24:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:24:58,496 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-15 10:24:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:24:58,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 10:24:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:24:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 10:24:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 10:24:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 10:24:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-15 10:24:58,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-15 10:24:58,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:24:58,571 INFO L225 Difference]: With dead ends: 43 [2022-04-15 10:24:58,572 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 10:24:58,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 10:24:58,579 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:24:58,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:24:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 10:24:58,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-15 10:24:58,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:24:58,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:24:58,604 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:24:58,604 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:24:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:24:58,607 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 10:24:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-15 10:24:58,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:24:58,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:24:58,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 10:24:58,609 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-15 10:24:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:24:58,611 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 10:24:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-15 10:24:58,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:24:58,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:24:58,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:24:58,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:24:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:24:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-15 10:24:58,616 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-15 10:24:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:24:58,617 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-15 10:24:58,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 10:24:58,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-15 10:24:58,664 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-15 10:24:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-15 10:24:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 10:24:58,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:24:58,667 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:24:58,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 10:24:58,879 WARN L460 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-15 10:24:58,880 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:24:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:24:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-15 10:24:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:24:58,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [457843013] [2022-04-15 10:24:58,881 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:24:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-15 10:24:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:24:58,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310182373] [2022-04-15 10:24:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:24:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:24:58,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:24:58,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242895972] [2022-04-15 10:24:58,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:24:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:24:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:24:58,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:24:58,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 10:24:58,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:24:58,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:24:58,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 10:24:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:24:58,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:25:09,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-15 10:25:09,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 10:25:09,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 10:25:09,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-15 10:25:09,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-15 10:25:09,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-15 10:25:09,778 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-15 10:25:09,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:25:09,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:25:09,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:25:09,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #71#return; {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:25:09,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:25:09,782 INFO L272 TraceCheckUtils]: 12: Hoare triple {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-15 10:25:09,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 10:25:09,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 10:25:09,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 10:25:09,789 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:25:09,790 INFO L272 TraceCheckUtils]: 17: Hoare triple {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-15 10:25:09,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:25:09,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:25:09,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:25:09,792 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {660#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {694#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:25:09,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:25:09,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:25:09,794 INFO L272 TraceCheckUtils]: 24: Hoare triple {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-15 10:25:09,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:25:09,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:25:09,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:25:11,799 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {698#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {719#(and (<= main_~x~0 10) (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 10:25:11,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {719#(and (<= main_~x~0 10) (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:25:11,802 INFO L272 TraceCheckUtils]: 30: Hoare triple {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:25:11,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:25:11,803 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-15 10:25:11,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 10:25:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 10:25:11,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:26:06,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-15 10:26:06,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-15 10:26:06,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:26:06,863 INFO L272 TraceCheckUtils]: 30: Hoare triple {747#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:26:06,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {747#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:26:06,865 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {623#true} #77#return; {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:26:06,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:26:06,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:26:06,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:26:06,866 INFO L272 TraceCheckUtils]: 24: Hoare triple {623#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-15 10:26:06,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-15 10:26:06,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {623#true} is VALID [2022-04-15 10:26:06,867 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-15 10:26:06,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 10:26:06,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 10:26:06,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 10:26:06,868 INFO L272 TraceCheckUtils]: 17: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-15 10:26:06,868 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-15 10:26:06,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 10:26:06,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 10:26:06,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 10:26:06,868 INFO L272 TraceCheckUtils]: 12: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-15 10:26:06,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-15 10:26:06,869 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-15 10:26:06,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 10:26:06,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-15 10:26:06,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-15 10:26:06,869 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {623#true} is VALID [2022-04-15 10:26:06,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-15 10:26:06,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-15 10:26:06,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-15 10:26:06,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-15 10:26:06,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-15 10:26:06,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-15 10:26:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:26:06,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:26:06,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310182373] [2022-04-15 10:26:06,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:26:06,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242895972] [2022-04-15 10:26:06,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242895972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:26:06,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:26:06,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-15 10:26:06,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:26:06,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [457843013] [2022-04-15 10:26:06,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [457843013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:26:06,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:26:06,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 10:26:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298498390] [2022-04-15 10:26:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:26:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-15 10:26:06,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:26:06,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:26:08,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:08,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 10:26:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:08,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 10:26:08,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:26:08,902 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:26:11,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:26:16,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:26:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:16,887 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-15 10:26:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 10:26:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-15 10:26:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:26:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:26:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-15 10:26:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:26:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-15 10:26:16,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-15 10:26:16,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:16,950 INFO L225 Difference]: With dead ends: 47 [2022-04-15 10:26:16,950 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 10:26:16,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-15 10:26:16,951 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 10:26:16,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 10:26:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 10:26:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-15 10:26:17,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:26:17,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:26:17,014 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:26:17,015 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:26:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:17,017 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 10:26:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 10:26:17,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:17,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:17,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 10:26:17,019 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 10:26:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:26:17,021 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 10:26:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-15 10:26:17,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:26:17,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:26:17,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:26:17,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:26:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:26:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-15 10:26:17,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-15 10:26:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:26:17,025 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-15 10:26:17,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:26:17,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-15 10:26:17,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:26:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-15 10:26:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 10:26:17,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:26:17,081 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:26:17,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 10:26:17,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 10:26:17,291 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:26:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:26:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-15 10:26:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:26:17,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [577925513] [2022-04-15 10:26:17,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:26:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-15 10:26:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:26:17,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555246242] [2022-04-15 10:26:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:26:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:26:17,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:26:17,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853472547] [2022-04-15 10:26:17,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:26:17,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:26:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:26:17,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:26:17,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 10:26:17,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:26:17,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:26:17,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 10:26:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:26:17,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:26:20,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 10:26:20,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-15 10:26:20,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:26:20,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-15 10:26:20,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 10:26:20,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-15 10:26:20,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:26:20,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:26:20,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:26:20,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:26:20,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #71#return; {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:26:20,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:26:20,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:26:20,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 10:26:20,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 10:26:20,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:26:20,471 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:26:20,471 INFO L272 TraceCheckUtils]: 17: Hoare triple {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:26:20,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:26:20,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:26:20,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:26:20,473 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1153#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {1187#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:26:20,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {1187#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:26:20,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:26:20,474 INFO L272 TraceCheckUtils]: 24: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:26:20,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 10:26:20,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 10:26:20,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:26:20,475 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:26:20,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:26:20,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {1191#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 10:26:20,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} assume !false; {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 10:26:20,485 INFO L272 TraceCheckUtils]: 32: Hoare triple {1216#(and (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:26:20,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:26:20,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 10:26:20,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 10:26:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 10:26:20,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:27:20,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-15 10:27:20,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {1227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-15 10:27:20,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:20,372 INFO L272 TraceCheckUtils]: 32: Hoare triple {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:20,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:20,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1243#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:20,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 10:27:20,379 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#true} {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} #77#return; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 10:27:20,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:27:20,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 10:27:20,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 10:27:20,383 INFO L272 TraceCheckUtils]: 24: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:27:20,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !false; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 10:27:20,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {1275#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1250#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-15 10:27:20,390 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #75#return; {1275#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-15 10:27:20,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:20,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {1288#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:20,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1288#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 10:27:20,391 INFO L272 TraceCheckUtils]: 17: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:27:20,391 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1116#true} #73#return; {1116#true} is VALID [2022-04-15 10:27:20,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:27:20,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 10:27:20,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 10:27:20,392 INFO L272 TraceCheckUtils]: 12: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:27:20,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1116#true} is VALID [2022-04-15 10:27:20,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-15 10:27:20,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-15 10:27:20,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-15 10:27:20,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-15 10:27:20,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-15 10:27:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 10:27:20,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:27:20,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555246242] [2022-04-15 10:27:20,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:27:20,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853472547] [2022-04-15 10:27:20,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853472547] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:27:20,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:27:20,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-15 10:27:20,395 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:27:20,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [577925513] [2022-04-15 10:27:20,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [577925513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:27:20,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:27:20,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 10:27:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740009089] [2022-04-15 10:27:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:27:20,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 10:27:20,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:27:20,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:20,430 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-15 10:27:20,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 10:27:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 10:27:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:27:20,432 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:21,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:21,435 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-15 10:27:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:27:21,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 10:27:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:27:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-15 10:27:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-15 10:27:21,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-15 10:27:21,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:21,520 INFO L225 Difference]: With dead ends: 59 [2022-04-15 10:27:21,520 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 10:27:21,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:27:21,521 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 48 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 10:27:21,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 125 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 10:27:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 10:27:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2022-04-15 10:27:21,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:27:21,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:21,578 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:21,578 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:21,581 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 10:27:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-15 10:27:21,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:21,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:21,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 57 states. [2022-04-15 10:27:21,582 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 57 states. [2022-04-15 10:27:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:21,585 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 10:27:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2022-04-15 10:27:21,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:21,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:21,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:27:21,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:27:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-04-15 10:27:21,588 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 36 [2022-04-15 10:27:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:27:21,588 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-04-15 10:27:21,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:21,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 57 transitions. [2022-04-15 10:27:21,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-04-15 10:27:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 10:27:21,661 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:27:21,661 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:27:21,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 10:27:21,871 WARN L460 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-15 10:27:21,872 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:27:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:27:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 1 times [2022-04-15 10:27:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:21,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070797873] [2022-04-15 10:27:21,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:27:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 2 times [2022-04-15 10:27:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:27:21,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827012293] [2022-04-15 10:27:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:27:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:27:21,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:27:21,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395808798] [2022-04-15 10:27:21,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:27:21,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:27:21,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:27:21,907 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:27:21,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 10:27:21,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:27:21,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:27:21,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 10:27:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:27:21,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:27:22,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-15 10:27:22,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-04-15 10:27:22,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:22,288 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:22,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 10:27:22,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 10:27:22,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:22,290 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1677#true} {1677#true} #75#return; {1677#true} is VALID [2022-04-15 10:27:22,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {1677#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,291 INFO L272 TraceCheckUtils]: 24: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:22,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1758#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:22,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {1758#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:22,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:22,293 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {1748#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} assume !false; {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-15 10:27:22,298 INFO L272 TraceCheckUtils]: 33: Hoare triple {1778#(and (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:22,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1789#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:22,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {1789#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-15 10:27:22,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-15 10:27:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:27:22,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:27:34,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2022-04-15 10:27:34,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {1789#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1678#false} is VALID [2022-04-15 10:27:34,748 INFO L290 TraceCheckUtils]: 34: Hoare triple {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1789#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:34,750 INFO L272 TraceCheckUtils]: 33: Hoare triple {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1785#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:34,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:34,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1805#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:34,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 10:27:34,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 10:27:34,763 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} {1677#true} #77#return; {1812#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-15 10:27:34,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:34,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {1831#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:34,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#true} ~cond := #in~cond; {1831#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:27:34,764 INFO L272 TraceCheckUtils]: 24: Hoare triple {1677#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:34,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {1677#true} assume !false; {1677#true} is VALID [2022-04-15 10:27:34,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {1677#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1677#true} {1677#true} #75#return; {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1677#true} {1677#true} #73#return; {1677#true} is VALID [2022-04-15 10:27:34,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {1677#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {1677#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1677#true} {1677#true} #71#return; {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:34,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {1677#true} assume !(0 == ~cond); {1677#true} is VALID [2022-04-15 10:27:34,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1677#true} ~cond := #in~cond; {1677#true} is VALID [2022-04-15 10:27:34,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {1677#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {1677#true} is VALID [2022-04-15 10:27:34,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {1677#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1677#true} is VALID [2022-04-15 10:27:34,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {1677#true} call #t~ret6 := main(); {1677#true} is VALID [2022-04-15 10:27:34,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1677#true} {1677#true} #83#return; {1677#true} is VALID [2022-04-15 10:27:34,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {1677#true} assume true; {1677#true} is VALID [2022-04-15 10:27:34,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1677#true} is VALID [2022-04-15 10:27:34,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2022-04-15 10:27:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:27:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:27:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827012293] [2022-04-15 10:27:34,772 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:27:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395808798] [2022-04-15 10:27:34,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395808798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:27:34,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:27:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-15 10:27:34,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:27:34,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070797873] [2022-04-15 10:27:34,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070797873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:27:34,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:27:34,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:27:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122957035] [2022-04-15 10:27:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:27:34,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 10:27:34,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:27:34,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:34,806 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-15 10:27:34,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:27:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:34,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:27:34,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:27:34,807 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:35,716 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-04-15 10:27:35,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:27:35,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 10:27:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:27:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-15 10:27:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-15 10:27:35,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-15 10:27:35,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:35,803 INFO L225 Difference]: With dead ends: 77 [2022-04-15 10:27:35,803 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 10:27:35,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:27:35,804 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 10:27:35,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 117 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 10:27:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 10:27:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-04-15 10:27:35,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:27:35,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:27:35,894 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:27:35,894 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:27:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:35,896 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-15 10:27:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-04-15 10:27:35,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:35,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:35,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 63 states. [2022-04-15 10:27:35,898 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 63 states. [2022-04-15 10:27:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:35,900 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-15 10:27:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2022-04-15 10:27:35,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:35,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:35,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:27:35,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:27:35,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:27:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-15 10:27:35,903 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 37 [2022-04-15 10:27:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:27:35,903 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-15 10:27:35,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:35,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2022-04-15 10:27:36,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-15 10:27:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 10:27:36,032 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:27:36,032 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:27:36,057 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-15 10:27:36,233 WARN L460 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-15 10:27:36,233 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:27:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:27:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-15 10:27:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638402893] [2022-04-15 10:27:36,234 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:27:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-15 10:27:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:27:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828258504] [2022-04-15 10:27:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:27:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:27:36,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:27:36,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108490173] [2022-04-15 10:27:36,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:27:36,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:27:36,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:27:36,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:27:36,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 10:27:36,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:27:36,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:27:36,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 10:27:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:27:36,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:27:36,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2311#true} call ULTIMATE.init(); {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2311#true} {2311#true} #83#return; {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {2311#true} call #t~ret6 := main(); {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {2311#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {2311#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#true} ~cond := #in~cond; {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:27:36,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:36,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:36,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} {2311#true} #71#return; {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:36,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:36,566 INFO L272 TraceCheckUtils]: 12: Hoare triple {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,568 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2311#true} {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:36,568 INFO L272 TraceCheckUtils]: 17: Hoare triple {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {2311#true} ~cond := #in~cond; {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:27:36,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {2337#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:36,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2341#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:36,570 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2341#(not (= |assume_abort_if_not_#in~cond| 0))} {2348#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {2382#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:27:36,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:27:36,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:27:36,571 INFO L272 TraceCheckUtils]: 24: Hoare triple {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,572 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2311#true} {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:27:36,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {2386#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:27:36,572 INFO L272 TraceCheckUtils]: 30: Hoare triple {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,573 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2311#true} {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} #79#return; {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:27:36,574 INFO L272 TraceCheckUtils]: 35: Hoare triple {2408#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:36,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:36,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2312#false} is VALID [2022-04-15 10:27:36,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#false} assume !false; {2312#false} is VALID [2022-04-15 10:27:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 10:27:36,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:27:36,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {2312#false} assume !false; {2312#false} is VALID [2022-04-15 10:27:36,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {2431#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2312#false} is VALID [2022-04-15 10:27:36,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:36,813 INFO L272 TraceCheckUtils]: 35: Hoare triple {2447#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:36,813 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2311#true} {2447#(= (* main_~b~0 main_~a~0) 0)} #79#return; {2447#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-15 10:27:36,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,814 INFO L272 TraceCheckUtils]: 30: Hoare triple {2447#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {2311#true} assume !(0 != ~a~0 && 0 != ~b~0); {2447#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-15 10:27:36,815 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2311#true} {2311#true} #77#return; {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L272 TraceCheckUtils]: 24: Hoare triple {2311#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {2311#true} assume !false; {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {2311#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2311#true} {2311#true} #75#return; {2311#true} is VALID [2022-04-15 10:27:36,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L272 TraceCheckUtils]: 17: Hoare triple {2311#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2311#true} {2311#true} #73#return; {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L272 TraceCheckUtils]: 12: Hoare triple {2311#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2311#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2311#true} is VALID [2022-04-15 10:27:36,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2311#true} {2311#true} #71#return; {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {2311#true} assume !(0 == ~cond); {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#true} ~cond := #in~cond; {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L272 TraceCheckUtils]: 6: Hoare triple {2311#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {2311#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {2311#true} call #t~ret6 := main(); {2311#true} is VALID [2022-04-15 10:27:36,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2311#true} {2311#true} #83#return; {2311#true} is VALID [2022-04-15 10:27:36,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {2311#true} assume true; {2311#true} is VALID [2022-04-15 10:27:36,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {2311#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2311#true} is VALID [2022-04-15 10:27:36,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {2311#true} call ULTIMATE.init(); {2311#true} is VALID [2022-04-15 10:27:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 10:27:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:27:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828258504] [2022-04-15 10:27:36,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:27:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108490173] [2022-04-15 10:27:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108490173] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:27:36,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:27:36,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-15 10:27:36,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:27:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638402893] [2022-04-15 10:27:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638402893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:27:36,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:27:36,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:27:36,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269768858] [2022-04-15 10:27:36,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:27:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-15 10:27:36,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:27:36,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:27:36,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:36,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:27:36,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:36,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:27:36,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:27:36,848 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:27:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:37,332 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-15 10:27:37,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:27:37,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-15 10:27:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:27:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:27:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 10:27:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:27:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 10:27:37,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 10:27:37,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:37,370 INFO L225 Difference]: With dead ends: 65 [2022-04-15 10:27:37,370 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 10:27:37,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:27:37,371 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:27:37,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:27:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 10:27:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 10:27:37,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:27:37,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:37,433 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:37,434 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:37,436 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-15 10:27:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-15 10:27:37,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:37,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:37,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 10:27:37,437 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 10:27:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:37,438 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-15 10:27:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-15 10:27:37,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:37,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:37,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:27:37,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:27:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2022-04-15 10:27:37,441 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 39 [2022-04-15 10:27:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:27:37,441 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2022-04-15 10:27:37,441 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:27:37,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 64 transitions. [2022-04-15 10:27:37,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-15 10:27:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 10:27:37,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:27:37,524 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:27:37,540 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-15 10:27:37,727 WARN L460 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-15 10:27:37,727 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:27:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:27:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 1 times [2022-04-15 10:27:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:37,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404496797] [2022-04-15 10:27:37,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:27:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 2 times [2022-04-15 10:27:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:27:37,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103026925] [2022-04-15 10:27:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:27:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:27:37,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:27:37,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210553997] [2022-04-15 10:27:37,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:27:37,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:27:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:27:37,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:27:37,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 10:27:37,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:27:37,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:27:37,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 10:27:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:27:37,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:27:38,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {2899#true} call ULTIMATE.init(); {2899#true} is VALID [2022-04-15 10:27:38,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2899#true} is VALID [2022-04-15 10:27:38,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:38,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2899#true} {2899#true} #83#return; {2899#true} is VALID [2022-04-15 10:27:38,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {2899#true} call #t~ret6 := main(); {2899#true} is VALID [2022-04-15 10:27:38,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {2899#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2899#true} is VALID [2022-04-15 10:27:38,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {2899#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:38,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#true} ~cond := #in~cond; {2925#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:27:38,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {2925#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2929#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:38,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {2929#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2929#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:27:38,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2929#(not (= |assume_abort_if_not_#in~cond| 0))} {2899#true} #71#return; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:38,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:38,391 INFO L272 TraceCheckUtils]: 12: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:38,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-15 10:27:38,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-15 10:27:38,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:38,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2899#true} {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:38,396 INFO L272 TraceCheckUtils]: 17: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:38,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-15 10:27:38,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-15 10:27:38,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:38,397 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2899#true} {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:27:38,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {2936#(and (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,398 INFO L272 TraceCheckUtils]: 24: Hoare triple {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:38,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {2899#true} ~cond := #in~cond; {2983#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:38,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {2983#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:38,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:38,400 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} {2973#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {2994#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:38,405 INFO L272 TraceCheckUtils]: 34: Hoare triple {3007#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (= main_~q~0 (+ (* main_~a~0 main_~p~0) (* main_~y~0 main_~x~0) (* (- 1) main_~a~0 main_~p~0 main_~y~0))) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:38,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3018#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:38,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {3018#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2900#false} is VALID [2022-04-15 10:27:38,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {2900#false} assume !false; {2900#false} is VALID [2022-04-15 10:27:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 10:27:38,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:27:57,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {2900#false} assume !false; {2900#false} is VALID [2022-04-15 10:27:57,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {3018#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2900#false} is VALID [2022-04-15 10:27:57,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3018#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:57,306 INFO L272 TraceCheckUtils]: 34: Hoare triple {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3014#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:57,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:57,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3034#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:57,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-15 10:27:57,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-15 10:27:57,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-15 10:27:57,331 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} {2899#true} #77#return; {3041#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-15 10:27:57,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:57,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {3063#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:27:57,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {2899#true} ~cond := #in~cond; {3063#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:27:57,333 INFO L272 TraceCheckUtils]: 24: Hoare triple {2899#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:57,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {2899#true} assume !false; {2899#true} is VALID [2022-04-15 10:27:57,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {2899#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2899#true} is VALID [2022-04-15 10:27:57,333 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2899#true} {2899#true} #75#return; {2899#true} is VALID [2022-04-15 10:27:57,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:57,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-15 10:27:57,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L272 TraceCheckUtils]: 17: Hoare triple {2899#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2899#true} {2899#true} #73#return; {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L272 TraceCheckUtils]: 12: Hoare triple {2899#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {2899#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2899#true} {2899#true} #71#return; {2899#true} is VALID [2022-04-15 10:27:57,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {2899#true} assume !(0 == ~cond); {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {2899#true} ~cond := #in~cond; {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {2899#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {2899#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {2899#true} call #t~ret6 := main(); {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2899#true} {2899#true} #83#return; {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {2899#true} assume true; {2899#true} is VALID [2022-04-15 10:27:57,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2899#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2899#true} is VALID [2022-04-15 10:27:57,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {2899#true} call ULTIMATE.init(); {2899#true} is VALID [2022-04-15 10:27:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:27:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:27:57,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103026925] [2022-04-15 10:27:57,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:27:57,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210553997] [2022-04-15 10:27:57,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210553997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:27:57,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:27:57,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-15 10:27:57,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:27:57,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404496797] [2022-04-15 10:27:57,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404496797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:27:57,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:27:57,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 10:27:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695095189] [2022-04-15 10:27:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:27:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-15 10:27:57,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:27:57,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:57,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:57,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 10:27:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 10:27:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:27:57,373 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:58,192 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2022-04-15 10:27:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 10:27:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-15 10:27:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:27:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-15 10:27:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-15 10:27:58,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2022-04-15 10:27:58,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:58,265 INFO L225 Difference]: With dead ends: 78 [2022-04-15 10:27:58,265 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 10:27:58,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:27:58,267 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 10:27:58,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 126 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 10:27:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 10:27:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-15 10:27:58,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:27:58,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:58,359 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:58,359 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:58,362 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-15 10:27:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-15 10:27:58,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:58,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:58,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-15 10:27:58,363 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-15 10:27:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:58,365 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2022-04-15 10:27:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-04-15 10:27:58,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:58,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:58,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:27:58,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:27:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:27:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-15 10:27:58,368 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 38 [2022-04-15 10:27:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:27:58,368 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-04-15 10:27:58,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 10:27:58,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-15 10:27:58,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-15 10:27:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 10:27:58,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:27:58,489 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:27:58,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 10:27:58,691 WARN L460 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-15 10:27:58,691 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:27:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:27:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 1 times [2022-04-15 10:27:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:58,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [807851629] [2022-04-15 10:27:58,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:27:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 2 times [2022-04-15 10:27:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:27:58,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450131925] [2022-04-15 10:27:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:27:58,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:27:58,709 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:27:58,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229790797] [2022-04-15 10:27:58,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:27:58,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:27:58,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:27:58,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:27:58,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 10:27:58,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:27:58,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:27:58,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 10:27:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:27:58,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:27:58,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-15 10:27:58,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3559#true} {3559#true} #83#return; {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {3559#true} call #t~ret6 := main(); {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {3559#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {3559#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:58,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3559#true} {3559#true} #71#return; {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {3559#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L272 TraceCheckUtils]: 12: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3559#true} {3559#true} #73#return; {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L272 TraceCheckUtils]: 17: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:58,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:58,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:58,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:58,987 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3559#true} {3559#true} #75#return; {3559#true} is VALID [2022-04-15 10:27:58,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,988 INFO L272 TraceCheckUtils]: 24: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:58,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:58,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:58,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:58,989 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3559#true} {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {3630#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} assume !false; {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 10:27:58,996 INFO L272 TraceCheckUtils]: 34: Hoare triple {3661#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ main_~a~0 1) main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:58,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:58,997 INFO L290 TraceCheckUtils]: 36: Hoare triple {3672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3560#false} is VALID [2022-04-15 10:27:58,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-15 10:27:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:27:58,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:27:59,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-15 10:27:59,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {3672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3560#false} is VALID [2022-04-15 10:27:59,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:27:59,161 INFO L272 TraceCheckUtils]: 34: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:27:59,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,173 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3559#true} {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #77#return; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:59,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:59,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:59,174 INFO L272 TraceCheckUtils]: 24: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:59,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {3559#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3688#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:27:59,175 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3559#true} {3559#true} #75#return; {3559#true} is VALID [2022-04-15 10:27:59,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:59,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:59,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:59,175 INFO L272 TraceCheckUtils]: 17: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3559#true} {3559#true} #73#return; {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L272 TraceCheckUtils]: 12: Hoare triple {3559#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {3559#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3559#true} {3559#true} #71#return; {3559#true} is VALID [2022-04-15 10:27:59,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {3559#true} assume !(0 == ~cond); {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#true} ~cond := #in~cond; {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L272 TraceCheckUtils]: 6: Hoare triple {3559#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {3559#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {3559#true} call #t~ret6 := main(); {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3559#true} {3559#true} #83#return; {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-15 10:27:59,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3559#true} is VALID [2022-04-15 10:27:59,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3559#true} is VALID [2022-04-15 10:27:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 10:27:59,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:27:59,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450131925] [2022-04-15 10:27:59,178 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:27:59,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229790797] [2022-04-15 10:27:59,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229790797] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:27:59,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:27:59,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-15 10:27:59,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:27:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [807851629] [2022-04-15 10:27:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [807851629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:27:59,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:27:59,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:27:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703005104] [2022-04-15 10:27:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:27:59,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-15 10:27:59,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:27:59,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:59,213 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-15 10:27:59,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:27:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:27:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:27:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 10:27:59,214 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:59,502 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-15 10:27:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:27:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-04-15 10:27:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:27:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 10:27:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-15 10:27:59,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-15 10:27:59,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:27:59,603 INFO L225 Difference]: With dead ends: 69 [2022-04-15 10:27:59,603 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 10:27:59,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:27:59,604 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:27:59,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:27:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 10:27:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-04-15 10:27:59,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:27:59,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:59,703 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:59,703 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:59,705 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 10:27:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-15 10:27:59,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:59,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:59,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-15 10:27:59,706 INFO L87 Difference]: Start difference. First operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-15 10:27:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:27:59,707 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 10:27:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-15 10:27:59,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:27:59,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:27:59,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:27:59,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:27:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:27:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-04-15 10:27:59,710 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 38 [2022-04-15 10:27:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:27:59,710 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-04-15 10:27:59,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 10:27:59,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 72 transitions. [2022-04-15 10:28:00,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:28:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-15 10:28:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 10:28:00,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:28:00,366 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:28:00,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 10:28:00,567 WARN L460 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-15 10:28:00,567 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:28:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:28:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 1 times [2022-04-15 10:28:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:28:00,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235735335] [2022-04-15 10:28:00,568 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:28:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash -982526417, now seen corresponding path program 2 times [2022-04-15 10:28:00,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:28:00,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049958854] [2022-04-15 10:28:00,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:28:00,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:28:00,581 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:28:00,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381068285] [2022-04-15 10:28:00,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:28:00,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:28:00,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:28:00,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:28:00,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 10:28:00,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:28:00,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:28:00,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 10:28:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:28:00,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:28:01,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {4181#true} call ULTIMATE.init(); {4181#true} is VALID [2022-04-15 10:28:01,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {4181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4181#true} is VALID [2022-04-15 10:28:01,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:01,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4181#true} {4181#true} #83#return; {4181#true} is VALID [2022-04-15 10:28:01,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {4181#true} call #t~ret6 := main(); {4181#true} is VALID [2022-04-15 10:28:01,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {4181#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4181#true} is VALID [2022-04-15 10:28:01,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {4181#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:01,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {4181#true} ~cond := #in~cond; {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:28:01,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:01,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:01,227 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} {4181#true} #71#return; {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:28:01,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:28:01,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:01,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:01,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:01,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:01,228 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4181#true} {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:28:01,228 INFO L272 TraceCheckUtils]: 17: Hoare triple {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:01,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {4181#true} ~cond := #in~cond; {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:28:01,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {4207#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:01,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:01,230 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} {4218#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {4252#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:01,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {4252#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,230 INFO L272 TraceCheckUtils]: 24: Hoare triple {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:01,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:01,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:01,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:01,231 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4181#true} {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {4256#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !false; {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,233 INFO L272 TraceCheckUtils]: 32: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:01,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:01,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:01,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:01,234 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4181#true} {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} #77#return; {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:28:01,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {4278#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4182#false} is VALID [2022-04-15 10:28:01,234 INFO L272 TraceCheckUtils]: 38: Hoare triple {4182#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4182#false} is VALID [2022-04-15 10:28:01,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {4182#false} ~cond := #in~cond; {4182#false} is VALID [2022-04-15 10:28:01,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {4182#false} assume 0 == ~cond; {4182#false} is VALID [2022-04-15 10:28:01,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {4182#false} assume !false; {4182#false} is VALID [2022-04-15 10:28:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 10:28:01,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:28:02,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {4182#false} assume !false; {4182#false} is VALID [2022-04-15 10:28:02,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {4182#false} assume 0 == ~cond; {4182#false} is VALID [2022-04-15 10:28:02,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {4182#false} ~cond := #in~cond; {4182#false} is VALID [2022-04-15 10:28:02,200 INFO L272 TraceCheckUtils]: 38: Hoare triple {4182#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4182#false} is VALID [2022-04-15 10:28:02,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {4182#false} is VALID [2022-04-15 10:28:02,201 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4181#true} {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 10:28:02,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:02,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:02,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:02,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:02,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 10:28:02,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {4349#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4327#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-15 10:28:02,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {4349#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-15 10:28:02,204 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4181#true} {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 10:28:02,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:02,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:02,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:02,204 INFO L272 TraceCheckUtils]: 24: Hoare triple {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:02,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 10:28:02,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4353#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-15 10:28:02,206 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4181#true} {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #75#return; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 10:28:02,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:02,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:02,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:02,206 INFO L272 TraceCheckUtils]: 17: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:02,207 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4181#true} {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #73#return; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 10:28:02,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:02,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {4181#true} assume !(0 == ~cond); {4181#true} is VALID [2022-04-15 10:28:02,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {4181#true} ~cond := #in~cond; {4181#true} is VALID [2022-04-15 10:28:02,207 INFO L272 TraceCheckUtils]: 12: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:02,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 10:28:02,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} {4181#true} #71#return; {4375#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-15 10:28:02,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {4211#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:02,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {4421#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4211#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:02,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {4181#true} ~cond := #in~cond; {4421#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 10:28:02,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {4181#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {4181#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {4181#true} call #t~ret6 := main(); {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4181#true} {4181#true} #83#return; {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {4181#true} assume true; {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {4181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {4181#true} call ULTIMATE.init(); {4181#true} is VALID [2022-04-15 10:28:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 10:28:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:28:02,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049958854] [2022-04-15 10:28:02,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:28:02,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381068285] [2022-04-15 10:28:02,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381068285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:28:02,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:28:02,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-04-15 10:28:02,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:28:02,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235735335] [2022-04-15 10:28:02,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235735335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:28:02,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:28:02,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:28:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8731597] [2022-04-15 10:28:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:28:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-04-15 10:28:02,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:28:02,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:28:02,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:28:02,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:28:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:28:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:28:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:28:02,244 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:28:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:28:02,632 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2022-04-15 10:28:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:28:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2022-04-15 10:28:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:28:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:28:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 10:28:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:28:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 10:28:02,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-15 10:28:02,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:28:02,679 INFO L225 Difference]: With dead ends: 74 [2022-04-15 10:28:02,679 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 10:28:02,679 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 10:28:02,680 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 10:28:02,680 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 10:28:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 10:28:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-15 10:28:02,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:28:02,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:28:02,792 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:28:02,793 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:28:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:28:02,795 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-15 10:28:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-15 10:28:02,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:28:02,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:28:02,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 69 states. [2022-04-15 10:28:02,796 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 69 states. [2022-04-15 10:28:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:28:02,798 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-15 10:28:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-15 10:28:02,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:28:02,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:28:02,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:28:02,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:28:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:28:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-15 10:28:02,800 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 42 [2022-04-15 10:28:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:28:02,801 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-15 10:28:02,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:28:02,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-15 10:28:03,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:28:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-15 10:28:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 10:28:03,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:28:03,431 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:28:03,447 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-15 10:28:03,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 10:28:03,632 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:28:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:28:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 1 times [2022-04-15 10:28:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:28:03,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479767058] [2022-04-15 10:28:03,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:28:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1669465851, now seen corresponding path program 2 times [2022-04-15 10:28:03,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:28:03,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804001571] [2022-04-15 10:28:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:28:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:28:03,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:28:03,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481413850] [2022-04-15 10:28:03,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:28:03,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:28:03,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:28:03,659 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:28:03,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 10:28:03,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:28:03,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:28:03,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 10:28:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:28:03,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:28:13,943 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 10:28:14,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {4871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #83#return; {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret6 := main(); {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {4871#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {4871#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:14,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4871#true} {4871#true} #71#return; {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L272 TraceCheckUtils]: 12: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4871#true} {4871#true} #73#return; {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L272 TraceCheckUtils]: 17: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:14,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#true} ~cond := #in~cond; {4930#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:28:14,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {4930#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4934#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:14,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {4934#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4934#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:28:14,394 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4934#(not (= |assume_abort_if_not_#in~cond| 0))} {4871#true} #75#return; {4941#(<= 1 main_~y~0)} is VALID [2022-04-15 10:28:14,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {4941#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,395 INFO L272 TraceCheckUtils]: 24: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:14,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:14,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:14,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:14,396 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4871#true} {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,398 INFO L290 TraceCheckUtils]: 32: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:14,398 INFO L272 TraceCheckUtils]: 33: Hoare triple {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:14,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {4871#true} ~cond := #in~cond; {4982#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:28:14,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {4982#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:28:14,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:28:16,401 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} {4945#(and (<= 1 main_~p~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {4993#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 10:28:16,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {4993#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4997#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:28:16,403 INFO L272 TraceCheckUtils]: 39: Hoare triple {4997#(and (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:28:16,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:28:16,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {5005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4872#false} is VALID [2022-04-15 10:28:16,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2022-04-15 10:28:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 10:28:16,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:28:57,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {4872#false} assume !false; {4872#false} is VALID [2022-04-15 10:28:57,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {5005#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4872#false} is VALID [2022-04-15 10:28:57,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5005#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:28:57,387 INFO L272 TraceCheckUtils]: 39: Hoare triple {5021#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5001#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:28:57,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {5025#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5021#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:28:57,390 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} {4871#true} #77#return; {5025#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:28:57,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:28:57,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {5038#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4986#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:28:57,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {4871#true} ~cond := #in~cond; {5038#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:28:57,391 INFO L272 TraceCheckUtils]: 33: Hoare triple {4871#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:57,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {4871#true} assume !false; {4871#true} is VALID [2022-04-15 10:28:57,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {4871#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {4871#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {4871#true} assume !!(0 != ~a~0 && 0 != ~b~0); {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4871#true} {4871#true} #77#return; {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L272 TraceCheckUtils]: 24: Hoare triple {4871#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {4871#true} assume !false; {4871#true} is VALID [2022-04-15 10:28:57,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {4871#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4871#true} {4871#true} #75#return; {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L272 TraceCheckUtils]: 17: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4871#true} {4871#true} #73#return; {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:57,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L272 TraceCheckUtils]: 12: Hoare triple {4871#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {4871#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4871#true} {4871#true} #71#return; {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {4871#true} assume !(0 == ~cond); {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {4871#true} ~cond := #in~cond; {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {4871#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {4871#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {4871#true} call #t~ret6 := main(); {4871#true} is VALID [2022-04-15 10:28:57,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4871#true} {4871#true} #83#return; {4871#true} is VALID [2022-04-15 10:28:57,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {4871#true} assume true; {4871#true} is VALID [2022-04-15 10:28:57,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {4871#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4871#true} is VALID [2022-04-15 10:28:57,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {4871#true} call ULTIMATE.init(); {4871#true} is VALID [2022-04-15 10:28:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 10:28:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:28:57,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804001571] [2022-04-15 10:28:57,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:28:57,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481413850] [2022-04-15 10:28:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481413850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:28:57,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:28:57,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-15 10:28:57,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:28:57,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479767058] [2022-04-15 10:28:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479767058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:28:57,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:28:57,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 10:28:57,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146929078] [2022-04-15 10:28:57,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:28:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-15 10:28:57,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:28:57,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:28:59,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:28:59,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 10:28:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:28:59,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 10:28:59,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:28:59,434 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:29:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:29:03,366 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-15 10:29:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 10:29:03,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-15 10:29:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:29:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:29:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-15 10:29:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:29:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-15 10:29:03,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-15 10:29:05,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:29:05,420 INFO L225 Difference]: With dead ends: 78 [2022-04-15 10:29:05,420 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 10:29:05,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-04-15 10:29:05,421 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 10:29:05,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 10:29:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 10:29:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2022-04-15 10:29:05,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:29:05,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:29:05,564 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:29:05,564 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:29:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:29:05,567 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-15 10:29:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-15 10:29:05,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:29:05,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:29:05,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 73 states. [2022-04-15 10:29:05,568 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 73 states. [2022-04-15 10:29:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:29:05,570 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-15 10:29:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-15 10:29:05,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:29:05,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:29:05,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:29:05,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:29:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:29:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2022-04-15 10:29:05,576 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 43 [2022-04-15 10:29:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:29:05,576 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2022-04-15 10:29:05,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:29:05,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 92 transitions. [2022-04-15 10:29:08,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 91 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:29:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2022-04-15 10:29:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 10:29:08,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:29:08,222 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:29:08,239 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-15 10:29:08,427 WARN L460 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-15 10:29:08,427 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:29:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:29:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 1 times [2022-04-15 10:29:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:29:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1369477273] [2022-04-15 10:29:08,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:29:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1372706166, now seen corresponding path program 2 times [2022-04-15 10:29:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:29:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820921629] [2022-04-15 10:29:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:29:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:29:08,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:29:08,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901234595] [2022-04-15 10:29:08,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:29:08,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:29:08,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:29:08,443 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:29:08,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 10:29:08,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:29:08,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:29:08,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 10:29:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:29:08,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:29:18,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret6 := main(); {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {5599#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:29:18,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5599#true} {5599#true} #71#return; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {5599#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L272 TraceCheckUtils]: 12: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5599#true} {5599#true} #73#return; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L272 TraceCheckUtils]: 17: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5599#true} {5599#true} #75#return; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {5599#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {5599#true} assume !false; {5599#true} is VALID [2022-04-15 10:29:18,698 INFO L272 TraceCheckUtils]: 24: Hoare triple {5599#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:29:18,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:29:18,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:29:18,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:29:18,699 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5599#true} {5599#true} #77#return; {5599#true} is VALID [2022-04-15 10:29:18,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {5599#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5691#(not (= main_~a~0 0))} is VALID [2022-04-15 10:29:18,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {5691#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5691#(not (= main_~a~0 0))} is VALID [2022-04-15 10:29:18,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {5691#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5691#(not (= main_~a~0 0))} is VALID [2022-04-15 10:29:18,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {5691#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5691#(not (= main_~a~0 0))} is VALID [2022-04-15 10:29:18,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {5691#(not (= main_~a~0 0))} assume !false; {5691#(not (= main_~a~0 0))} is VALID [2022-04-15 10:29:18,700 INFO L272 TraceCheckUtils]: 34: Hoare triple {5691#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:29:18,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {5599#true} ~cond := #in~cond; {5710#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:29:18,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {5710#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:29:18,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:29:20,704 WARN L284 TraceCheckUtils]: 38: Hoare quadruple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} {5691#(not (= main_~a~0 0))} #77#return; {5721#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-15 10:29:20,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {5721#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:29:20,705 INFO L272 TraceCheckUtils]: 40: Hoare triple {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:29:20,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:29:20,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {5733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5600#false} is VALID [2022-04-15 10:29:20,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 10:29:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 10:29:20,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:30:11,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {5600#false} assume !false; {5600#false} is VALID [2022-04-15 10:30:11,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {5733#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5600#false} is VALID [2022-04-15 10:30:11,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5733#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:30:11,367 INFO L272 TraceCheckUtils]: 40: Hoare triple {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5729#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:30:11,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {5752#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5725#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:30:11,370 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} {5599#true} #77#return; {5752#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:30:11,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:30:11,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {5765#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5714#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:30:11,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {5599#true} ~cond := #in~cond; {5765#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:30:11,371 INFO L272 TraceCheckUtils]: 34: Hoare triple {5599#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:30:11,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {5599#true} assume !false; {5599#true} is VALID [2022-04-15 10:30:11,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {5599#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5599#true} is VALID [2022-04-15 10:30:11,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {5599#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5599#true} is VALID [2022-04-15 10:30:11,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {5599#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5599#true} is VALID [2022-04-15 10:30:11,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {5599#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5599#true} {5599#true} #77#return; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L272 TraceCheckUtils]: 24: Hoare triple {5599#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {5599#true} assume !false; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {5599#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5599#true} {5599#true} #75#return; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:30:11,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L272 TraceCheckUtils]: 17: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5599#true} {5599#true} #73#return; {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {5599#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:30:11,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {5599#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5599#true} {5599#true} #71#return; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {5599#true} assume !(0 == ~cond); {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {5599#true} ~cond := #in~cond; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {5599#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {5599#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {5599#true} call #t~ret6 := main(); {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5599#true} {5599#true} #83#return; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {5599#true} assume true; {5599#true} is VALID [2022-04-15 10:30:11,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {5599#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5599#true} is VALID [2022-04-15 10:30:11,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {5599#true} call ULTIMATE.init(); {5599#true} is VALID [2022-04-15 10:30:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 10:30:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:30:11,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820921629] [2022-04-15 10:30:11,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:30:11,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901234595] [2022-04-15 10:30:11,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901234595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:30:11,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:30:11,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-15 10:30:11,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:30:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1369477273] [2022-04-15 10:30:11,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1369477273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:30:11,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:30:11,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:30:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511145058] [2022-04-15 10:30:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:30:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-15 10:30:11,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:30:11,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:30:13,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:30:13,408 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:30:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:30:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:30:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:30:13,408 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:30:16,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:30:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:30:17,155 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2022-04-15 10:30:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 10:30:17,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-15 10:30:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:30:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:30:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 10:30:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:30:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 10:30:17,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-15 10:30:19,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:30:19,202 INFO L225 Difference]: With dead ends: 85 [2022-04-15 10:30:19,202 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 10:30:19,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:30:19,203 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 10:30:19,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 144 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 10:30:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 10:30:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-04-15 10:30:19,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:30:19,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:30:19,350 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:30:19,350 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:30:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:30:19,352 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-15 10:30:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-15 10:30:19,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:30:19,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:30:19,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-15 10:30:19,353 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-15 10:30:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:30:19,355 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-15 10:30:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-15 10:30:19,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:30:19,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:30:19,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:30:19,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:30:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:30:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-04-15 10:30:19,357 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 44 [2022-04-15 10:30:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:30:19,358 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-04-15 10:30:19,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:30:19,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 82 transitions. [2022-04-15 10:30:23,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 80 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 10:30:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-15 10:30:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 10:30:23,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:30:23,896 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:30:23,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 10:30:24,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 10:30:24,096 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:30:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:30:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 1 times [2022-04-15 10:30:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:30:24,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [853198177] [2022-04-15 10:30:24,097 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:30:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1114540728, now seen corresponding path program 2 times [2022-04-15 10:30:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:30:24,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028980518] [2022-04-15 10:30:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:30:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:30:24,108 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:30:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578082460] [2022-04-15 10:30:24,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:30:24,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:30:24,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:30:24,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:30:24,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 10:30:24,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:30:24,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:30:24,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 10:30:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:30:24,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:30:35,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6343#true} {6343#true} #83#return; {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {6343#true} call #t~ret6 := main(); {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {6343#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {6343#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:30:35,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {6343#true} ~cond := #in~cond; {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:30:35,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:30:35,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:30:35,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} {6343#true} #71#return; {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:30:35,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:30:35,089 INFO L272 TraceCheckUtils]: 12: Hoare triple {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:30:35,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-15 10:30:35,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-15 10:30:35,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:30:35,090 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6343#true} {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:30:35,090 INFO L272 TraceCheckUtils]: 17: Hoare triple {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:30:35,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {6343#true} ~cond := #in~cond; {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:30:35,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {6369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:30:35,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:30:35,092 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6373#(not (= |assume_abort_if_not_#in~cond| 0))} {6380#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {6414#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {6414#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,093 INFO L272 TraceCheckUtils]: 24: Hoare triple {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:30:35,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-15 10:30:35,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-15 10:30:35,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:30:35,094 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6343#true} {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {6418#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:35,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {6440#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-15 10:30:35,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} assume !false; {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} is VALID [2022-04-15 10:30:35,098 INFO L272 TraceCheckUtils]: 34: Hoare triple {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:30:35,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {6343#true} ~cond := #in~cond; {6460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:30:35,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {6460#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:30:35,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:30:37,102 WARN L284 TraceCheckUtils]: 38: Hoare quadruple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} {6450#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)))} #77#return; {6471#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-15 10:30:37,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {6471#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 (+ main_~a~0 1)) (<= 1 main_~y~0) (<= main_~y~0 (+ main_~b~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {6475#(and (or (and (<= main_~x~0 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 1))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:30:37,104 INFO L272 TraceCheckUtils]: 40: Hoare triple {6475#(and (or (and (<= main_~x~0 1) (= main_~q~0 (* main_~y~0 main_~x~0))) (and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 1))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:30:37,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:30:37,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {6483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6344#false} is VALID [2022-04-15 10:30:37,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-15 10:30:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 10:30:37,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:31:16,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {6344#false} assume !false; {6344#false} is VALID [2022-04-15 10:31:16,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {6483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6344#false} is VALID [2022-04-15 10:31:16,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:31:16,744 INFO L272 TraceCheckUtils]: 40: Hoare triple {6499#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:31:16,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6499#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:31:16,747 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} {6343#true} #77#return; {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:31:16,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:31:16,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {6516#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6464#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {6343#true} ~cond := #in~cond; {6516#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:31:16,748 INFO L272 TraceCheckUtils]: 34: Hoare triple {6343#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 33: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 32: Hoare triple {6343#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 31: Hoare triple {6343#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {6343#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {6343#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6343#true} {6343#true} #77#return; {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L272 TraceCheckUtils]: 24: Hoare triple {6343#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {6343#true} assume !false; {6343#true} is VALID [2022-04-15 10:31:16,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {6343#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6343#true} {6343#true} #75#return; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L272 TraceCheckUtils]: 17: Hoare triple {6343#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6343#true} {6343#true} #73#return; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L272 TraceCheckUtils]: 12: Hoare triple {6343#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {6343#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6343#true} {6343#true} #71#return; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:31:16,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {6343#true} assume !(0 == ~cond); {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {6343#true} ~cond := #in~cond; {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {6343#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {6343#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {6343#true} call #t~ret6 := main(); {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6343#true} {6343#true} #83#return; {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {6343#true} assume true; {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {6343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {6343#true} call ULTIMATE.init(); {6343#true} is VALID [2022-04-15 10:31:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 10:31:16,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:31:16,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028980518] [2022-04-15 10:31:16,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:31:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578082460] [2022-04-15 10:31:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578082460] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:31:16,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:31:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-15 10:31:16,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:31:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [853198177] [2022-04-15 10:31:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [853198177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:31:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:31:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 10:31:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345548166] [2022-04-15 10:31:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:31:16,752 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-04-15 10:31:16,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:31:16,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:31:18,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:31:18,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 10:31:18,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:31:18,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 10:31:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:31:18,784 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:31:21,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:31:25,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:31:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:31:26,433 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-04-15 10:31:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 10:31:26,434 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-04-15 10:31:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:31:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:31:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-15 10:31:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:31:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 59 transitions. [2022-04-15 10:31:26,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 59 transitions. [2022-04-15 10:31:28,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:31:28,494 INFO L225 Difference]: With dead ends: 78 [2022-04-15 10:31:28,494 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 10:31:28,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2022-04-15 10:31:28,495 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 10:31:28,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 10:31:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 10:31:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-15 10:31:28,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:31:28,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:31:28,641 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:31:28,641 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:31:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:31:28,643 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 10:31:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-15 10:31:28,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:31:28,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:31:28,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-15 10:31:28,644 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-15 10:31:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:31:28,645 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 10:31:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-15 10:31:28,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:31:28,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:31:28,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:31:28,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:31:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 10:31:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-04-15 10:31:28,647 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 44 [2022-04-15 10:31:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:31:28,648 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-04-15 10:31:28,648 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 10:31:28,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 82 transitions. [2022-04-15 10:31:33,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 80 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 10:31:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-04-15 10:31:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 10:31:33,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:31:33,088 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:31:33,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 10:31:33,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 10:31:33,291 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:31:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:31:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1275543934, now seen corresponding path program 1 times [2022-04-15 10:31:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:31:33,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1016589683] [2022-04-15 10:31:33,292 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:31:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1275543934, now seen corresponding path program 2 times [2022-04-15 10:31:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:31:33,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368729681] [2022-04-15 10:31:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:31:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:31:33,303 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:31:33,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990364399] [2022-04-15 10:31:33,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:31:33,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:31:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:31:33,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:31:33,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 10:31:33,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:31:33,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:31:33,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 10:31:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:31:33,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:31:43,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {7072#true} call ULTIMATE.init(); {7072#true} is VALID [2022-04-15 10:31:43,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {7072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7072#true} is VALID [2022-04-15 10:31:43,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:31:43,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7072#true} {7072#true} #83#return; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {7072#true} call #t~ret6 := main(); {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {7072#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L272 TraceCheckUtils]: 6: Hoare triple {7072#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7072#true} {7072#true} #71#return; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {7072#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L272 TraceCheckUtils]: 12: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7072#true} {7072#true} #73#return; {7072#true} is VALID [2022-04-15 10:31:43,551 INFO L272 TraceCheckUtils]: 17: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7072#true} {7072#true} #75#return; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {7072#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L272 TraceCheckUtils]: 24: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:31:43,552 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {7072#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L272 TraceCheckUtils]: 32: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:31:43,553 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-15 10:31:43,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7188#(not (= main_~b~0 0))} is VALID [2022-04-15 10:31:43,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {7188#(not (= main_~b~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7188#(not (= main_~b~0 0))} is VALID [2022-04-15 10:31:43,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {7188#(not (= main_~b~0 0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {7188#(not (= main_~b~0 0))} is VALID [2022-04-15 10:31:43,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {7188#(not (= main_~b~0 0))} assume !false; {7188#(not (= main_~b~0 0))} is VALID [2022-04-15 10:31:43,555 INFO L272 TraceCheckUtils]: 41: Hoare triple {7188#(not (= main_~b~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:31:43,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {7072#true} ~cond := #in~cond; {7204#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:31:43,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {7204#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:31:43,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:31:45,559 WARN L284 TraceCheckUtils]: 45: Hoare quadruple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} {7188#(not (= main_~b~0 0))} #77#return; {7215#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} is UNKNOWN [2022-04-15 10:31:45,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {7215#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~b~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:31:45,560 INFO L272 TraceCheckUtils]: 47: Hoare triple {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:31:45,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:31:45,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {7227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7073#false} is VALID [2022-04-15 10:31:45,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {7073#false} assume !false; {7073#false} is VALID [2022-04-15 10:31:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 10:31:45,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:32:28,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {7073#false} assume !false; {7073#false} is VALID [2022-04-15 10:32:28,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {7227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7073#false} is VALID [2022-04-15 10:32:28,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:32:28,483 INFO L272 TraceCheckUtils]: 47: Hoare triple {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:32:28,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {7246#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {7219#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:32:28,485 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} {7072#true} #77#return; {7246#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:32:28,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:32:28,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {7259#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7208#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:32:28,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {7072#true} ~cond := #in~cond; {7259#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:32:28,486 INFO L272 TraceCheckUtils]: 41: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:32:28,486 INFO L290 TraceCheckUtils]: 40: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-15 10:32:28,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {7072#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {7072#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L272 TraceCheckUtils]: 32: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {7072#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {7072#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7072#true} {7072#true} #77#return; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:32:28,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L272 TraceCheckUtils]: 24: Hoare triple {7072#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {7072#true} assume !false; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {7072#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7072#true} {7072#true} #75#return; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L272 TraceCheckUtils]: 17: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7072#true} {7072#true} #73#return; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L272 TraceCheckUtils]: 12: Hoare triple {7072#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {7072#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7072#true} is VALID [2022-04-15 10:32:28,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7072#true} {7072#true} #71#return; {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {7072#true} assume !(0 == ~cond); {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {7072#true} ~cond := #in~cond; {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {7072#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {7072#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {7072#true} call #t~ret6 := main(); {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7072#true} {7072#true} #83#return; {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {7072#true} assume true; {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {7072#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {7072#true} call ULTIMATE.init(); {7072#true} is VALID [2022-04-15 10:32:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 10:32:28,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:32:28,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368729681] [2022-04-15 10:32:28,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:32:28,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990364399] [2022-04-15 10:32:28,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990364399] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:32:28,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:32:28,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-15 10:32:28,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:32:28,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1016589683] [2022-04-15 10:32:28,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1016589683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:32:28,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:32:28,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:32:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359964911] [2022-04-15 10:32:28,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:32:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-04-15 10:32:28,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:32:28,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:32:30,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:32:30,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:32:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:32:30,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:32:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:32:30,524 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:32:33,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:32:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:32:36,385 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2022-04-15 10:32:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 10:32:36,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-04-15 10:32:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:32:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:32:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 10:32:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:32:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-15 10:32:36,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-15 10:32:38,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:32:38,446 INFO L225 Difference]: With dead ends: 81 [2022-04-15 10:32:38,447 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 10:32:38,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 10:32:38,447 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:32:38,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 158 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 10:32:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 10:32:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-04-15 10:32:38,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:32:38,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:32:38,609 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:32:38,609 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:32:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:32:38,611 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-15 10:32:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-15 10:32:38,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:32:38,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:32:38,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 76 states. [2022-04-15 10:32:38,611 INFO L87 Difference]: Start difference. First operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 76 states. [2022-04-15 10:32:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:32:38,613 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-15 10:32:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-15 10:32:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:32:38,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:32:38,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:32:38,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:32:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 10:32:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-04-15 10:32:38,616 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 51 [2022-04-15 10:32:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:32:38,616 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-04-15 10:32:38,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 10:32:38,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 74 transitions. [2022-04-15 10:32:41,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:32:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-04-15 10:32:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 10:32:41,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:32:41,043 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:32:41,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 10:32:41,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 10:32:41,243 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:32:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:32:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 1 times [2022-04-15 10:32:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:32:41,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802307672] [2022-04-15 10:32:41,244 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:32:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2079436449, now seen corresponding path program 2 times [2022-04-15 10:32:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:32:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316190313] [2022-04-15 10:32:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:32:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:32:41,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:32:41,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378780028] [2022-04-15 10:32:41,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:32:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:32:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:32:41,257 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:32:41,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 10:32:41,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:32:41,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:32:41,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 10:32:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:32:41,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:32:52,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {7832#true} call ULTIMATE.init(); {7832#true} is VALID [2022-04-15 10:32:52,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {7832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7832#true} is VALID [2022-04-15 10:32:52,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:32:52,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7832#true} {7832#true} #83#return; {7832#true} is VALID [2022-04-15 10:32:52,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {7832#true} call #t~ret6 := main(); {7832#true} is VALID [2022-04-15 10:32:52,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {7832#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7832#true} is VALID [2022-04-15 10:32:52,702 INFO L272 TraceCheckUtils]: 6: Hoare triple {7832#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:32:52,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {7832#true} ~cond := #in~cond; {7858#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:32:52,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {7858#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7862#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:32:52,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {7862#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7862#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:32:52,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7862#(not (= |assume_abort_if_not_#in~cond| 0))} {7832#true} #71#return; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:32:52,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:32:52,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7832#true} {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:32:52,704 INFO L272 TraceCheckUtils]: 17: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:32:52,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:32:52,705 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7832#true} {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:32:52,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {7869#(and (<= main_~x~0 10) (<= 0 main_~x~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 10:32:52,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} assume !false; {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 10:32:52,706 INFO L272 TraceCheckUtils]: 24: Hoare triple {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:32:52,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:32:52,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:32:52,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:32:52,706 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7832#true} {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} #77#return; {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} is VALID [2022-04-15 10:32:52,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {7906#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7928#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} is VALID [2022-04-15 10:32:52,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {7928#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-15 10:32:52,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !false; {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-15 10:32:52,708 INFO L272 TraceCheckUtils]: 32: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:32:52,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:32:52,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:32:52,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:32:52,709 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7832#true} {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} #77#return; {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-15 10:32:52,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-15 10:32:52,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-15 10:32:52,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} is VALID [2022-04-15 10:32:52,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {7932#(and (<= (div (- main_~x~0) (- 2)) main_~a~0) (<= main_~x~0 10) (<= 0 main_~x~0) (< 0 main_~a~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 10:32:52,712 INFO L290 TraceCheckUtils]: 41: Hoare triple {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !false; {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 10:32:52,712 INFO L272 TraceCheckUtils]: 42: Hoare triple {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:32:52,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {7832#true} ~cond := #in~cond; {7973#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:32:52,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {7973#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:32:52,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:32:54,715 WARN L284 TraceCheckUtils]: 46: Hoare quadruple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} {7963#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} #77#return; {7984#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-15 10:32:54,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {7984#(and (< 0 (+ main_~a~0 1)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {7988#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))} is VALID [2022-04-15 10:32:54,717 INFO L272 TraceCheckUtils]: 48: Hoare triple {7988#(and (<= main_~x~0 10) (<= 0 main_~x~0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:32:54,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:32:54,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {7996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7833#false} is VALID [2022-04-15 10:32:54,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {7833#false} assume !false; {7833#false} is VALID [2022-04-15 10:32:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:32:54,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:33:38,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {7833#false} assume !false; {7833#false} is VALID [2022-04-15 10:33:38,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {7996#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7833#false} is VALID [2022-04-15 10:33:38,413 INFO L290 TraceCheckUtils]: 49: Hoare triple {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7996#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:33:38,414 INFO L272 TraceCheckUtils]: 48: Hoare triple {8012#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7992#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:33:38,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {8016#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {8012#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:33:38,416 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} {7832#true} #77#return; {8016#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:33:38,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {8029#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7977#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {7832#true} ~cond := #in~cond; {8029#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:33:38,417 INFO L272 TraceCheckUtils]: 42: Hoare triple {7832#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {7832#true} assume !false; {7832#true} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {7832#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {7832#true} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {7832#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7832#true} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {7832#true} is VALID [2022-04-15 10:33:38,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {7832#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7832#true} {7832#true} #77#return; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L272 TraceCheckUtils]: 32: Hoare triple {7832#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {7832#true} assume !false; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {7832#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {7832#true} assume !!(0 != ~a~0 && 0 != ~b~0); {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7832#true} {7832#true} #77#return; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L272 TraceCheckUtils]: 24: Hoare triple {7832#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:33:38,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {7832#true} assume !false; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {7832#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7832#true} {7832#true} #75#return; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L272 TraceCheckUtils]: 17: Hoare triple {7832#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7832#true} {7832#true} #73#return; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {7832#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:33:38,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {7832#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7832#true} {7832#true} #71#return; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {7832#true} assume !(0 == ~cond); {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {7832#true} ~cond := #in~cond; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {7832#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {7832#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {7832#true} call #t~ret6 := main(); {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7832#true} {7832#true} #83#return; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {7832#true} assume true; {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {7832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {7832#true} call ULTIMATE.init(); {7832#true} is VALID [2022-04-15 10:33:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 10:33:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:33:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316190313] [2022-04-15 10:33:38,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:33:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378780028] [2022-04-15 10:33:38,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378780028] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:33:38,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:33:38,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 18 [2022-04-15 10:33:38,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:33:38,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802307672] [2022-04-15 10:33:38,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802307672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:33:38,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:33:38,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 10:33:38,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634829929] [2022-04-15 10:33:38,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:33:38,422 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-04-15 10:33:38,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:33:38,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 10:33:40,460 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-15 10:33:40,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 10:33:40,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:33:40,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 10:33:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-04-15 10:33:40,460 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 10:33:43,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:33:47,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:33:50,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:33:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:33:50,773 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2022-04-15 10:33:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 10:33:50,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 52 [2022-04-15 10:33:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:33:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 10:33:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2022-04-15 10:33:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 10:33:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 73 transitions. [2022-04-15 10:33:50,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 73 transitions. [2022-04-15 10:33:56,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 70 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 10:33:56,855 INFO L225 Difference]: With dead ends: 88 [2022-04-15 10:33:56,855 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 10:33:56,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-04-15 10:33:56,856 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-15 10:33:56,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 152 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-04-15 10:33:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 10:33:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-15 10:33:57,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:33:57,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:33:57,109 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:33:57,110 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:33:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:33:57,111 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-04-15 10:33:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2022-04-15 10:33:57,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:33:57,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:33:57,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 83 states. [2022-04-15 10:33:57,112 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 83 states. [2022-04-15 10:33:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:33:57,114 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-04-15 10:33:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2022-04-15 10:33:57,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:33:57,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:33:57,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:33:57,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:33:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:33:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-04-15 10:33:57,117 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 52 [2022-04-15 10:33:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:33:57,117 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-04-15 10:33:57,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-15 10:33:57,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 94 transitions. [2022-04-15 10:34:04,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 91 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-15 10:34:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 10:34:04,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:34:04,061 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:34:04,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 10:34:04,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 10:34:04,271 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:34:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:34:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 1 times [2022-04-15 10:34:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [914350707] [2022-04-15 10:34:04,272 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:34:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1287237523, now seen corresponding path program 2 times [2022-04-15 10:34:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:34:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959661287] [2022-04-15 10:34:04,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:34:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:34:04,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:34:04,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210359084] [2022-04-15 10:34:04,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:34:04,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:34:04,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:34:04,292 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:34:04,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 10:34:04,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:34:04,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:34:04,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 10:34:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:34:04,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:34:05,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {8665#true} call ULTIMATE.init(); {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {8665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8665#true} {8665#true} #83#return; {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {8665#true} call #t~ret6 := main(); {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {8665#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {8665#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:05,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8665#true} {8665#true} #71#return; {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {8665#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L272 TraceCheckUtils]: 12: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8665#true} {8665#true} #73#return; {8665#true} is VALID [2022-04-15 10:34:05,394 INFO L272 TraceCheckUtils]: 17: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:05,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {8665#true} ~cond := #in~cond; {8724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:34:05,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {8724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:05,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:05,396 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} {8665#true} #75#return; {8735#(<= 1 main_~y~0)} is VALID [2022-04-15 10:34:05,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {8735#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8739#(<= 1 main_~b~0)} is VALID [2022-04-15 10:34:05,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {8739#(<= 1 main_~b~0)} assume !false; {8739#(<= 1 main_~b~0)} is VALID [2022-04-15 10:34:05,397 INFO L272 TraceCheckUtils]: 24: Hoare triple {8739#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:05,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:05,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:05,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:05,398 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8665#true} {8739#(<= 1 main_~b~0)} #77#return; {8739#(<= 1 main_~b~0)} is VALID [2022-04-15 10:34:05,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {8739#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {8761#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !false; {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,401 INFO L272 TraceCheckUtils]: 33: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:05,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:05,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:05,401 INFO L290 TraceCheckUtils]: 36: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:05,402 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8665#true} {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} #77#return; {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {8768#(and (<= (mod main_~b~0 2) 0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8793#(and (<= (mod main_~b~0 2) 0) (not (= (mod main_~a~0 2) 0)) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:05,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {8793#(and (<= (mod main_~b~0 2) 0) (not (= (mod main_~a~0 2) 0)) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8666#false} is VALID [2022-04-15 10:34:05,404 INFO L290 TraceCheckUtils]: 41: Hoare triple {8666#false} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8666#false} is VALID [2022-04-15 10:34:05,404 INFO L290 TraceCheckUtils]: 42: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-15 10:34:05,404 INFO L272 TraceCheckUtils]: 43: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {8666#false} ~cond := #in~cond; {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {8666#false} assume !(0 == ~cond); {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {8666#false} assume true; {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8666#false} {8666#false} #77#return; {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {8666#false} assume !(0 != ~a~0 && 0 != ~b~0); {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L272 TraceCheckUtils]: 49: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {8666#false} ~cond := #in~cond; {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {8666#false} assume 0 == ~cond; {8666#false} is VALID [2022-04-15 10:34:05,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-15 10:34:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:34:05,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:34:06,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-15 10:34:06,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {8666#false} assume 0 == ~cond; {8666#false} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {8666#false} ~cond := #in~cond; {8666#false} is VALID [2022-04-15 10:34:06,382 INFO L272 TraceCheckUtils]: 49: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8666#false} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {8666#false} assume !(0 != ~a~0 && 0 != ~b~0); {8666#false} is VALID [2022-04-15 10:34:06,382 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8665#true} {8666#false} #77#return; {8666#false} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 46: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:06,382 INFO L272 TraceCheckUtils]: 43: Hoare triple {8666#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 42: Hoare triple {8666#false} assume !false; {8666#false} is VALID [2022-04-15 10:34:06,382 INFO L290 TraceCheckUtils]: 41: Hoare triple {8666#false} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8666#false} is VALID [2022-04-15 10:34:06,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {8869#(and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8666#false} is VALID [2022-04-15 10:34:06,384 INFO L290 TraceCheckUtils]: 39: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8869#(and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0))} is VALID [2022-04-15 10:34:06,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:06,385 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8665#true} {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} #77#return; {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:06,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:06,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:06,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:06,386 INFO L272 TraceCheckUtils]: 33: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:06,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !false; {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:06,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {8873#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:06,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} is VALID [2022-04-15 10:34:06,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {8898#(or (= (mod main_~b~0 2) 0) (< main_~a~0 0) (<= 0 main_~b~0) (not (<= 1 (mod main_~a~0 2))))} is VALID [2022-04-15 10:34:06,389 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8665#true} {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} #77#return; {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:06,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:06,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:06,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:06,390 INFO L272 TraceCheckUtils]: 24: Hoare triple {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:06,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} assume !false; {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:06,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {8927#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8905#(or (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:06,392 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} {8665#true} #75#return; {8927#(<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1))} is VALID [2022-04-15 10:34:06,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {8728#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:06,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {8940#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {8728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:06,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {8665#true} ~cond := #in~cond; {8940#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 10:34:06,393 INFO L272 TraceCheckUtils]: 17: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:06,393 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8665#true} {8665#true} #73#return; {8665#true} is VALID [2022-04-15 10:34:06,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:06,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:06,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L272 TraceCheckUtils]: 12: Hoare triple {8665#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {8665#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8665#true} {8665#true} #71#return; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {8665#true} assume !(0 == ~cond); {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {8665#true} ~cond := #in~cond; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {8665#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {8665#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {8665#true} call #t~ret6 := main(); {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8665#true} {8665#true} #83#return; {8665#true} is VALID [2022-04-15 10:34:06,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {8665#true} assume true; {8665#true} is VALID [2022-04-15 10:34:06,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {8665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8665#true} is VALID [2022-04-15 10:34:06,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {8665#true} call ULTIMATE.init(); {8665#true} is VALID [2022-04-15 10:34:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 10:34:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:34:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959661287] [2022-04-15 10:34:06,395 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:34:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210359084] [2022-04-15 10:34:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210359084] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:34:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:34:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2022-04-15 10:34:06,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:34:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [914350707] [2022-04-15 10:34:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [914350707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:34:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:34:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 10:34:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638356517] [2022-04-15 10:34:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:34:06,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-04-15 10:34:06,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:34:06,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:06,434 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-15 10:34:06,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 10:34:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:06,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 10:34:06,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-15 10:34:06,435 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:07,261 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2022-04-15 10:34:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 10:34:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2022-04-15 10:34:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:34:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 10:34:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-15 10:34:07,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-15 10:34:07,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:07,339 INFO L225 Difference]: With dead ends: 108 [2022-04-15 10:34:07,339 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 10:34:07,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-04-15 10:34:07,340 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:34:07,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 10:34:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 10:34:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-04-15 10:34:07,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:34:07,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:34:07,584 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:34:07,584 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:34:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:07,586 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2022-04-15 10:34:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2022-04-15 10:34:07,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:34:07,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:34:07,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 76 states. [2022-04-15 10:34:07,586 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 76 states. [2022-04-15 10:34:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:07,588 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2022-04-15 10:34:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2022-04-15 10:34:07,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:34:07,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:34:07,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:34:07,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:34:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 10:34:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-15 10:34:07,590 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 53 [2022-04-15 10:34:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:34:07,591 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-15 10:34:07,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:07,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-15 10:34:14,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 80 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-15 10:34:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 10:34:14,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:34:14,330 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:34:14,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 10:34:14,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:34:14,531 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:34:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:34:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 3 times [2022-04-15 10:34:14,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:14,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1890050110] [2022-04-15 10:34:14,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:34:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash 338559610, now seen corresponding path program 4 times [2022-04-15 10:34:14,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:34:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844362206] [2022-04-15 10:34:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:34:14,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:34:14,544 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:34:14,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [470102951] [2022-04-15 10:34:14,545 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:34:14,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:34:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:34:14,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:34:14,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 10:34:14,587 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:34:14,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:34:14,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 10:34:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:34:14,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:34:15,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9509#true} is VALID [2022-04-15 10:34:15,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9509#true} is VALID [2022-04-15 10:34:15,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:15,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #83#return; {9509#true} is VALID [2022-04-15 10:34:15,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret6 := main(); {9509#true} is VALID [2022-04-15 10:34:15,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {9509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9509#true} is VALID [2022-04-15 10:34:15,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {9509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:15,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {9509#true} ~cond := #in~cond; {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:34:15,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:15,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:15,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} {9509#true} #71#return; {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:34:15,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:34:15,664 INFO L272 TraceCheckUtils]: 12: Hoare triple {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:15,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:15,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:15,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:15,664 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9509#true} {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:34:15,664 INFO L272 TraceCheckUtils]: 17: Hoare triple {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:15,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {9509#true} ~cond := #in~cond; {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:34:15,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {9535#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:15,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:15,666 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} {9546#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {9580#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:15,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {9580#(and (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:15,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:15,667 INFO L272 TraceCheckUtils]: 24: Hoare triple {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:15,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:15,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:15,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:15,667 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9509#true} {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:15,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {9584#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {9606#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:15,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {9606#(and (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9610#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:15,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {9610#(and (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9614#(and (not (= (mod main_~b~0 2) 0)) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:15,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {9614#(and (not (= (mod main_~b~0 2) 0)) (<= 0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:15,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !false; {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:15,671 INFO L272 TraceCheckUtils]: 34: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:15,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:15,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:15,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:15,672 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9509#true} {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} #77#return; {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:15,672 INFO L290 TraceCheckUtils]: 39: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:15,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {9618#(and (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:15,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:15,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {9643#(and (not (= (mod main_~b~0 2) 0)) (<= 0 (+ main_~a~0 1)) (not (= (mod (+ main_~a~0 1) 2) 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9510#false} is VALID [2022-04-15 10:34:15,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-15 10:34:15,674 INFO L272 TraceCheckUtils]: 44: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9510#false} is VALID [2022-04-15 10:34:15,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {9510#false} assume !(0 == ~cond); {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {9510#false} assume true; {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9510#false} {9510#false} #77#return; {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {9510#false} assume !(0 != ~a~0 && 0 != ~b~0); {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L272 TraceCheckUtils]: 50: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {9510#false} assume 0 == ~cond; {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-15 10:34:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 10:34:15,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:34:17,088 INFO L290 TraceCheckUtils]: 53: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-15 10:34:17,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {9510#false} assume 0 == ~cond; {9510#false} is VALID [2022-04-15 10:34:17,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {9510#false} ~cond := #in~cond; {9510#false} is VALID [2022-04-15 10:34:17,088 INFO L272 TraceCheckUtils]: 50: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9510#false} is VALID [2022-04-15 10:34:17,088 INFO L290 TraceCheckUtils]: 49: Hoare triple {9510#false} assume !(0 != ~a~0 && 0 != ~b~0); {9510#false} is VALID [2022-04-15 10:34:17,088 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9509#true} {9510#false} #77#return; {9510#false} is VALID [2022-04-15 10:34:17,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:17,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:17,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:17,089 INFO L272 TraceCheckUtils]: 44: Hoare triple {9510#false} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:17,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-15 10:34:17,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {9716#(and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9510#false} is VALID [2022-04-15 10:34:17,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {9720#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9716#(and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0))} is VALID [2022-04-15 10:34:17,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9720#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:17,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:17,092 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9509#true} {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} #77#return; {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:17,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:17,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:17,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:17,092 INFO L272 TraceCheckUtils]: 34: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:17,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} assume !false; {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:17,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {9749#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {9724#(or (and (= (mod main_~a~0 2) 0) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)))} is VALID [2022-04-15 10:34:17,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {9753#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9749#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-15 10:34:17,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {9757#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {9753#(or (and (= (mod main_~b~0 2) 1) (<= 0 main_~b~0)) (and (= (mod main_~a~0 2) 1) (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (and (<= 1 main_~b~0) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-15 10:34:17,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {9757#(or (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:17,097 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9509#true} {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} #77#return; {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:17,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:17,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:17,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:17,097 INFO L272 TraceCheckUtils]: 24: Hoare triple {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:17,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} assume !false; {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:17,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {9783#(and (<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1)) (or (<= 0 (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= 1 main_~y~0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9761#(or (= main_~a~0 0) (and (= (mod main_~a~0 2) 0) (= (mod main_~b~0 2) 0)) (and (= (mod main_~b~0 2) 0) (<= 0 main_~a~0)) (<= 1 main_~b~0))} is VALID [2022-04-15 10:34:17,099 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} {9509#true} #75#return; {9783#(and (<= 0 (+ (div (+ (- 2) main_~y~0) 2) 1)) (or (<= 0 (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= 1 main_~y~0)))} is VALID [2022-04-15 10:34:17,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {9539#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:17,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {9796#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {9539#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:17,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {9509#true} ~cond := #in~cond; {9796#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 10:34:17,100 INFO L272 TraceCheckUtils]: 17: Hoare triple {9509#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:17,100 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9509#true} {9509#true} #73#return; {9509#true} is VALID [2022-04-15 10:34:17,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L272 TraceCheckUtils]: 12: Hoare triple {9509#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {9509#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9509#true} {9509#true} #71#return; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {9509#true} assume !(0 == ~cond); {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {9509#true} ~cond := #in~cond; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {9509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {9509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret6 := main(); {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #83#return; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-15 10:34:17,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9509#true} is VALID [2022-04-15 10:34:17,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9509#true} is VALID [2022-04-15 10:34:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 10:34:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:34:17,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844362206] [2022-04-15 10:34:17,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:34:17,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470102951] [2022-04-15 10:34:17,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470102951] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 10:34:17,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:34:17,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2022-04-15 10:34:17,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:34:17,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1890050110] [2022-04-15 10:34:17,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1890050110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:34:17,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:34:17,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 10:34:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656529807] [2022-04-15 10:34:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:34:17,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2022-04-15 10:34:17,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:34:17,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:17,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:17,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 10:34:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 10:34:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-15 10:34:17,138 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:18,542 INFO L93 Difference]: Finished difference Result 97 states and 122 transitions. [2022-04-15 10:34:18,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 10:34:18,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2022-04-15 10:34:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:34:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-15 10:34:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2022-04-15 10:34:18,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2022-04-15 10:34:18,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:18,619 INFO L225 Difference]: With dead ends: 97 [2022-04-15 10:34:18,619 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 10:34:18,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2022-04-15 10:34:18,620 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 10:34:18,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 112 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 10:34:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 10:34:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-15 10:34:18,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:34:18,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 10:34:18,897 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 10:34:18,897 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 10:34:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:18,898 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-15 10:34:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-15 10:34:18,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:34:18,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:34:18,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 74 states. [2022-04-15 10:34:18,903 INFO L87 Difference]: Start difference. First operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 74 states. [2022-04-15 10:34:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:18,905 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-15 10:34:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-15 10:34:18,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:34:18,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:34:18,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:34:18,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:34:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 10:34:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2022-04-15 10:34:18,907 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 54 [2022-04-15 10:34:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:34:18,907 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2022-04-15 10:34:18,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-04-15 10:34:18,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 92 transitions. [2022-04-15 10:34:27,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 88 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2022-04-15 10:34:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 10:34:27,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:34:27,944 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:34:27,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 10:34:28,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 10:34:28,145 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:34:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:34:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 3 times [2022-04-15 10:34:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:28,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575656689] [2022-04-15 10:34:28,146 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:34:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1563197702, now seen corresponding path program 4 times [2022-04-15 10:34:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:34:28,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381665532] [2022-04-15 10:34:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:34:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:34:28,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:34:28,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651296574] [2022-04-15 10:34:28,159 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:34:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:34:28,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:34:28,160 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:34:28,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 10:34:28,204 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:34:28,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:34:28,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 10:34:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:34:28,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:34:34,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-15 10:34:34,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10355#true} is VALID [2022-04-15 10:34:34,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-15 10:34:34,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10355#true} {10355#true} #83#return; {10355#true} is VALID [2022-04-15 10:34:34,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {10355#true} call #t~ret6 := main(); {10355#true} is VALID [2022-04-15 10:34:34,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {10355#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {10355#true} is VALID [2022-04-15 10:34:34,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {10355#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {10355#true} ~cond := #in~cond; {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:34:34,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:34,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:34,891 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} {10355#true} #71#return; {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:34:34,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:34:34,891 INFO L272 TraceCheckUtils]: 12: Hoare triple {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {10355#true} ~cond := #in~cond; {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:34:34,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:34,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:34,893 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} {10392#(and (<= main_~x~0 10) (<= 0 main_~x~0))} #73#return; {10411#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} is VALID [2022-04-15 10:34:34,893 INFO L272 TraceCheckUtils]: 17: Hoare triple {10411#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {10355#true} ~cond := #in~cond; {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:34:34,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:34,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10385#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:34:34,894 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10385#(not (= |assume_abort_if_not_#in~cond| 0))} {10411#(and (<= 0 main_~y~0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0))} #75#return; {10427#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {10427#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,895 INFO L272 TraceCheckUtils]: 24: Hoare triple {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-15 10:34:34,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-15 10:34:34,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-15 10:34:34,896 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10355#true} {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {10431#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {10453#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {10453#(and (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (<= main_~x~0 main_~a~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 10:34:34,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !false; {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 10:34:34,898 INFO L272 TraceCheckUtils]: 32: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-15 10:34:34,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-15 10:34:34,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-15 10:34:34,898 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10355#true} {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} #77#return; {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 10:34:34,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume !!(0 != ~a~0 && 0 != ~b~0); {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} is VALID [2022-04-15 10:34:34,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {10457#(and (<= main_~y~0 10) (= (div main_~y~0 2) main_~b~0) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (<= 1 main_~y~0) (< (div (* (- 1) main_~x~0) (- 2)) (+ main_~a~0 1)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !false; {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,901 INFO L272 TraceCheckUtils]: 40: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-15 10:34:34,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-15 10:34:34,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-15 10:34:34,902 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10355#true} {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} #77#return; {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {10482#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {10507#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {10507#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0))) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (< 0 main_~a~0) (< (div (- (div (* (- 1) main_~x~0) (- 2))) (- 2)) (+ main_~a~0 1)) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {10511#(and (not (= (mod main_~b~0 2) 0)) (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {10511#(and (not (= (mod main_~b~0 2) 0)) (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (= main_~b~0 (div (div main_~y~0 2) 2)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} assume !false; {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,906 INFO L272 TraceCheckUtils]: 50: Hoare triple {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-15 10:34:34,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {10355#true} ~cond := #in~cond; {10525#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:34:34,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {10525#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:34:34,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:34:34,910 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10529#(not (= |__VERIFIER_assert_#in~cond| 0))} {10515#(and (<= (mod (div main_~y~0 2) 2) 0) (not (= 0 (mod (+ main_~b~0 1) 2))) (<= main_~y~0 10) (= (+ main_~b~0 1) (div (div main_~y~0 2) 2)) (<= main_~x~0 10) (<= 0 main_~x~0) (<= (mod main_~y~0 2) 0) (<= 1 main_~y~0))} #77#return; {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} is VALID [2022-04-15 10:34:34,915 INFO L272 TraceCheckUtils]: 56: Hoare triple {10536#(and (<= (mod (div main_~y~0 2) 2) 0) (<= main_~y~0 10) (<= main_~x~0 10) (<= 0 main_~x~0) (not (= (mod (div (div main_~y~0 2) 2) 2) 0)) (<= (mod main_~y~0 2) 0) (exists ((main_~p~0 Int) (main_~a~0 Int)) (= (+ main_~q~0 (* (+ (- 1) (div (div main_~y~0 2) 2)) main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10543#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:34:34,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {10543#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10547#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:34:34,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {10547#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10356#false} is VALID [2022-04-15 10:34:34,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-15 10:34:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 10:34:34,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:34:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:34:41,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381665532] [2022-04-15 10:34:41,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:34:41,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651296574] [2022-04-15 10:34:41,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651296574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 10:34:41,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 10:34:41,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2022-04-15 10:34:41,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:34:41,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575656689] [2022-04-15 10:34:41,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575656689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:34:41,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:34:41,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 10:34:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479925912] [2022-04-15 10:34:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:34:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 60 [2022-04-15 10:34:41,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:34:41,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:34:41,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:41,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 10:34:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 10:34:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-15 10:34:41,386 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:34:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:44,147 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2022-04-15 10:34:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 10:34:44,147 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 60 [2022-04-15 10:34:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:34:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:34:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-15 10:34:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:34:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-15 10:34:44,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2022-04-15 10:34:44,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:44,333 INFO L225 Difference]: With dead ends: 102 [2022-04-15 10:34:44,333 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 10:34:44,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2022-04-15 10:34:44,333 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 10:34:44,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 213 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 495 Invalid, 0 Unknown, 140 Unchecked, 0.7s Time] [2022-04-15 10:34:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 10:34:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2022-04-15 10:34:44,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:34:44,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 10:34:44,700 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 10:34:44,700 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 10:34:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:44,702 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-04-15 10:34:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 129 transitions. [2022-04-15 10:34:44,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:34:44,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:34:44,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 97 states. [2022-04-15 10:34:44,703 INFO L87 Difference]: Start difference. First operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 97 states. [2022-04-15 10:34:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:34:44,704 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-04-15 10:34:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 129 transitions. [2022-04-15 10:34:44,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:34:44,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:34:44,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:34:44,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:34:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 10:34:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2022-04-15 10:34:44,707 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 60 [2022-04-15 10:34:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:34:44,707 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2022-04-15 10:34:44,707 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 10:34:44,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 98 transitions. [2022-04-15 10:34:55,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 93 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 10:34:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2022-04-15 10:34:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 10:34:55,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:34:55,881 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:34:55,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 10:34:56,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 10:34:56,082 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:34:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:34:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1988072646, now seen corresponding path program 1 times [2022-04-15 10:34:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:34:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390473418] [2022-04-15 10:34:56,083 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:34:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1988072646, now seen corresponding path program 2 times [2022-04-15 10:34:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:34:56,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779046839] [2022-04-15 10:34:56,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:34:56,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:34:56,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:34:56,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468355228] [2022-04-15 10:34:56,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:34:56,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:34:56,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:34:56,096 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:34:56,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 10:34:56,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:34:56,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:34:56,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 10:34:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:34:56,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:35:07,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {11137#true} call ULTIMATE.init(); {11137#true} is VALID [2022-04-15 10:35:07,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {11137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11137#true} {11137#true} #83#return; {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {11137#true} call #t~ret6 := main(); {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {11137#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {11137#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11137#true} {11137#true} #71#return; {11137#true} is VALID [2022-04-15 10:35:07,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L272 TraceCheckUtils]: 12: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11137#true} {11137#true} #73#return; {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L272 TraceCheckUtils]: 17: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {11137#true} ~cond := #in~cond; {11196#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 10:35:07,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {11196#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11200#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:35:07,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {11200#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11200#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 10:35:07,853 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11200#(not (= |assume_abort_if_not_#in~cond| 0))} {11137#true} #75#return; {11207#(<= 1 main_~y~0)} is VALID [2022-04-15 10:35:07,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {11207#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:07,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:07,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:07,854 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11137#true} {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {11211#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {11233#(and (<= main_~y~0 main_~b~0) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} assume !false; {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,857 INFO L272 TraceCheckUtils]: 33: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:07,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:07,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:07,858 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11137#true} {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} #77#return; {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {11240#(and (<= (mod main_~b~0 2) 0) (<= main_~y~0 main_~b~0) (< 0 (+ (div main_~a~0 2) 1)) (<= 1 main_~y~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11265#(and (< 0 (+ main_~a~0 1)) (exists ((aux_mod_v_main_~b~0_57_22 Int) (aux_div_v_main_~b~0_57_22 Int)) (and (<= aux_mod_v_main_~b~0_57_22 0) (<= 0 aux_mod_v_main_~b~0_57_22) (<= main_~y~0 (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22)) (<= (div (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22) 2) main_~b~0))) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {11265#(and (< 0 (+ main_~a~0 1)) (exists ((aux_mod_v_main_~b~0_57_22 Int) (aux_div_v_main_~b~0_57_22 Int)) (and (<= aux_mod_v_main_~b~0_57_22 0) (<= 0 aux_mod_v_main_~b~0_57_22) (<= main_~y~0 (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22)) (<= (div (+ (* 2 aux_div_v_main_~b~0_57_22) aux_mod_v_main_~b~0_57_22) 2) main_~b~0))) (<= 1 main_~y~0))} assume !false; {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,862 INFO L272 TraceCheckUtils]: 41: Hoare triple {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:07,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:07,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:07,863 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11137#true} {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} #77#return; {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {11269#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (<= 1 main_~y~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {11288#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 1)) (not (= main_~a~0 0)) (<= 1 main_~y~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} assume !false; {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:07,867 INFO L272 TraceCheckUtils]: 51: Hoare triple {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:07,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {11137#true} ~cond := #in~cond; {11308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:35:07,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {11308#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:35:07,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:35:09,870 WARN L284 TraceCheckUtils]: 55: Hoare quadruple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} {11298#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0))} #77#return; {11319#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} is UNKNOWN [2022-04-15 10:35:09,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {11319#(and (< 0 (+ main_~a~0 1)) (< (div (* (- 1) main_~y~0) (- 2)) (+ main_~b~0 2)) (<= 1 main_~y~0) (or (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))))} assume !(0 != ~a~0 && 0 != ~b~0); {11323#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 10:35:09,873 INFO L272 TraceCheckUtils]: 57: Hoare triple {11323#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:35:09,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:35:09,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {11331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11138#false} is VALID [2022-04-15 10:35:09,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {11138#false} assume !false; {11138#false} is VALID [2022-04-15 10:35:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 10:35:09,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:35:51,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {11138#false} assume !false; {11138#false} is VALID [2022-04-15 10:35:51,736 INFO L290 TraceCheckUtils]: 59: Hoare triple {11331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11138#false} is VALID [2022-04-15 10:35:51,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:35:51,736 INFO L272 TraceCheckUtils]: 57: Hoare triple {11347#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:35:51,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {11351#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {11347#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:35:51,739 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} {11137#true} #77#return; {11351#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:35:51,739 INFO L290 TraceCheckUtils]: 54: Hoare triple {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:35:51,740 INFO L290 TraceCheckUtils]: 53: Hoare triple {11364#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11312#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:35:51,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {11137#true} ~cond := #in~cond; {11364#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:35:51,740 INFO L272 TraceCheckUtils]: 51: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-15 10:35:51,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {11137#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {11137#true} is VALID [2022-04-15 10:35:51,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {11137#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {11137#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 46: Hoare triple {11137#true} assume !!(0 != ~a~0 && 0 != ~b~0); {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11137#true} {11137#true} #77#return; {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L272 TraceCheckUtils]: 41: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {11137#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {11137#true} assume !!(0 != ~a~0 && 0 != ~b~0); {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11137#true} {11137#true} #77#return; {11137#true} is VALID [2022-04-15 10:35:51,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L272 TraceCheckUtils]: 33: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 32: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {11137#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {11137#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {11137#true} assume !!(0 != ~a~0 && 0 != ~b~0); {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11137#true} {11137#true} #77#return; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 25: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L272 TraceCheckUtils]: 24: Hoare triple {11137#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {11137#true} assume !false; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {11137#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11137#true} is VALID [2022-04-15 10:35:51,742 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11137#true} {11137#true} #75#return; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L272 TraceCheckUtils]: 17: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11137#true} {11137#true} #73#return; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L272 TraceCheckUtils]: 12: Hoare triple {11137#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11137#true} {11137#true} #71#return; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {11137#true} assume !(0 == ~cond); {11137#true} is VALID [2022-04-15 10:35:51,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {11137#true} ~cond := #in~cond; {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {11137#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {11137#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {11137#true} call #t~ret6 := main(); {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11137#true} {11137#true} #83#return; {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {11137#true} assume true; {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {11137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {11137#true} call ULTIMATE.init(); {11137#true} is VALID [2022-04-15 10:35:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-15 10:35:51,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:35:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779046839] [2022-04-15 10:35:51,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:35:51,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468355228] [2022-04-15 10:35:51,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468355228] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:35:51,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:35:51,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 21 [2022-04-15 10:35:51,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:35:51,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390473418] [2022-04-15 10:35:51,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390473418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:35:51,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:35:51,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 10:35:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27122683] [2022-04-15 10:35:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:35:51,746 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2022-04-15 10:35:51,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:35:51,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 10:35:53,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:35:53,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 10:35:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:35:53,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 10:35:53,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-15 10:35:53,793 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 10:35:57,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:35:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:35:59,947 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2022-04-15 10:35:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 10:35:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2022-04-15 10:35:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:35:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 10:35:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-15 10:35:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 10:35:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-15 10:35:59,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-15 10:36:08,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 76 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 10:36:08,053 INFO L225 Difference]: With dead ends: 110 [2022-04-15 10:36:08,053 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 10:36:08,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-04-15 10:36:08,053 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 49 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 10:36:08,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 178 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 1 Unknown, 2 Unchecked, 3.2s Time] [2022-04-15 10:36:08,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 10:36:08,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2022-04-15 10:36:08,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:36:08,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 10:36:08,450 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 10:36:08,450 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 10:36:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:36:08,452 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-04-15 10:36:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-04-15 10:36:08,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:36:08,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:36:08,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 105 states. [2022-04-15 10:36:08,453 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 105 states. [2022-04-15 10:36:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:36:08,455 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-04-15 10:36:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-04-15 10:36:08,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:36:08,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:36:08,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:36:08,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:36:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 10:36:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-04-15 10:36:08,458 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 61 [2022-04-15 10:36:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:36:08,458 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-04-15 10:36:08,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-15 10:36:08,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 105 transitions. [2022-04-15 10:36:21,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 99 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 10:36:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-15 10:36:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 10:36:21,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:36:21,551 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:36:21,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 10:36:21,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 10:36:21,760 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:36:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:36:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 165486739, now seen corresponding path program 5 times [2022-04-15 10:36:21,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:36:21,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709026879] [2022-04-15 10:36:21,760 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:36:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash 165486739, now seen corresponding path program 6 times [2022-04-15 10:36:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:36:21,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164394526] [2022-04-15 10:36:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:36:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:36:21,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:36:21,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984923480] [2022-04-15 10:36:21,773 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:36:21,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:36:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:36:21,774 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:36:21,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 10:36:21,849 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 10:36:21,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:36:21,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 10:36:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:36:21,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:36:28,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {12136#true} call ULTIMATE.init(); {12136#true} is VALID [2022-04-15 10:36:28,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {12136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12136#true} {12136#true} #83#return; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {12136#true} call #t~ret6 := main(); {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {12136#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {12136#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12136#true} {12136#true} #71#return; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {12136#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L272 TraceCheckUtils]: 12: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:28,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12136#true} {12136#true} #73#return; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L272 TraceCheckUtils]: 17: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12136#true} {12136#true} #75#return; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {12136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L272 TraceCheckUtils]: 24: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:28,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L290 TraceCheckUtils]: 29: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {12136#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L272 TraceCheckUtils]: 32: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:28,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 40: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L272 TraceCheckUtils]: 42: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:28,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:28,129 INFO L272 TraceCheckUtils]: 52: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:28,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {12136#true} ~cond := #in~cond; {12300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:36:28,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {12300#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:36:28,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:36:30,139 WARN L284 TraceCheckUtils]: 56: Hoare quadruple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} {12136#true} #77#return; {12311#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-15 10:36:30,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {12311#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:36:30,141 INFO L272 TraceCheckUtils]: 58: Hoare triple {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:36:30,142 INFO L290 TraceCheckUtils]: 59: Hoare triple {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:36:30,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {12323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12137#false} is VALID [2022-04-15 10:36:30,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {12137#false} assume !false; {12137#false} is VALID [2022-04-15 10:36:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-15 10:36:30,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:36:56,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {12137#false} assume !false; {12137#false} is VALID [2022-04-15 10:36:56,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {12323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12137#false} is VALID [2022-04-15 10:36:56,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:36:56,753 INFO L272 TraceCheckUtils]: 58: Hoare triple {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:36:56,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {12342#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {12315#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 10:36:56,756 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} {12136#true} #77#return; {12342#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 10:36:56,756 INFO L290 TraceCheckUtils]: 55: Hoare triple {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:36:56,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {12355#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12304#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {12136#true} ~cond := #in~cond; {12355#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:36:56,757 INFO L272 TraceCheckUtils]: 52: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:56,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L272 TraceCheckUtils]: 42: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 41: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {12136#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {12136#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L272 TraceCheckUtils]: 32: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {12136#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12136#true} is VALID [2022-04-15 10:36:56,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {12136#true} assume !!(0 != ~a~0 && 0 != ~b~0); {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12136#true} {12136#true} #77#return; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L272 TraceCheckUtils]: 24: Hoare triple {12136#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {12136#true} assume !false; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {12136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12136#true} {12136#true} #75#return; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L272 TraceCheckUtils]: 17: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12136#true} {12136#true} #73#return; {12136#true} is VALID [2022-04-15 10:36:56,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L272 TraceCheckUtils]: 12: Hoare triple {12136#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {12136#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12136#true} {12136#true} #71#return; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {12136#true} assume !(0 == ~cond); {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {12136#true} ~cond := #in~cond; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {12136#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 10 then 1 else 0)); {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {12136#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {12136#true} call #t~ret6 := main(); {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12136#true} {12136#true} #83#return; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {12136#true} assume true; {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {12136#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12136#true} is VALID [2022-04-15 10:36:56,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {12136#true} call ULTIMATE.init(); {12136#true} is VALID [2022-04-15 10:36:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-15 10:36:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:36:56,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164394526] [2022-04-15 10:36:56,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:36:56,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984923480] [2022-04-15 10:36:56,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984923480] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:36:56,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:36:56,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 10:36:56,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:36:56,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709026879] [2022-04-15 10:36:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709026879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:36:56,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:36:56,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:36:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65989079] [2022-04-15 10:36:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:36:56,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-15 10:36:56,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:36:56,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 10:36:58,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:36:58,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:36:58,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:36:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:36:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 10:36:58,794 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 10:37:01,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 10:37:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:37:04,697 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-15 10:37:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:37:04,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-15 10:37:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:37:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 10:37:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 10:37:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 10:37:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-15 10:37:04,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-15 10:37:06,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 10:37:06,737 INFO L225 Difference]: With dead ends: 83 [2022-04-15 10:37:06,737 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 10:37:06,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:37:06,738 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 10:37:06,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 10:37:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 10:37:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 10:37:06,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:37:06,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:37:06,739 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:37:06,739 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:37:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:37:06,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 10:37:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 10:37:06,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:37:06,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:37:06,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 10:37:06,740 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 10:37:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:37:06,740 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 10:37:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 10:37:06,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:37:06,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:37:06,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:37:06,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:37:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 10:37:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 10:37:06,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2022-04-15 10:37:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:37:06,741 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 10:37:06,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 10:37:06,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 10:37:06,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:37:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 10:37:06,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:37:06,743 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 10:37:06,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 10:37:06,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:37:06,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 10:37:32,109 WARN L232 SmtUtils]: Spent 23.81s on a formula simplification. DAG size of input: 181 DAG size of output: 174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 10:37:40,496 WARN L232 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 193 DAG size of output: 183 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 10:37:54,195 WARN L232 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 201 DAG size of output: 186 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-15 10:38:32,466 WARN L232 SmtUtils]: Spent 35.17s on a formula simplification. DAG size of input: 161 DAG size of output: 34 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 10:39:09,810 WARN L232 SmtUtils]: Spent 37.24s on a formula simplification. DAG size of input: 171 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)