/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:07:16,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:07:16,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:07:16,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:07:16,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:07:16,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:07:16,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:07:16,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:07:16,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:07:16,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:07:16,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:07:16,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:07:16,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:07:16,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:07:16,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:07:16,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:07:16,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:07:16,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:07:16,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:07:16,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:07:16,556 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:07:16,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:07:16,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:07:16,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:07:16,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:07:16,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:07:16,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:07:16,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:07:16,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:07:16,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:07:16,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:07:16,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:07:16,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:07:16,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:07:16,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:07:16,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:07:16,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:07:16,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:07:16,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:07:16,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:07:16,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:07:16,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:07:16,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:07:16,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:07:16,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:07:16,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:07:16,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:07:16,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:07:16,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:07:16,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:07:16,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:07:16,586 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:07:16,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:07:16,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:07:16,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:07:16,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:07:16,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:07:16,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:07:16,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:07:16,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:07:16,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:07:16,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:07:16,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 13:07:16,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:07:16,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:07:16,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:07:16,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:07:16,765 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:07:16,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c [2022-04-27 13:07:16,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f17bad6f/4cb86ec5ff384ed1858bb16e3b4f2812/FLAG6a93dcc5d [2022-04-27 13:07:17,143 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:07:17,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_valuebound1.c [2022-04-27 13:07:17,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f17bad6f/4cb86ec5ff384ed1858bb16e3b4f2812/FLAG6a93dcc5d [2022-04-27 13:07:17,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f17bad6f/4cb86ec5ff384ed1858bb16e3b4f2812 [2022-04-27 13:07:17,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:07:17,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:07:17,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:07:17,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:07:17,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:07:17,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7512054e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17, skipping insertion in model container [2022-04-27 13:07:17,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:07:17,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:07:17,333 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/egcd3-ll_valuebound1.c[490,503] [2022-04-27 13:07:17,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:07:17,373 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:07:17,385 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/egcd3-ll_valuebound1.c[490,503] [2022-04-27 13:07:17,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:07:17,416 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:07:17,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17 WrapperNode [2022-04-27 13:07:17,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:07:17,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:07:17,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:07:17,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:07:17,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:07:17,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:07:17,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:07:17,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:07:17,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (1/1) ... [2022-04-27 13:07:17,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:07:17,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:17,491 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-27 13:07:17,539 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-27 13:07:17,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:07:17,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:07:17,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:07:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:07:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:07:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:07:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:07:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:07:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:07:17,616 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:07:17,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:07:17,832 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:07:17,840 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:07:17,841 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:07:17,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:07:17 BoogieIcfgContainer [2022-04-27 13:07:17,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:07:17,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:07:17,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:07:17,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:07:17,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:07:17" (1/3) ... [2022-04-27 13:07:17,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cbdff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:07:17, skipping insertion in model container [2022-04-27 13:07:17,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:07:17" (2/3) ... [2022-04-27 13:07:17,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cbdff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:07:17, skipping insertion in model container [2022-04-27 13:07:17,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:07:17" (3/3) ... [2022-04-27 13:07:17,851 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_valuebound1.c [2022-04-27 13:07:17,861 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:07:17,861 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:07:17,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:07:17,911 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@347c4b5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@38c72e32 [2022-04-27 13:07:17,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:07:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:07:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:07:17,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:17,923 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:17,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:17,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1237885594, now seen corresponding path program 1 times [2022-04-27 13:07:17,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:17,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537247113] [2022-04-27 13:07:17,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:17,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:07:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-27 13:07:18,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:07:18,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-27 13:07:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:07:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:07:18,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:07:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:07:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:07:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-27 13:07:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 13:07:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-27 13:07:18,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:07:18,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(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(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-27 13:07:18,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:07:18,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #112#return; {43#true} is VALID [2022-04-27 13:07:18,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-27 13:07:18,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-27 13:07:18,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:18,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:07:18,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-27 13:07:18,157 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:18,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,158 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:07:18,158 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:18,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,159 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #98#return; {44#false} is VALID [2022-04-27 13:07:18,159 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:07:18,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:07:18,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:07:18,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:07:18,160 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #100#return; {44#false} is VALID [2022-04-27 13:07:18,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-27 13:07:18,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {44#false} assume false; {44#false} is VALID [2022-04-27 13:07:18,160 INFO L272 TraceCheckUtils]: 29: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-27 13:07:18,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:07:18,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:07:18,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:07:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:07:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:18,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537247113] [2022-04-27 13:07:18,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537247113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:18,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:18,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:07:18,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728923559] [2022-04-27 13:07:18,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:18,167 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, (7), 3 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 33 [2022-04-27 13:07:18,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:18,170 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, (7), 3 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-27 13:07:18,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:18,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:07:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:07:18,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:07:18,244 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (7), 3 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-27 13:07:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:18,369 INFO L93 Difference]: Finished difference Result 73 states and 115 transitions. [2022-04-27 13:07:18,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:07:18,369 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, (7), 3 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 33 [2022-04-27 13:07:18,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:18,370 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, (7), 3 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-27 13:07:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-27 13:07:18,383 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, (7), 3 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-27 13:07:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-04-27 13:07:18,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-04-27 13:07:18,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:18,505 INFO L225 Difference]: With dead ends: 73 [2022-04-27 13:07:18,505 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:07:18,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-27 13:07:18,509 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:18,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:07:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:07:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 13:07:18,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:18,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:18,532 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:18,532 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:18,537 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 13:07:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:07:18,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:18,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:18,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-27 13:07:18,538 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 35 states. [2022-04-27 13:07:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:18,551 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 13:07:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:07:18,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:18,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:18,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:18,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 13:07:18,557 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 33 [2022-04-27 13:07:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:18,557 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 13:07:18,558 INFO L496 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, (7), 3 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-27 13:07:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 13:07:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 13:07:18,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:18,559 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:18,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:07:18,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1569470122, now seen corresponding path program 1 times [2022-04-27 13:07:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:18,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132722859] [2022-04-27 13:07:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:18,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329577641] [2022-04-27 13:07:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:18,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:18,584 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-27 13:07:18,585 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-27 13:07:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:07:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:18,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:18,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2022-04-27 13:07:18,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#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(11, 2);call #Ultimate.allocInit(12, 3); {294#true} is VALID [2022-04-27 13:07:18,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:18,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #112#return; {294#true} is VALID [2022-04-27 13:07:18,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret6 := main(); {294#true} is VALID [2022-04-27 13:07:18,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {294#true} is VALID [2022-04-27 13:07:18,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:18,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:07:18,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:07:18,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:18,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#true} {294#true} #94#return; {294#true} is VALID [2022-04-27 13:07:18,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {294#true} is VALID [2022-04-27 13:07:18,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:18,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:07:18,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:07:18,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:18,875 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {294#true} {294#true} #96#return; {294#true} is VALID [2022-04-27 13:07:18,875 INFO L272 TraceCheckUtils]: 17: Hoare triple {294#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:18,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {294#true} ~cond := #in~cond; {294#true} is VALID [2022-04-27 13:07:18,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#true} assume !(0 == ~cond); {294#true} is VALID [2022-04-27 13:07:18,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {294#true} assume true; {294#true} is VALID [2022-04-27 13:07:18,876 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {294#true} {294#true} #98#return; {294#true} is VALID [2022-04-27 13:07:18,876 INFO L272 TraceCheckUtils]: 22: Hoare triple {294#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {294#true} is VALID [2022-04-27 13:07:18,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {294#true} ~cond := #in~cond; {368#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:18,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {368#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {372#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:18,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {372#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {372#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:18,878 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {372#(not (= |assume_abort_if_not_#in~cond| 0))} {294#true} #100#return; {379#(<= 1 main_~y~0)} is VALID [2022-04-27 13:07:18,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {379#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {383#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:18,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {383#(<= 1 main_~b~0)} assume !false; {383#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:18,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {383#(<= 1 main_~b~0)} assume !(0 != ~b~0); {295#false} is VALID [2022-04-27 13:07:18,879 INFO L272 TraceCheckUtils]: 30: Hoare triple {295#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {295#false} is VALID [2022-04-27 13:07:18,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {295#false} ~cond := #in~cond; {295#false} is VALID [2022-04-27 13:07:18,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {295#false} assume 0 == ~cond; {295#false} is VALID [2022-04-27 13:07:18,880 INFO L290 TraceCheckUtils]: 33: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-04-27 13:07:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:18,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:07:18,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:18,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132722859] [2022-04-27 13:07:18,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329577641] [2022-04-27 13:07:18,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329577641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:07:18,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:07:18,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:07:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531045544] [2022-04-27 13:07:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 13:07:18,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:18,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:18,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:18,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:07:18,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:18,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:07:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:07:18,906 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,157 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-04-27 13:07:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:07:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-04-27 13:07:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:07:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-27 13:07:19,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-27 13:07:19,211 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-27 13:07:19,213 INFO L225 Difference]: With dead ends: 54 [2022-04-27 13:07:19,213 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 13:07:19,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:07:19,214 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:19,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 133 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 13:07:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-04-27 13:07:19,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:19,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,228 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,228 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,231 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:07:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 13:07:19,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:19,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:19,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-27 13:07:19,232 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-27 13:07:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:19,234 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:07:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 13:07:19,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:19,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:19,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:19,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:07:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 13:07:19,237 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 34 [2022-04-27 13:07:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:19,238 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 13:07:19,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 13:07:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 13:07:19,239 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:19,239 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:19,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 13:07:19,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:19,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1443363578, now seen corresponding path program 1 times [2022-04-27 13:07:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:19,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864994268] [2022-04-27 13:07:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:19,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:19,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70077828] [2022-04-27 13:07:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:19,474 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-27 13:07:19,475 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-27 13:07:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:07:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:19,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:19,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 13:07:19,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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(11, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 13:07:19,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:19,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #112#return; {636#true} is VALID [2022-04-27 13:07:19,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2022-04-27 13:07:19,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {636#true} is VALID [2022-04-27 13:07:19,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:19,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} ~cond := #in~cond; {662#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:19,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {662#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:19,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:19,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {666#(not (= |assume_abort_if_not_#in~cond| 0))} {636#true} #94#return; {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:07:19,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:07:19,926 INFO L272 TraceCheckUtils]: 12: Hoare triple {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:19,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:19,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:19,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:19,927 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {636#true} {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #96#return; {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:07:19,927 INFO L272 TraceCheckUtils]: 17: Hoare triple {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:19,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:19,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:19,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:19,944 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#true} {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #98#return; {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:07:19,944 INFO L272 TraceCheckUtils]: 22: Hoare triple {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:19,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} ~cond := #in~cond; {662#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:19,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {662#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:19,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {666#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {666#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:19,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {666#(not (= |assume_abort_if_not_#in~cond| 0))} {673#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #100#return; {722#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} is VALID [2022-04-27 13:07:19,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {722#(and (<= 0 main_~x~0) (<= main_~x~0 1) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {726#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:19,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {726#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {726#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:19,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {726#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {733#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:19,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {733#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {733#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:19,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {733#(and (= main_~r~0 0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {740#(and (= main_~r~0 0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:19,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {740#(and (= main_~r~0 0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {740#(and (= main_~r~0 0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:07:19,950 INFO L272 TraceCheckUtils]: 33: Hoare triple {740#(and (= main_~r~0 0) (<= main_~x~0 1) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {747#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:19,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {747#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {751#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:19,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {751#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {637#false} is VALID [2022-04-27 13:07:19,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 13:07:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:07:19,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:20,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 13:07:20,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {751#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {637#false} is VALID [2022-04-27 13:07:20,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {747#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {751#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:20,234 INFO L272 TraceCheckUtils]: 33: Hoare triple {767#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {747#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:20,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {767#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {767#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {774#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {767#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:07:20,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {774#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} assume !false; {774#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:07:20,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {781#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~a~0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {774#(or (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:07:20,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {781#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~a~0 main_~b~0))} assume !false; {781#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:07:20,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {636#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {781#(or (= main_~b~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (< main_~a~0 main_~b~0))} is VALID [2022-04-27 13:07:20,237 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {636#true} {636#true} #100#return; {636#true} is VALID [2022-04-27 13:07:20,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,237 INFO L272 TraceCheckUtils]: 22: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,237 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {636#true} {636#true} #98#return; {636#true} is VALID [2022-04-27 13:07:20,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,238 INFO L272 TraceCheckUtils]: 17: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,238 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {636#true} {636#true} #96#return; {636#true} is VALID [2022-04-27 13:07:20,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,239 INFO L272 TraceCheckUtils]: 12: Hoare triple {636#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {636#true} is VALID [2022-04-27 13:07:20,239 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {636#true} {636#true} #94#return; {636#true} is VALID [2022-04-27 13:07:20,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#true} assume !(0 == ~cond); {636#true} is VALID [2022-04-27 13:07:20,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} ~cond := #in~cond; {636#true} is VALID [2022-04-27 13:07:20,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {636#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {636#true} is VALID [2022-04-27 13:07:20,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {636#true} is VALID [2022-04-27 13:07:20,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2022-04-27 13:07:20,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #112#return; {636#true} is VALID [2022-04-27 13:07:20,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 13:07:20,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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(11, 2);call #Ultimate.allocInit(12, 3); {636#true} is VALID [2022-04-27 13:07:20,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 13:07:20,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:07:20,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:20,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864994268] [2022-04-27 13:07:20,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:20,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70077828] [2022-04-27 13:07:20,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70077828] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:07:20,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:07:20,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2022-04-27 13:07:20,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881460560] [2022-04-27 13:07:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:07:20,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-27 13:07:20,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:20,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:20,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:20,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 13:07:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 13:07:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:07:20,264 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:20,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:20,510 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-04-27 13:07:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:07:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-27 13:07:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 13:07:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-27 13:07:20,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-27 13:07:20,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:20,562 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:07:20,562 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:07:20,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:07:20,563 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:20,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 167 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:07:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:07:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:07:20,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:20,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:20,585 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:20,586 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:20,588 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-27 13:07:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:07:20,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:20,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:20,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-27 13:07:20,589 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 51 states. [2022-04-27 13:07:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:20,591 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-27 13:07:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-04-27 13:07:20,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:20,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:20,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:20,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:07:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-27 13:07:20,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 37 [2022-04-27 13:07:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:20,594 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-27 13:07:20,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:07:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:07:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:07:20,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:20,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:20,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:07:20,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 13:07:20,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:20,812 INFO L85 PathProgramCache]: Analyzing trace with hash 584996456, now seen corresponding path program 1 times [2022-04-27 13:07:20,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:20,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968413883] [2022-04-27 13:07:20,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:20,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:20,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:20,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779696069] [2022-04-27 13:07:20,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:20,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:20,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:20,828 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-27 13:07:20,829 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-27 13:07:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:20,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:07:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:20,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:21,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {1130#true} call ULTIMATE.init(); {1130#true} is VALID [2022-04-27 13:07:21,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {1130#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(11, 2);call #Ultimate.allocInit(12, 3); {1130#true} is VALID [2022-04-27 13:07:21,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1130#true} {1130#true} #112#return; {1130#true} is VALID [2022-04-27 13:07:21,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {1130#true} call #t~ret6 := main(); {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {1130#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {1130#true} ~cond := #in~cond; {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#true} assume !(0 == ~cond); {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1130#true} {1130#true} #94#return; {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L272 TraceCheckUtils]: 12: Hoare triple {1130#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#true} ~cond := #in~cond; {1130#true} is VALID [2022-04-27 13:07:21,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#true} assume !(0 == ~cond); {1130#true} is VALID [2022-04-27 13:07:21,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,002 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1130#true} {1130#true} #96#return; {1130#true} is VALID [2022-04-27 13:07:21,002 INFO L272 TraceCheckUtils]: 17: Hoare triple {1130#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {1130#true} ~cond := #in~cond; {1189#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:21,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {1189#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1193#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {1193#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1193#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,003 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1193#(not (= |assume_abort_if_not_#in~cond| 0))} {1130#true} #98#return; {1200#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,003 INFO L272 TraceCheckUtils]: 22: Hoare triple {1200#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {1130#true} ~cond := #in~cond; {1130#true} is VALID [2022-04-27 13:07:21,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {1130#true} assume !(0 == ~cond); {1130#true} is VALID [2022-04-27 13:07:21,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,004 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1130#true} {1200#(<= 1 main_~x~0)} #100#return; {1200#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {1200#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1219#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {1219#(<= 1 main_~a~0)} assume !false; {1219#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {1219#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1226#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {1226#(<= 1 main_~c~0)} assume !false; {1226#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {1226#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {1226#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {1226#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1236#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {1236#(<= 1 main_~b~0)} assume !false; {1236#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {1236#(<= 1 main_~b~0)} assume !(0 != ~b~0); {1131#false} is VALID [2022-04-27 13:07:21,007 INFO L272 TraceCheckUtils]: 35: Hoare triple {1131#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1131#false} is VALID [2022-04-27 13:07:21,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#false} ~cond := #in~cond; {1131#false} is VALID [2022-04-27 13:07:21,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#false} assume 0 == ~cond; {1131#false} is VALID [2022-04-27 13:07:21,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {1131#false} assume !false; {1131#false} is VALID [2022-04-27 13:07:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:21,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:07:21,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {1131#false} assume !false; {1131#false} is VALID [2022-04-27 13:07:21,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {1131#false} assume 0 == ~cond; {1131#false} is VALID [2022-04-27 13:07:21,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {1131#false} ~cond := #in~cond; {1131#false} is VALID [2022-04-27 13:07:21,181 INFO L272 TraceCheckUtils]: 35: Hoare triple {1131#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1131#false} is VALID [2022-04-27 13:07:21,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {1236#(<= 1 main_~b~0)} assume !(0 != ~b~0); {1131#false} is VALID [2022-04-27 13:07:21,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {1236#(<= 1 main_~b~0)} assume !false; {1236#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,182 INFO L290 TraceCheckUtils]: 32: Hoare triple {1226#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1236#(<= 1 main_~b~0)} is VALID [2022-04-27 13:07:21,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {1226#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {1226#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {1226#(<= 1 main_~c~0)} assume !false; {1226#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {1219#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1226#(<= 1 main_~c~0)} is VALID [2022-04-27 13:07:21,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {1219#(<= 1 main_~a~0)} assume !false; {1219#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {1200#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1219#(<= 1 main_~a~0)} is VALID [2022-04-27 13:07:21,184 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1130#true} {1200#(<= 1 main_~x~0)} #100#return; {1200#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {1130#true} assume !(0 == ~cond); {1130#true} is VALID [2022-04-27 13:07:21,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {1130#true} ~cond := #in~cond; {1130#true} is VALID [2022-04-27 13:07:21,185 INFO L272 TraceCheckUtils]: 22: Hoare triple {1200#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,185 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1193#(not (= |assume_abort_if_not_#in~cond| 0))} {1130#true} #98#return; {1200#(<= 1 main_~x~0)} is VALID [2022-04-27 13:07:21,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {1193#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1193#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1193#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:21,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {1130#true} ~cond := #in~cond; {1315#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:07:21,186 INFO L272 TraceCheckUtils]: 17: Hoare triple {1130#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,186 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1130#true} {1130#true} #96#return; {1130#true} is VALID [2022-04-27 13:07:21,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {1130#true} assume !(0 == ~cond); {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#true} ~cond := #in~cond; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L272 TraceCheckUtils]: 12: Hoare triple {1130#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1130#true} {1130#true} #94#return; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#true} assume !(0 == ~cond); {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {1130#true} ~cond := #in~cond; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {1130#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1130#true} is VALID [2022-04-27 13:07:21,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {1130#true} call #t~ret6 := main(); {1130#true} is VALID [2022-04-27 13:07:21,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1130#true} {1130#true} #112#return; {1130#true} is VALID [2022-04-27 13:07:21,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {1130#true} assume true; {1130#true} is VALID [2022-04-27 13:07:21,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {1130#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(11, 2);call #Ultimate.allocInit(12, 3); {1130#true} is VALID [2022-04-27 13:07:21,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {1130#true} call ULTIMATE.init(); {1130#true} is VALID [2022-04-27 13:07:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:21,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:07:21,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968413883] [2022-04-27 13:07:21,188 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:07:21,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779696069] [2022-04-27 13:07:21,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779696069] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:07:21,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:07:21,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:07:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951486354] [2022-04-27 13:07:21,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:07:21,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 39 [2022-04-27 13:07:21,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:07:21,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-27 13:07:21,209 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-27 13:07:21,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:07:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:07:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:07:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:07:21,210 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-27 13:07:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,775 INFO L93 Difference]: Finished difference Result 103 states and 143 transitions. [2022-04-27 13:07:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:07:21,776 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 39 [2022-04-27 13:07:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:07:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-27 13:07:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 13:07:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-27 13:07:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-27 13:07:21,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-27 13:07:21,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:07:21,867 INFO L225 Difference]: With dead ends: 103 [2022-04-27 13:07:21,867 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 13:07:21,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:07:21,868 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 55 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:07:21,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 238 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:07:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 13:07:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2022-04-27 13:07:21,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:07:21,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:21,930 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:21,930 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,934 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-27 13:07:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-27 13:07:21,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:21,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:21,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-27 13:07:21,935 INFO L87 Difference]: Start difference. First operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 96 states. [2022-04-27 13:07:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:07:21,939 INFO L93 Difference]: Finished difference Result 96 states and 136 transitions. [2022-04-27 13:07:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2022-04-27 13:07:21,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:07:21,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:07:21,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:07:21,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:07:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:07:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-04-27 13:07:21,942 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 39 [2022-04-27 13:07:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:07:21,942 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-04-27 13:07:21,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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-27 13:07:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-04-27 13:07:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:07:21,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:07:21,943 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:07:21,960 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-27 13:07:22,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:22,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:07:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:07:22,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1286298951, now seen corresponding path program 1 times [2022-04-27 13:07:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:07:22,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999002369] [2022-04-27 13:07:22,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:07:22,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:07:22,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016968120] [2022-04-27 13:07:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:07:22,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:07:22,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:07:22,183 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-27 13:07:22,184 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-27 13:07:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:22,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:07:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:07:22,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:07:24,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {1841#true} call ULTIMATE.init(); {1841#true} is VALID [2022-04-27 13:07:24,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#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(11, 2);call #Ultimate.allocInit(12, 3); {1841#true} is VALID [2022-04-27 13:07:24,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#true} {1841#true} #112#return; {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#true} call #t~ret6 := main(); {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {1841#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {1841#true} ~cond := #in~cond; {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {1841#true} assume !(0 == ~cond); {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-27 13:07:24,762 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1841#true} {1841#true} #94#return; {1841#true} is VALID [2022-04-27 13:07:24,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {1841#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1841#true} is VALID [2022-04-27 13:07:24,763 INFO L272 TraceCheckUtils]: 12: Hoare triple {1841#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {1841#true} is VALID [2022-04-27 13:07:24,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {1841#true} ~cond := #in~cond; {1885#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:07:24,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {1885#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1889#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:24,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {1889#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1889#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:07:24,764 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1889#(not (= |assume_abort_if_not_#in~cond| 0))} {1841#true} #96#return; {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,765 INFO L272 TraceCheckUtils]: 17: Hoare triple {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1841#true} is VALID [2022-04-27 13:07:24,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {1841#true} ~cond := #in~cond; {1841#true} is VALID [2022-04-27 13:07:24,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {1841#true} assume !(0 == ~cond); {1841#true} is VALID [2022-04-27 13:07:24,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-27 13:07:24,765 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1841#true} {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #98#return; {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,766 INFO L272 TraceCheckUtils]: 22: Hoare triple {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1841#true} is VALID [2022-04-27 13:07:24,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {1841#true} ~cond := #in~cond; {1841#true} is VALID [2022-04-27 13:07:24,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#true} assume !(0 == ~cond); {1841#true} is VALID [2022-04-27 13:07:24,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-27 13:07:24,766 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1841#true} {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #100#return; {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {1896#(and (<= 0 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1930#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {1930#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 1))} assume !false; {1930#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {1930#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} assume !false; {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} assume !false; {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,769 INFO L272 TraceCheckUtils]: 33: Hoare triple {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1841#true} is VALID [2022-04-27 13:07:24,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {1841#true} ~cond := #in~cond; {1841#true} is VALID [2022-04-27 13:07:24,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {1841#true} assume !(0 == ~cond); {1841#true} is VALID [2022-04-27 13:07:24,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-27 13:07:24,771 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1841#true} {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} #102#return; {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:07:24,771 INFO L272 TraceCheckUtils]: 38: Hoare triple {1937#(and (<= 0 main_~y~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (= main_~b~0 0)) (= main_~q~0 0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1965#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:07:24,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {1965#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1969#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:07:24,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {1969#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1842#false} is VALID [2022-04-27 13:07:24,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {1842#false} assume !false; {1842#false} is VALID [2022-04-27 13:07:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 13:07:24,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999002369] [2022-04-27 13:08:01,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016968120] [2022-04-27 13:08:01,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016968120] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 13:08:01,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:08:01,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 13:08:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522733172] [2022-04-27 13:08:01,165 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:01,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 13:08:01,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:01,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:08:01,198 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-27 13:08:01,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:08:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:08:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:08:01,199 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:08:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:01,611 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-27 13:08:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:08:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 13:08:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:08:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-27 13:08:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:08:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2022-04-27 13:08:01,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 67 transitions. [2022-04-27 13:08:01,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:01,684 INFO L225 Difference]: With dead ends: 79 [2022-04-27 13:08:01,684 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 13:08:01,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:08:01,685 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:01,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:08:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 13:08:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-27 13:08:01,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:01,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:08:01,778 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:08:01,779 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:08:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:01,783 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:08:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:08:01,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:01,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:01,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 77 states. [2022-04-27 13:08:01,784 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 77 states. [2022-04-27 13:08:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:01,787 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:08:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:08:01,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:01,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:01,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:01,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:08:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-04-27 13:08:01,790 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 42 [2022-04-27 13:08:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:01,790 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-04-27 13:08:01,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:08:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-04-27 13:08:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:08:01,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:01,794 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:01,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 13:08:02,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:02,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -974923140, now seen corresponding path program 1 times [2022-04-27 13:08:02,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:02,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147278170] [2022-04-27 13:08:02,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:02,031 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:02,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203545364] [2022-04-27 13:08:02,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:02,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:02,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:02,035 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-27 13:08:02,038 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-27 13:08:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:02,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:08:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:02,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:02,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2379#true} is VALID [2022-04-27 13:08:02,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#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(11, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-27 13:08:02,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-27 13:08:02,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #112#return; {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret6 := main(); {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {2379#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2379#true} {2379#true} #94#return; {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2379#true} is VALID [2022-04-27 13:08:02,281 INFO L272 TraceCheckUtils]: 12: Hoare triple {2379#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2379#true} ~cond := #in~cond; {2423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:02,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} {2379#true} #96#return; {2434#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:02,283 INFO L272 TraceCheckUtils]: 17: Hoare triple {2434#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {2379#true} ~cond := #in~cond; {2423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:02,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {2423#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,284 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} {2434#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #98#return; {2450#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:02,284 INFO L272 TraceCheckUtils]: 22: Hoare triple {2450#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,284 INFO L290 TraceCheckUtils]: 23: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-04-27 13:08:02,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-04-27 13:08:02,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-27 13:08:02,285 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2379#true} {2450#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} #100#return; {2450#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:02,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {2450#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2469#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-27 13:08:02,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {2469#(and (<= main_~b~0 1) (<= 1 main_~a~0))} assume !false; {2469#(and (<= main_~b~0 1) (<= 1 main_~a~0))} is VALID [2022-04-27 13:08:02,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {2469#(and (<= main_~b~0 1) (<= 1 main_~a~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2476#(and (<= 1 main_~c~0) (<= main_~b~0 1))} is VALID [2022-04-27 13:08:02,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {2476#(and (<= 1 main_~c~0) (<= main_~b~0 1))} assume !false; {2476#(and (<= 1 main_~c~0) (<= main_~b~0 1))} is VALID [2022-04-27 13:08:02,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {2476#(and (<= 1 main_~c~0) (<= main_~b~0 1))} assume !(~c~0 >= ~b~0); {2380#false} is VALID [2022-04-27 13:08:02,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {2380#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {2380#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 35: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {2380#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L272 TraceCheckUtils]: 38: Hoare triple {2380#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-27 13:08:02,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:08:02,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:02,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {2380#false} assume 0 == ~cond; {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L290 TraceCheckUtils]: 39: Hoare triple {2380#false} ~cond := #in~cond; {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L272 TraceCheckUtils]: 38: Hoare triple {2380#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {2380#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {2380#false} assume !false; {2380#false} is VALID [2022-04-27 13:08:02,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {2534#(= main_~b~0 0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2380#false} is VALID [2022-04-27 13:08:02,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {2534#(= main_~b~0 0)} assume !false; {2534#(= main_~b~0 0)} is VALID [2022-04-27 13:08:02,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {2541#(= main_~c~0 0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2534#(= main_~b~0 0)} is VALID [2022-04-27 13:08:02,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {2545#(or (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !(~c~0 >= ~b~0); {2541#(= main_~c~0 0)} is VALID [2022-04-27 13:08:02,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {2545#(or (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !false; {2545#(or (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-27 13:08:02,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {2552#(and (or (<= main_~b~0 1) (<= main_~b~0 main_~a~0)) (or (<= main_~b~0 main_~a~0) (<= 0 main_~a~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2545#(or (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-27 13:08:02,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {2552#(and (or (<= main_~b~0 1) (<= main_~b~0 main_~a~0)) (or (<= main_~b~0 main_~a~0) (<= 0 main_~a~0)))} assume !false; {2552#(and (or (<= main_~b~0 1) (<= main_~b~0 main_~a~0)) (or (<= main_~b~0 main_~a~0) (<= 0 main_~a~0)))} is VALID [2022-04-27 13:08:02,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#(and (or (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) (or (<= main_~y~0 1) (<= main_~y~0 main_~x~0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2552#(and (or (<= main_~b~0 1) (<= main_~b~0 main_~a~0)) (or (<= main_~b~0 main_~a~0) (<= 0 main_~a~0)))} is VALID [2022-04-27 13:08:02,842 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2379#true} {2559#(and (or (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) (or (<= main_~y~0 1) (<= main_~y~0 main_~x~0)))} #100#return; {2559#(and (or (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) (or (<= main_~y~0 1) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:08:02,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-27 13:08:02,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-04-27 13:08:02,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-04-27 13:08:02,842 INFO L272 TraceCheckUtils]: 22: Hoare triple {2559#(and (or (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) (or (<= main_~y~0 1) (<= main_~y~0 main_~x~0)))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,843 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} {2578#(<= main_~y~0 1)} #98#return; {2559#(and (or (<= 0 main_~x~0) (<= main_~y~0 main_~x~0)) (or (<= main_~y~0 1) (<= main_~y~0 main_~x~0)))} is VALID [2022-04-27 13:08:02,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {2588#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {2379#true} ~cond := #in~cond; {2588#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:08:02,844 INFO L272 TraceCheckUtils]: 17: Hoare triple {2578#(<= main_~y~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,844 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} {2379#true} #96#return; {2578#(<= main_~y~0 1)} is VALID [2022-04-27 13:08:02,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {2427#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {2588#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2427#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:02,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {2379#true} ~cond := #in~cond; {2588#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:08:02,845 INFO L272 TraceCheckUtils]: 12: Hoare triple {2379#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2379#true} {2379#true} #94#return; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {2379#true} assume !(0 == ~cond); {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {2379#true} ~cond := #in~cond; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {2379#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {2379#true} call #t~ret6 := main(); {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2379#true} {2379#true} #112#return; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {2379#true} assume true; {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {2379#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(11, 2);call #Ultimate.allocInit(12, 3); {2379#true} is VALID [2022-04-27 13:08:02,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {2379#true} call ULTIMATE.init(); {2379#true} is VALID [2022-04-27 13:08:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:08:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:02,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147278170] [2022-04-27 13:08:02,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:02,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203545364] [2022-04-27 13:08:02,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203545364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:02,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:02,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2022-04-27 13:08:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849854039] [2022-04-27 13:08:02,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 42 [2022-04-27 13:08:02,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:02,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:08:02,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:02,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 13:08:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 13:08:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:08:02,881 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:08:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:03,759 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2022-04-27 13:08:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:08:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 42 [2022-04-27 13:08:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:08:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2022-04-27 13:08:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:08:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2022-04-27 13:08:03,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2022-04-27 13:08:03,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:03,840 INFO L225 Difference]: With dead ends: 102 [2022-04-27 13:08:03,840 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 13:08:03,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:08:03,841 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 95 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:03,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 248 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:08:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 13:08:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2022-04-27 13:08:03,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:03,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:08:03,901 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:08:03,901 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:08:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:03,902 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-04-27 13:08:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-04-27 13:08:03,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:03,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:03,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:08:03,903 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-27 13:08:03,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:03,905 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2022-04-27 13:08:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-04-27 13:08:03,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:03,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:03,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:03,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:08:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-04-27 13:08:03,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 42 [2022-04-27 13:08:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:03,907 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-04-27 13:08:03,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:08:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-27 13:08:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:08:03,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:03,907 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2022-04-27 13:08:03,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:08:04,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:04,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash 81990170, now seen corresponding path program 1 times [2022-04-27 13:08:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450880925] [2022-04-27 13:08:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:04,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:04,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1567827238] [2022-04-27 13:08:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:04,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:04,140 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-27 13:08:04,140 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-27 13:08:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:04,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:08:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:04,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:06,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {3023#true} call ULTIMATE.init(); {3023#true} is VALID [2022-04-27 13:08:06,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {3023#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(11, 2);call #Ultimate.allocInit(12, 3); {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3023#true} {3023#true} #112#return; {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {3023#true} call #t~ret6 := main(); {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {3023#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {3023#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {3023#true} ~cond := #in~cond; {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {3023#true} assume !(0 == ~cond); {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3023#true} {3023#true} #94#return; {3023#true} is VALID [2022-04-27 13:08:06,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {3023#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3023#true} is VALID [2022-04-27 13:08:06,331 INFO L272 TraceCheckUtils]: 12: Hoare triple {3023#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3023#true} is VALID [2022-04-27 13:08:06,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {3023#true} ~cond := #in~cond; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {3023#true} assume !(0 == ~cond); {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3023#true} {3023#true} #96#return; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L272 TraceCheckUtils]: 17: Hoare triple {3023#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {3023#true} ~cond := #in~cond; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {3023#true} assume !(0 == ~cond); {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3023#true} {3023#true} #98#return; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L272 TraceCheckUtils]: 22: Hoare triple {3023#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {3023#true} ~cond := #in~cond; {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {3023#true} assume !(0 == ~cond); {3023#true} is VALID [2022-04-27 13:08:06,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,333 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3023#true} {3023#true} #100#return; {3023#true} is VALID [2022-04-27 13:08:06,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {3023#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3023#true} is VALID [2022-04-27 13:08:06,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {3023#true} assume !false; {3023#true} is VALID [2022-04-27 13:08:06,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {3023#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:08:06,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:08:06,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:08:06,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:08:06,337 INFO L272 TraceCheckUtils]: 33: Hoare triple {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3023#true} is VALID [2022-04-27 13:08:06,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {3023#true} ~cond := #in~cond; {3023#true} is VALID [2022-04-27 13:08:06,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {3023#true} assume !(0 == ~cond); {3023#true} is VALID [2022-04-27 13:08:06,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,338 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3023#true} {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #102#return; {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:08:06,338 INFO L272 TraceCheckUtils]: 38: Hoare triple {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3023#true} is VALID [2022-04-27 13:08:06,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {3023#true} ~cond := #in~cond; {3023#true} is VALID [2022-04-27 13:08:06,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {3023#true} assume !(0 == ~cond); {3023#true} is VALID [2022-04-27 13:08:06,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {3023#true} assume true; {3023#true} is VALID [2022-04-27 13:08:06,339 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3023#true} {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #104#return; {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:08:06,340 INFO L272 TraceCheckUtils]: 43: Hoare triple {3115#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3158#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:06,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {3158#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:06,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {3162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3024#false} is VALID [2022-04-27 13:08:06,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {3024#false} assume !false; {3024#false} is VALID [2022-04-27 13:08:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:08:06,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:08:06,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450880925] [2022-04-27 13:08:06,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567827238] [2022-04-27 13:08:06,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567827238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:08:06,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:08:06,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:08:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79790145] [2022-04-27 13:08:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:08:06,345 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 13:08:06,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:06,345 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:08:06,365 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-27 13:08:06,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:08:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:08:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:08:06,366 INFO L87 Difference]: Start difference. First operand 56 states and 69 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:08:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:06,590 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-27 13:08:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:08:06,591 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-27 13:08:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:06,592 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:08:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:08:06,601 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:08:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:08:06,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:08:06,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:06,664 INFO L225 Difference]: With dead ends: 79 [2022-04-27 13:08:06,664 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 13:08:06,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 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-27 13:08:06,665 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:06,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 152 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:08:06,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 13:08:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-04-27 13:08:06,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:06,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 74 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:06,792 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 74 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:06,792 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 74 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:06,795 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:08:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:08:06,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:06,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:06,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 77 states. [2022-04-27 13:08:06,796 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 77 states. [2022-04-27 13:08:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:06,798 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-27 13:08:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-04-27 13:08:06,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:06,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:06,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:06,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-04-27 13:08:06,800 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 47 [2022-04-27 13:08:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:06,800 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-04-27 13:08:06,800 INFO L496 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:08:06,801 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-04-27 13:08:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 13:08:06,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:06,801 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:06,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 13:08:07,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:07,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1952108775, now seen corresponding path program 1 times [2022-04-27 13:08:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:07,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975560529] [2022-04-27 13:08:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:07,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:07,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [447424510] [2022-04-27 13:08:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:07,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:07,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:07,047 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-27 13:08:07,053 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-27 13:08:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:07,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:08:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:07,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:07,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {3557#true} call ULTIMATE.init(); {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#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(11, 2);call #Ultimate.allocInit(12, 3); {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3557#true} {3557#true} #112#return; {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {3557#true} call #t~ret6 := main(); {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {3557#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {3557#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3557#true} {3557#true} #94#return; {3557#true} is VALID [2022-04-27 13:08:07,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3557#true} is VALID [2022-04-27 13:08:07,600 INFO L272 TraceCheckUtils]: 12: Hoare triple {3557#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {3557#true} ~cond := #in~cond; {3601#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:07,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {3601#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3605#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:07,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {3605#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3605#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:07,601 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3605#(not (= |assume_abort_if_not_#in~cond| 0))} {3557#true} #96#return; {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:07,601 INFO L272 TraceCheckUtils]: 17: Hoare triple {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,602 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3557#true} {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #98#return; {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:07,602 INFO L272 TraceCheckUtils]: 22: Hoare triple {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,602 INFO L290 TraceCheckUtils]: 25: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,603 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3557#true} {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #100#return; {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:07,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {3612#(and (<= 0 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3646#(and (<= main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,603 INFO L290 TraceCheckUtils]: 28: Hoare triple {3646#(and (<= main_~b~0 1) (<= 0 main_~b~0))} assume !false; {3646#(and (<= main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,604 INFO L290 TraceCheckUtils]: 29: Hoare triple {3646#(and (<= main_~b~0 1) (<= 0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3653#(and (<= main_~b~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,604 INFO L290 TraceCheckUtils]: 30: Hoare triple {3653#(and (<= main_~b~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {3653#(and (<= main_~b~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {3653#(and (<= main_~b~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,605 INFO L272 TraceCheckUtils]: 33: Hoare triple {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,606 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3557#true} {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #102#return; {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,606 INFO L272 TraceCheckUtils]: 38: Hoare triple {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,607 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3557#true} {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #104#return; {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,607 INFO L272 TraceCheckUtils]: 43: Hoare triple {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,608 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3557#true} {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #106#return; {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:07,609 INFO L272 TraceCheckUtils]: 48: Hoare triple {3660#(and (= main_~b~0 main_~v~0) (<= main_~b~0 1) (= main_~d~0 1) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {3712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:07,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {3712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:07,609 INFO L290 TraceCheckUtils]: 50: Hoare triple {3716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3558#false} is VALID [2022-04-27 13:08:07,609 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#false} assume !false; {3558#false} is VALID [2022-04-27 13:08:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 13:08:07,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:07,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {3558#false} assume !false; {3558#false} is VALID [2022-04-27 13:08:07,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {3716#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3558#false} is VALID [2022-04-27 13:08:07,843 INFO L290 TraceCheckUtils]: 49: Hoare triple {3712#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3716#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:07,843 INFO L272 TraceCheckUtils]: 48: Hoare triple {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {3712#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:07,844 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {3557#true} {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} #106#return; {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:07,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,844 INFO L290 TraceCheckUtils]: 45: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,844 INFO L272 TraceCheckUtils]: 43: Hoare triple {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,845 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3557#true} {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:07,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,845 INFO L290 TraceCheckUtils]: 39: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,845 INFO L272 TraceCheckUtils]: 38: Hoare triple {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,846 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3557#true} {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:07,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,846 INFO L272 TraceCheckUtils]: 33: Hoare triple {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !false; {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {3557#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3732#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {3557#true} assume !false; {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {3557#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {3557#true} assume !false; {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {3557#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3557#true} {3557#true} #100#return; {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L272 TraceCheckUtils]: 22: Hoare triple {3557#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3557#true} {3557#true} #98#return; {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L272 TraceCheckUtils]: 17: Hoare triple {3557#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3557#true} {3557#true} #96#return; {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,850 INFO L272 TraceCheckUtils]: 12: Hoare triple {3557#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3557#true} {3557#true} #94#return; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {3557#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {3557#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {3557#true} call #t~ret6 := main(); {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3557#true} {3557#true} #112#return; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#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(11, 2);call #Ultimate.allocInit(12, 3); {3557#true} is VALID [2022-04-27 13:08:07,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {3557#true} call ULTIMATE.init(); {3557#true} is VALID [2022-04-27 13:08:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 13:08:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975560529] [2022-04-27 13:08:07,852 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447424510] [2022-04-27 13:08:07,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447424510] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:08:07,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:08:07,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-27 13:08:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75736645] [2022-04-27 13:08:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:08:07,853 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-27 13:08:07,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:07,853 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:08:07,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:07,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:08:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:07,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:08:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:08:07,878 INFO L87 Difference]: Start difference. First operand 74 states and 97 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:08:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:08,110 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-04-27 13:08:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:08:08,111 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2022-04-27 13:08:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:08,111 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:08:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:08:08,112 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:08:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 13:08:08,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 13:08:08,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:08,164 INFO L225 Difference]: With dead ends: 81 [2022-04-27 13:08:08,164 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 13:08:08,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:08:08,165 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:08,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:08:08,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 13:08:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-27 13:08:08,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:08,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:08,263 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:08,264 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:08,266 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-04-27 13:08:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-04-27 13:08:08,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:08,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:08,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 79 states. [2022-04-27 13:08:08,266 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 79 states. [2022-04-27 13:08:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:08,268 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-04-27 13:08:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2022-04-27 13:08:08,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:08,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:08,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:08,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:08,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 13:08:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2022-04-27 13:08:08,271 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 52 [2022-04-27 13:08:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:08,271 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2022-04-27 13:08:08,271 INFO L496 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, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 13:08:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-27 13:08:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 13:08:08,271 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:08,271 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:08,289 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-27 13:08:08,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:08,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:08,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 188363668, now seen corresponding path program 1 times [2022-04-27 13:08:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:08,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984392050] [2022-04-27 13:08:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:08,520 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:08,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798808541] [2022-04-27 13:08:08,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:08,526 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-27 13:08:08,526 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-27 13:08:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:08,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 13:08:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:08,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:10,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#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(11, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4280#true} {4280#true} #112#return; {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {4280#true} call #t~ret6 := main(); {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {4280#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L272 TraceCheckUtils]: 6: Hoare triple {4280#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:10,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:10,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,226 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4280#true} {4280#true} #94#return; {4280#true} is VALID [2022-04-27 13:08:10,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {4280#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4280#true} is VALID [2022-04-27 13:08:10,226 INFO L272 TraceCheckUtils]: 12: Hoare triple {4280#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {4280#true} ~cond := #in~cond; {4324#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:10,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {4324#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:10,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {4328#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:10,227 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4328#(not (= |assume_abort_if_not_#in~cond| 0))} {4280#true} #96#return; {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:10,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:10,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:10,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,228 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4280#true} {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #98#return; {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:10,228 INFO L272 TraceCheckUtils]: 22: Hoare triple {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:10,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:10,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,228 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4280#true} {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #100#return; {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:10,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {4335#(and (<= 0 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4369#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {4369#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {4369#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {4369#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4376#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {4376#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {4376#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {4376#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,231 INFO L272 TraceCheckUtils]: 33: Hoare triple {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:10,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:10,231 INFO L290 TraceCheckUtils]: 36: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,232 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4280#true} {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} #102#return; {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,232 INFO L272 TraceCheckUtils]: 38: Hoare triple {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {4280#true} ~cond := #in~cond; {4408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:10,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {4408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:10,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:10,234 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} {4383#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} #104#return; {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,234 INFO L272 TraceCheckUtils]: 43: Hoare triple {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:10,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:10,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,235 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4280#true} {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} #106#return; {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,235 INFO L272 TraceCheckUtils]: 48: Hoare triple {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:10,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:10,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:10,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:10,237 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4280#true} {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} #108#return; {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {4419#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= main_~v~0 main_~b~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~c~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {4453#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {4453#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~d~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {4457#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {4457#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} assume !false; {4457#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {4457#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {4457#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} is VALID [2022-04-27 13:08:10,240 INFO L290 TraceCheckUtils]: 57: Hoare triple {4457#(and (= main_~r~0 0) (<= main_~b~0 main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 1) (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) (= main_~q~0 0) (<= main_~y~0 1) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4467#(and (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:10,240 INFO L290 TraceCheckUtils]: 58: Hoare triple {4467#(and (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (<= main_~y~0 1))} assume !false; {4467#(and (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:10,241 INFO L290 TraceCheckUtils]: 59: Hoare triple {4467#(and (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (<= main_~y~0 1))} assume !(0 != ~b~0); {4467#(and (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:10,242 INFO L272 TraceCheckUtils]: 60: Hoare triple {4467#(and (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {4477#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:10,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {4477#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4481#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:10,243 INFO L290 TraceCheckUtils]: 62: Hoare triple {4481#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4281#false} is VALID [2022-04-27 13:08:10,243 INFO L290 TraceCheckUtils]: 63: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-27 13:08:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 13:08:10,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:23,831 INFO L290 TraceCheckUtils]: 63: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-27 13:08:23,832 INFO L290 TraceCheckUtils]: 62: Hoare triple {4481#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4281#false} is VALID [2022-04-27 13:08:23,832 INFO L290 TraceCheckUtils]: 61: Hoare triple {4477#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4481#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:08:23,833 INFO L272 TraceCheckUtils]: 60: Hoare triple {4497#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {4477#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:08:23,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {4497#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {4497#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:23,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {4497#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {4497#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:24,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {4507#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4497#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:08:24,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {4507#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4507#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:24,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {4507#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {4507#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:24,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {4517#(= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {4507#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:24,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {4517#(= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:08:24,059 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4280#true} {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #108#return; {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:24,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:24,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:24,060 INFO L272 TraceCheckUtils]: 48: Hoare triple {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,061 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4280#true} {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #106#return; {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:24,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:24,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:24,061 INFO L272 TraceCheckUtils]: 43: Hoare triple {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,062 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {4521#(or (<= (* main_~v~0 2) main_~c~0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:24,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:24,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {4565#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:08:24,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {4280#true} ~cond := #in~cond; {4565#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:08:24,063 INFO L272 TraceCheckUtils]: 38: Hoare triple {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,064 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4280#true} {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:24,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:24,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:24,064 INFO L272 TraceCheckUtils]: 33: Hoare triple {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !false; {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:24,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {4590#(or (<= main_~b~0 (div main_~c~0 2)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4555#(or (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:08:24,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {4590#(or (<= main_~b~0 (div main_~c~0 2)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} assume !false; {4590#(or (<= main_~b~0 (div main_~c~0 2)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:08:24,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {4597#(or (not (<= main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 (div main_~a~0 2)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4590#(or (<= main_~b~0 (div main_~c~0 2)) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-27 13:08:24,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {4597#(or (not (<= main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 (div main_~a~0 2)))} assume !false; {4597#(or (not (<= main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 (div main_~a~0 2)))} is VALID [2022-04-27 13:08:24,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4597#(or (not (<= main_~b~0 main_~a~0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) main_~b~0 (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= main_~b~0 (div main_~a~0 2)))} is VALID [2022-04-27 13:08:24,069 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4280#true} {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} #100#return; {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} is VALID [2022-04-27 13:08:24,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:24,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:24,069 INFO L272 TraceCheckUtils]: 22: Hoare triple {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,069 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4280#true} {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} #98#return; {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} is VALID [2022-04-27 13:08:24,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:24,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:24,070 INFO L272 TraceCheckUtils]: 17: Hoare triple {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,070 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4328#(not (= |assume_abort_if_not_#in~cond| 0))} {4280#true} #96#return; {4604#(<= main_~y~0 (+ (div (+ (- 1) main_~y~0) 2) 1))} is VALID [2022-04-27 13:08:24,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {4328#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:24,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {4647#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:24,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {4280#true} ~cond := #in~cond; {4647#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:08:24,072 INFO L272 TraceCheckUtils]: 12: Hoare triple {4280#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {4280#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4280#true} {4280#true} #94#return; {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {4280#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {4280#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {4280#true} call #t~ret6 := main(); {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4280#true} {4280#true} #112#return; {4280#true} is VALID [2022-04-27 13:08:24,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-27 13:08:24,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#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(11, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-04-27 13:08:24,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4280#true} is VALID [2022-04-27 13:08:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 13:08:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:24,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984392050] [2022-04-27 13:08:24,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:24,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798808541] [2022-04-27 13:08:24,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798808541] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:24,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:24,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-04-27 13:08:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504425254] [2022-04-27 13:08:24,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:24,075 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 64 [2022-04-27 13:08:24,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:24,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:08:24,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:24,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 13:08:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:24,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 13:08:24,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:08:24,204 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:08:40,646 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-27 13:08:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:41,863 INFO L93 Difference]: Finished difference Result 280 states and 406 transitions. [2022-04-27 13:08:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-27 13:08:41,863 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 64 [2022-04-27 13:08:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:08:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 321 transitions. [2022-04-27 13:08:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:08:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 321 transitions. [2022-04-27 13:08:41,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 321 transitions. [2022-04-27 13:08:45,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 320 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:45,172 INFO L225 Difference]: With dead ends: 280 [2022-04-27 13:08:45,172 INFO L226 Difference]: Without dead ends: 243 [2022-04-27 13:08:45,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=533, Invalid=2659, Unknown=0, NotChecked=0, Total=3192 [2022-04-27 13:08:45,174 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 267 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 422 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:45,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 265 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1231 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-04-27 13:08:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-04-27 13:08:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 180. [2022-04-27 13:08:45,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:45,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 180 states, 108 states have (on average 1.25) internal successors, (135), 110 states have internal predecessors, (135), 61 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 13:08:45,684 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 180 states, 108 states have (on average 1.25) internal successors, (135), 110 states have internal predecessors, (135), 61 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 13:08:45,684 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 180 states, 108 states have (on average 1.25) internal successors, (135), 110 states have internal predecessors, (135), 61 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 13:08:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:45,691 INFO L93 Difference]: Finished difference Result 243 states and 354 transitions. [2022-04-27 13:08:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 354 transitions. [2022-04-27 13:08:45,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:45,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:45,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 108 states have (on average 1.25) internal successors, (135), 110 states have internal predecessors, (135), 61 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand 243 states. [2022-04-27 13:08:45,692 INFO L87 Difference]: Start difference. First operand has 180 states, 108 states have (on average 1.25) internal successors, (135), 110 states have internal predecessors, (135), 61 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand 243 states. [2022-04-27 13:08:45,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:45,699 INFO L93 Difference]: Finished difference Result 243 states and 354 transitions. [2022-04-27 13:08:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 354 transitions. [2022-04-27 13:08:45,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:45,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:45,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:45,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.25) internal successors, (135), 110 states have internal predecessors, (135), 61 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 13:08:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2022-04-27 13:08:45,704 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 64 [2022-04-27 13:08:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:45,704 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2022-04-27 13:08:45,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 21 states have internal predecessors, (49), 9 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2022-04-27 13:08:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2022-04-27 13:08:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 13:08:45,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:45,705 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:45,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:08:45,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 13:08:45,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1914971202, now seen corresponding path program 2 times [2022-04-27 13:08:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454433439] [2022-04-27 13:08:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:45,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:45,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820626295] [2022-04-27 13:08:45,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:08:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:45,939 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-27 13:08:45,942 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-27 13:08:45,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:08:45,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:08:45,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:08:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:45,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:46,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {5966#true} call ULTIMATE.init(); {5966#true} is VALID [2022-04-27 13:08:46,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {5966#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(11, 2);call #Ultimate.allocInit(12, 3); {5966#true} is VALID [2022-04-27 13:08:46,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5966#true} {5966#true} #112#return; {5966#true} is VALID [2022-04-27 13:08:46,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {5966#true} call #t~ret6 := main(); {5966#true} is VALID [2022-04-27 13:08:46,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {5966#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5966#true} is VALID [2022-04-27 13:08:46,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {5966#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5966#true} {5966#true} #94#return; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {5966#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L272 TraceCheckUtils]: 12: Hoare triple {5966#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5966#true} {5966#true} #96#return; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L272 TraceCheckUtils]: 17: Hoare triple {5966#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5966#true} {5966#true} #98#return; {5966#true} is VALID [2022-04-27 13:08:46,174 INFO L272 TraceCheckUtils]: 22: Hoare triple {5966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,175 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5966#true} {5966#true} #100#return; {5966#true} is VALID [2022-04-27 13:08:46,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {5966#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5966#true} is VALID [2022-04-27 13:08:46,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {5966#true} assume !false; {5966#true} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {5966#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5966#true} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {5966#true} assume !false; {5966#true} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {5966#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6064#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {6064#(<= main_~v~0 main_~b~0)} assume !false; {6064#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:46,190 INFO L272 TraceCheckUtils]: 33: Hoare triple {6064#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,191 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5966#true} {6064#(<= main_~v~0 main_~b~0)} #102#return; {6064#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:46,191 INFO L272 TraceCheckUtils]: 38: Hoare triple {6064#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5966#true} {6064#(<= main_~v~0 main_~b~0)} #104#return; {6064#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:46,192 INFO L272 TraceCheckUtils]: 43: Hoare triple {6064#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5966#true} {6064#(<= main_~v~0 main_~b~0)} #106#return; {6064#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:46,192 INFO L272 TraceCheckUtils]: 48: Hoare triple {6064#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,192 INFO L290 TraceCheckUtils]: 50: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,193 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5966#true} {6064#(<= main_~v~0 main_~b~0)} #108#return; {6064#(<= main_~v~0 main_~b~0)} is VALID [2022-04-27 13:08:46,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {6064#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {6131#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:46,194 INFO L290 TraceCheckUtils]: 54: Hoare triple {6131#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6135#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:46,194 INFO L290 TraceCheckUtils]: 55: Hoare triple {6135#(< main_~c~0 main_~b~0)} assume !false; {6135#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:46,194 INFO L290 TraceCheckUtils]: 56: Hoare triple {6135#(< main_~c~0 main_~b~0)} assume !(~c~0 >= ~b~0); {6135#(< main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:46,194 INFO L290 TraceCheckUtils]: 57: Hoare triple {6135#(< main_~c~0 main_~b~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6145#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:08:46,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {6145#(< main_~b~0 main_~a~0)} assume !false; {6145#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:08:46,195 INFO L290 TraceCheckUtils]: 59: Hoare triple {6145#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6152#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:08:46,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {6152#(< main_~b~0 main_~c~0)} assume !false; {6152#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {6152#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {5967#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 63: Hoare triple {5967#false} assume !false; {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 64: Hoare triple {5967#false} assume !(0 != ~b~0); {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L272 TraceCheckUtils]: 65: Hoare triple {5967#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {5967#false} ~cond := #in~cond; {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {5967#false} assume 0 == ~cond; {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {5967#false} assume !false; {5967#false} is VALID [2022-04-27 13:08:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:08:46,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:46,393 INFO L290 TraceCheckUtils]: 68: Hoare triple {5967#false} assume !false; {5967#false} is VALID [2022-04-27 13:08:46,393 INFO L290 TraceCheckUtils]: 67: Hoare triple {5967#false} assume 0 == ~cond; {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {5967#false} ~cond := #in~cond; {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L272 TraceCheckUtils]: 65: Hoare triple {5967#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {5967#false} assume !(0 != ~b~0); {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {5967#false} assume !false; {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {5967#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {6201#(<= main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {5967#false} is VALID [2022-04-27 13:08:46,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {6201#(<= main_~b~0 main_~c~0)} assume !false; {6201#(<= main_~b~0 main_~c~0)} is VALID [2022-04-27 13:08:46,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {6208#(<= main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6201#(<= main_~b~0 main_~c~0)} is VALID [2022-04-27 13:08:46,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {6208#(<= main_~b~0 main_~a~0)} assume !false; {6208#(<= main_~b~0 main_~a~0)} is VALID [2022-04-27 13:08:46,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {6215#(<= main_~c~0 main_~b~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6208#(<= main_~b~0 main_~a~0)} is VALID [2022-04-27 13:08:46,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {6215#(<= main_~c~0 main_~b~0)} assume !(~c~0 >= ~b~0); {6215#(<= main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:46,410 INFO L290 TraceCheckUtils]: 55: Hoare triple {6215#(<= main_~c~0 main_~b~0)} assume !false; {6215#(<= main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:46,410 INFO L290 TraceCheckUtils]: 54: Hoare triple {6225#(<= main_~c~0 (+ main_~b~0 main_~v~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {6215#(<= main_~c~0 main_~b~0)} is VALID [2022-04-27 13:08:46,414 INFO L290 TraceCheckUtils]: 53: Hoare triple {6229#(<= main_~v~0 (+ main_~b~0 1))} assume !(~c~0 >= 2 * ~v~0); {6225#(<= main_~c~0 (+ main_~b~0 main_~v~0))} is VALID [2022-04-27 13:08:46,415 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5966#true} {6229#(<= main_~v~0 (+ main_~b~0 1))} #108#return; {6229#(<= main_~v~0 (+ main_~b~0 1))} is VALID [2022-04-27 13:08:46,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,415 INFO L272 TraceCheckUtils]: 48: Hoare triple {6229#(<= main_~v~0 (+ main_~b~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5966#true} {6229#(<= main_~v~0 (+ main_~b~0 1))} #106#return; {6229#(<= main_~v~0 (+ main_~b~0 1))} is VALID [2022-04-27 13:08:46,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L272 TraceCheckUtils]: 43: Hoare triple {6229#(<= main_~v~0 (+ main_~b~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5966#true} {6229#(<= main_~v~0 (+ main_~b~0 1))} #104#return; {6229#(<= main_~v~0 (+ main_~b~0 1))} is VALID [2022-04-27 13:08:46,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,416 INFO L272 TraceCheckUtils]: 38: Hoare triple {6229#(<= main_~v~0 (+ main_~b~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,417 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5966#true} {6229#(<= main_~v~0 (+ main_~b~0 1))} #102#return; {6229#(<= main_~v~0 (+ main_~b~0 1))} is VALID [2022-04-27 13:08:46,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,417 INFO L272 TraceCheckUtils]: 33: Hoare triple {6229#(<= main_~v~0 (+ main_~b~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {6229#(<= main_~v~0 (+ main_~b~0 1))} assume !false; {6229#(<= main_~v~0 (+ main_~b~0 1))} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {5966#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6229#(<= main_~v~0 (+ main_~b~0 1))} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {5966#true} assume !false; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 29: Hoare triple {5966#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {5966#true} assume !false; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {5966#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5966#true} {5966#true} #100#return; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L272 TraceCheckUtils]: 22: Hoare triple {5966#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5966#true} {5966#true} #98#return; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L272 TraceCheckUtils]: 17: Hoare triple {5966#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5966#true} {5966#true} #96#return; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {5966#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {5966#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5966#true} {5966#true} #94#return; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {5966#true} assume !(0 == ~cond); {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {5966#true} ~cond := #in~cond; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {5966#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {5966#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {5966#true} call #t~ret6 := main(); {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5966#true} {5966#true} #112#return; {5966#true} is VALID [2022-04-27 13:08:46,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {5966#true} assume true; {5966#true} is VALID [2022-04-27 13:08:46,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5966#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(11, 2);call #Ultimate.allocInit(12, 3); {5966#true} is VALID [2022-04-27 13:08:46,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {5966#true} call ULTIMATE.init(); {5966#true} is VALID [2022-04-27 13:08:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 13:08:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454433439] [2022-04-27 13:08:46,420 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:46,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820626295] [2022-04-27 13:08:46,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820626295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:46,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:46,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 13:08:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210701252] [2022-04-27 13:08:46,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 69 [2022-04-27 13:08:46,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:46,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:46,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:46,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:08:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:08:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:08:46,485 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:47,565 INFO L93 Difference]: Finished difference Result 286 states and 399 transitions. [2022-04-27 13:08:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 13:08:47,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 69 [2022-04-27 13:08:47,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-04-27 13:08:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 146 transitions. [2022-04-27 13:08:47,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 146 transitions. [2022-04-27 13:08:47,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:47,705 INFO L225 Difference]: With dead ends: 286 [2022-04-27 13:08:47,705 INFO L226 Difference]: Without dead ends: 191 [2022-04-27 13:08:47,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:08:47,706 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:47,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 267 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 13:08:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-27 13:08:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2022-04-27 13:08:48,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:48,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 174 states, 105 states have (on average 1.180952380952381) internal successors, (124), 106 states have internal predecessors, (124), 59 states have call successors, (59), 10 states have call predecessors, (59), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 13:08:48,068 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 174 states, 105 states have (on average 1.180952380952381) internal successors, (124), 106 states have internal predecessors, (124), 59 states have call successors, (59), 10 states have call predecessors, (59), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 13:08:48,069 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 174 states, 105 states have (on average 1.180952380952381) internal successors, (124), 106 states have internal predecessors, (124), 59 states have call successors, (59), 10 states have call predecessors, (59), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 13:08:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:48,073 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2022-04-27 13:08:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2022-04-27 13:08:48,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:48,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:48,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 105 states have (on average 1.180952380952381) internal successors, (124), 106 states have internal predecessors, (124), 59 states have call successors, (59), 10 states have call predecessors, (59), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand 191 states. [2022-04-27 13:08:48,074 INFO L87 Difference]: Start difference. First operand has 174 states, 105 states have (on average 1.180952380952381) internal successors, (124), 106 states have internal predecessors, (124), 59 states have call successors, (59), 10 states have call predecessors, (59), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand 191 states. [2022-04-27 13:08:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:48,078 INFO L93 Difference]: Finished difference Result 191 states and 262 transitions. [2022-04-27 13:08:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2022-04-27 13:08:48,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:48,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:48,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:48,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 105 states have (on average 1.180952380952381) internal successors, (124), 106 states have internal predecessors, (124), 59 states have call successors, (59), 10 states have call predecessors, (59), 9 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 13:08:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 240 transitions. [2022-04-27 13:08:48,083 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 240 transitions. Word has length 69 [2022-04-27 13:08:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:48,083 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 240 transitions. [2022-04-27 13:08:48,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-27 13:08:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 240 transitions. [2022-04-27 13:08:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-27 13:08:48,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:48,084 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:48,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:08:48,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 13:08:48,300 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1205081507, now seen corresponding path program 1 times [2022-04-27 13:08:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:48,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041683631] [2022-04-27 13:08:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:48,318 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:48,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161760920] [2022-04-27 13:08:48,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:48,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:48,322 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-27 13:08:48,323 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-27 13:08:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:48,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 13:08:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:48,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:48,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {7518#true} call ULTIMATE.init(); {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {7518#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(11, 2);call #Ultimate.allocInit(12, 3); {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7518#true} {7518#true} #112#return; {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {7518#true} call #t~ret6 := main(); {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {7518#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {7518#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,700 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7518#true} {7518#true} #94#return; {7518#true} is VALID [2022-04-27 13:08:48,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {7518#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7518#true} is VALID [2022-04-27 13:08:48,700 INFO L272 TraceCheckUtils]: 12: Hoare triple {7518#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {7518#true} ~cond := #in~cond; {7562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:48,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {7562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:48,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {7566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:48,701 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7566#(not (= |assume_abort_if_not_#in~cond| 0))} {7518#true} #96#return; {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:48,701 INFO L272 TraceCheckUtils]: 17: Hoare triple {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,702 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7518#true} {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #98#return; {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:48,702 INFO L272 TraceCheckUtils]: 22: Hoare triple {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,703 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7518#true} {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} #100#return; {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 13:08:48,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {7573#(and (<= 0 main_~y~0) (<= main_~y~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:48,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {7607#(<= main_~b~0 1)} assume !false; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:48,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {7607#(<= main_~b~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:48,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {7607#(<= main_~b~0 1)} assume !false; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:48,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {7607#(<= main_~b~0 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:48,705 INFO L290 TraceCheckUtils]: 32: Hoare triple {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} assume !false; {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:48,705 INFO L272 TraceCheckUtils]: 33: Hoare triple {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,705 INFO L290 TraceCheckUtils]: 36: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,706 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7518#true} {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} #102#return; {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:48,706 INFO L272 TraceCheckUtils]: 38: Hoare triple {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,706 INFO L290 TraceCheckUtils]: 39: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,706 INFO L290 TraceCheckUtils]: 40: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,706 INFO L290 TraceCheckUtils]: 41: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,707 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7518#true} {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} #104#return; {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:48,707 INFO L272 TraceCheckUtils]: 43: Hoare triple {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,707 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7518#true} {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} #106#return; {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:48,707 INFO L272 TraceCheckUtils]: 48: Hoare triple {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:48,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:48,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:48,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:48,708 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7518#true} {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} #108#return; {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:48,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {7620#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0))} assume !(~c~0 >= 2 * ~v~0); {7687#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:48,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {7687#(and (<= main_~v~0 1) (<= main_~v~0 main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 13:08:48,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} assume !false; {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 13:08:48,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} assume !(~c~0 >= ~b~0); {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 13:08:48,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} assume !false; {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 59: Hoare triple {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7519#false} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 60: Hoare triple {7519#false} assume !false; {7519#false} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 61: Hoare triple {7519#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7519#false} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 62: Hoare triple {7519#false} assume !false; {7519#false} is VALID [2022-04-27 13:08:48,711 INFO L272 TraceCheckUtils]: 63: Hoare triple {7519#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7519#false} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 64: Hoare triple {7519#false} ~cond := #in~cond; {7519#false} is VALID [2022-04-27 13:08:48,711 INFO L290 TraceCheckUtils]: 65: Hoare triple {7519#false} assume !(0 == ~cond); {7519#false} is VALID [2022-04-27 13:08:48,712 INFO L290 TraceCheckUtils]: 66: Hoare triple {7519#false} assume true; {7519#false} is VALID [2022-04-27 13:08:48,712 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7519#false} {7519#false} #102#return; {7519#false} is VALID [2022-04-27 13:08:48,712 INFO L272 TraceCheckUtils]: 68: Hoare triple {7519#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7519#false} is VALID [2022-04-27 13:08:48,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {7519#false} ~cond := #in~cond; {7519#false} is VALID [2022-04-27 13:08:48,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {7519#false} assume 0 == ~cond; {7519#false} is VALID [2022-04-27 13:08:48,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {7519#false} assume !false; {7519#false} is VALID [2022-04-27 13:08:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-27 13:08:48,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:49,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {7519#false} assume !false; {7519#false} is VALID [2022-04-27 13:08:49,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {7519#false} assume 0 == ~cond; {7519#false} is VALID [2022-04-27 13:08:49,178 INFO L290 TraceCheckUtils]: 69: Hoare triple {7519#false} ~cond := #in~cond; {7519#false} is VALID [2022-04-27 13:08:49,178 INFO L272 TraceCheckUtils]: 68: Hoare triple {7519#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7519#false} is VALID [2022-04-27 13:08:49,178 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7518#true} {7519#false} #102#return; {7519#false} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 66: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 65: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,179 INFO L272 TraceCheckUtils]: 63: Hoare triple {7519#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {7519#false} assume !false; {7519#false} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {7519#false} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7519#false} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 60: Hoare triple {7519#false} assume !false; {7519#false} is VALID [2022-04-27 13:08:49,179 INFO L290 TraceCheckUtils]: 59: Hoare triple {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7519#false} is VALID [2022-04-27 13:08:49,180 INFO L290 TraceCheckUtils]: 58: Hoare triple {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} assume !false; {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:49,180 INFO L290 TraceCheckUtils]: 57: Hoare triple {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7701#(and (< main_~b~0 1) (<= 0 main_~b~0))} is VALID [2022-04-27 13:08:49,180 INFO L290 TraceCheckUtils]: 56: Hoare triple {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} assume !(~c~0 >= ~b~0); {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 13:08:49,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} assume !false; {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 13:08:49,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {7795#(and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {7691#(and (< main_~c~0 1) (<= 0 main_~c~0))} is VALID [2022-04-27 13:08:49,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} assume !(~c~0 >= 2 * ~v~0); {7795#(and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0))} is VALID [2022-04-27 13:08:49,182 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7518#true} {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} #108#return; {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} is VALID [2022-04-27 13:08:49,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,182 INFO L272 TraceCheckUtils]: 48: Hoare triple {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,183 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7518#true} {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} #106#return; {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} is VALID [2022-04-27 13:08:49,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,183 INFO L272 TraceCheckUtils]: 43: Hoare triple {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,183 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7518#true} {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} #104#return; {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} is VALID [2022-04-27 13:08:49,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L272 TraceCheckUtils]: 38: Hoare triple {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7518#true} {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} #102#return; {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} is VALID [2022-04-27 13:08:49,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,184 INFO L272 TraceCheckUtils]: 33: Hoare triple {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} assume !false; {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} is VALID [2022-04-27 13:08:49,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {7607#(<= main_~b~0 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7799#(or (<= (* main_~v~0 2) main_~c~0) (and (< main_~c~0 (+ main_~v~0 1)) (<= main_~v~0 main_~c~0)))} is VALID [2022-04-27 13:08:49,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {7607#(<= main_~b~0 1)} assume !false; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:49,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {7607#(<= main_~b~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:49,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {7607#(<= main_~b~0 1)} assume !false; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:49,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {7878#(<= main_~y~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7607#(<= main_~b~0 1)} is VALID [2022-04-27 13:08:49,187 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7518#true} {7878#(<= main_~y~0 1)} #100#return; {7878#(<= main_~y~0 1)} is VALID [2022-04-27 13:08:49,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L272 TraceCheckUtils]: 22: Hoare triple {7878#(<= main_~y~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7518#true} {7878#(<= main_~y~0 1)} #98#return; {7878#(<= main_~y~0 1)} is VALID [2022-04-27 13:08:49,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,187 INFO L272 TraceCheckUtils]: 17: Hoare triple {7878#(<= main_~y~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,188 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7566#(not (= |assume_abort_if_not_#in~cond| 0))} {7518#true} #96#return; {7878#(<= main_~y~0 1)} is VALID [2022-04-27 13:08:49,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {7566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:49,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {7566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:49,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {7518#true} ~cond := #in~cond; {7921#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:08:49,189 INFO L272 TraceCheckUtils]: 12: Hoare triple {7518#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {7518#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7518#true} {7518#true} #94#return; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {7518#true} assume !(0 == ~cond); {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {7518#true} ~cond := #in~cond; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {7518#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {7518#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {7518#true} call #t~ret6 := main(); {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7518#true} {7518#true} #112#return; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {7518#true} assume true; {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {7518#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(11, 2);call #Ultimate.allocInit(12, 3); {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {7518#true} call ULTIMATE.init(); {7518#true} is VALID [2022-04-27 13:08:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-27 13:08:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:49,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041683631] [2022-04-27 13:08:49,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:49,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161760920] [2022-04-27 13:08:49,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161760920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:49,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:49,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-27 13:08:49,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019289359] [2022-04-27 13:08:49,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:49,191 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 72 [2022-04-27 13:08:49,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:49,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:08:49,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:49,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:08:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:08:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:08:49,243 INFO L87 Difference]: Start difference. First operand 174 states and 240 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:08:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:50,173 INFO L93 Difference]: Finished difference Result 242 states and 333 transitions. [2022-04-27 13:08:50,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:08:50,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 72 [2022-04-27 13:08:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:08:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-27 13:08:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:08:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2022-04-27 13:08:50,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 106 transitions. [2022-04-27 13:08:50,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:50,258 INFO L225 Difference]: With dead ends: 242 [2022-04-27 13:08:50,258 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 13:08:50,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:08:50,259 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:50,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 252 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:08:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 13:08:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2022-04-27 13:08:50,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:50,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 132 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 43 states have call successors, (43), 9 states have call predecessors, (43), 8 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:08:50,584 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 132 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 43 states have call successors, (43), 9 states have call predecessors, (43), 8 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:08:50,584 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 132 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 43 states have call successors, (43), 9 states have call predecessors, (43), 8 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:08:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:50,586 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2022-04-27 13:08:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2022-04-27 13:08:50,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:50,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:50,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 43 states have call successors, (43), 9 states have call predecessors, (43), 8 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 133 states. [2022-04-27 13:08:50,587 INFO L87 Difference]: Start difference. First operand has 132 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 43 states have call successors, (43), 9 states have call predecessors, (43), 8 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand 133 states. [2022-04-27 13:08:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:50,590 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2022-04-27 13:08:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2022-04-27 13:08:50,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:50,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:50,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:50,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 80 states have (on average 1.1625) internal successors, (93), 81 states have internal predecessors, (93), 43 states have call successors, (43), 9 states have call predecessors, (43), 8 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 13:08:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2022-04-27 13:08:50,594 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 72 [2022-04-27 13:08:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:50,594 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2022-04-27 13:08:50,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 6 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2022-04-27 13:08:50,594 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-27 13:08:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 13:08:50,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:08:50,595 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:50,621 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-27 13:08:50,822 WARN L477 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-27 13:08:50,823 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:08:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:08:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1679616651, now seen corresponding path program 1 times [2022-04-27 13:08:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:08:50,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281203292] [2022-04-27 13:08:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:08:50,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:08:50,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144886034] [2022-04-27 13:08:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:08:50,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:08:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:08:50,844 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-27 13:08:50,845 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-27 13:08:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:50,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:08:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:08:50,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:08:54,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {8829#true} call ULTIMATE.init(); {8829#true} is VALID [2022-04-27 13:08:54,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {8829#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(11, 2);call #Ultimate.allocInit(12, 3); {8829#true} is VALID [2022-04-27 13:08:54,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8829#true} {8829#true} #112#return; {8829#true} is VALID [2022-04-27 13:08:54,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {8829#true} call #t~ret6 := main(); {8829#true} is VALID [2022-04-27 13:08:54,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {8829#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8829#true} is VALID [2022-04-27 13:08:54,357 INFO L272 TraceCheckUtils]: 6: Hoare triple {8829#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {8829#true} ~cond := #in~cond; {8855#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:08:54,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {8855#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8859#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:54,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {8859#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8859#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:54,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8859#(not (= |assume_abort_if_not_#in~cond| 0))} {8829#true} #94#return; {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:08:54,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:08:54,359 INFO L272 TraceCheckUtils]: 12: Hoare triple {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,360 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8829#true} {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #96#return; {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:08:54,360 INFO L272 TraceCheckUtils]: 17: Hoare triple {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,360 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8829#true} {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #98#return; {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:08:54,361 INFO L272 TraceCheckUtils]: 22: Hoare triple {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,361 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8829#true} {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} #100#return; {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 13:08:54,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {8866#(and (<= 0 main_~x~0) (<= main_~x~0 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8918#(<= main_~a~0 1)} is VALID [2022-04-27 13:08:54,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {8918#(<= main_~a~0 1)} assume !false; {8918#(<= main_~a~0 1)} is VALID [2022-04-27 13:08:54,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {8918#(<= main_~a~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {8925#(<= main_~c~0 1)} is VALID [2022-04-27 13:08:54,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {8925#(<= main_~c~0 1)} assume !false; {8925#(<= main_~c~0 1)} is VALID [2022-04-27 13:08:54,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {8925#(<= main_~c~0 1)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} assume !false; {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,363 INFO L272 TraceCheckUtils]: 33: Hoare triple {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,363 INFO L290 TraceCheckUtils]: 34: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,364 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8829#true} {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} #102#return; {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,364 INFO L272 TraceCheckUtils]: 38: Hoare triple {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,365 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8829#true} {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} #104#return; {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,365 INFO L272 TraceCheckUtils]: 43: Hoare triple {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,365 INFO L290 TraceCheckUtils]: 46: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,365 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8829#true} {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} #106#return; {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,365 INFO L272 TraceCheckUtils]: 48: Hoare triple {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,366 INFO L290 TraceCheckUtils]: 50: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,366 INFO L290 TraceCheckUtils]: 51: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,366 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8829#true} {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} #108#return; {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,367 INFO L290 TraceCheckUtils]: 53: Hoare triple {8932#(and (<= main_~b~0 main_~v~0) (<= main_~c~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} assume !false; {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,368 INFO L272 TraceCheckUtils]: 55: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,369 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8829#true} {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} #102#return; {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,369 INFO L272 TraceCheckUtils]: 60: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8829#true} {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} #104#return; {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,370 INFO L272 TraceCheckUtils]: 65: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8829#true} {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} #106#return; {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,370 INFO L272 TraceCheckUtils]: 70: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L290 TraceCheckUtils]: 71: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:54,370 INFO L290 TraceCheckUtils]: 72: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:54,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:54,371 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8829#true} {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} #108#return; {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} assume !(~c~0 >= 2 * ~v~0); {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} is VALID [2022-04-27 13:08:54,372 INFO L290 TraceCheckUtils]: 76: Hoare triple {8999#(and (<= (div (- main_~v~0) (- 2)) (div main_~c~0 2)) (<= main_~b~0 (div main_~c~0 2)) (<= main_~c~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {9069#(and (<= (div main_~c~0 (- 2)) 0) (<= main_~b~0 0))} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {9069#(and (<= (div main_~c~0 (- 2)) 0) (<= main_~b~0 0))} assume !false; {9069#(and (<= (div main_~c~0 (- 2)) 0) (<= main_~b~0 0))} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 78: Hoare triple {9069#(and (<= (div main_~c~0 (- 2)) 0) (<= main_~b~0 0))} assume !(~c~0 >= ~b~0); {8830#false} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8830#false} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 80: Hoare triple {8830#false} assume !false; {8830#false} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {8830#false} assume !(0 != ~b~0); {8830#false} is VALID [2022-04-27 13:08:54,373 INFO L272 TraceCheckUtils]: 82: Hoare triple {8830#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8830#false} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {8830#false} ~cond := #in~cond; {8830#false} is VALID [2022-04-27 13:08:54,373 INFO L290 TraceCheckUtils]: 84: Hoare triple {8830#false} assume 0 == ~cond; {8830#false} is VALID [2022-04-27 13:08:54,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {8830#false} assume !false; {8830#false} is VALID [2022-04-27 13:08:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-27 13:08:54,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:08:55,089 INFO L290 TraceCheckUtils]: 85: Hoare triple {8830#false} assume !false; {8830#false} is VALID [2022-04-27 13:08:55,089 INFO L290 TraceCheckUtils]: 84: Hoare triple {8830#false} assume 0 == ~cond; {8830#false} is VALID [2022-04-27 13:08:55,089 INFO L290 TraceCheckUtils]: 83: Hoare triple {8830#false} ~cond := #in~cond; {8830#false} is VALID [2022-04-27 13:08:55,089 INFO L272 TraceCheckUtils]: 82: Hoare triple {8830#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {8830#false} is VALID [2022-04-27 13:08:55,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {8830#false} assume !(0 != ~b~0); {8830#false} is VALID [2022-04-27 13:08:55,089 INFO L290 TraceCheckUtils]: 80: Hoare triple {8830#false} assume !false; {8830#false} is VALID [2022-04-27 13:08:55,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8830#false} is VALID [2022-04-27 13:08:55,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {9118#(<= main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {8830#false} is VALID [2022-04-27 13:08:55,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {9118#(<= main_~b~0 main_~c~0)} assume !false; {9118#(<= main_~b~0 main_~c~0)} is VALID [2022-04-27 13:08:55,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {9118#(<= main_~b~0 main_~c~0)} is VALID [2022-04-27 13:08:55,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !(~c~0 >= 2 * ~v~0); {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,091 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8829#true} {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #108#return; {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,091 INFO L290 TraceCheckUtils]: 73: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L290 TraceCheckUtils]: 71: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L272 TraceCheckUtils]: 70: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8829#true} {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #106#return; {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,092 INFO L290 TraceCheckUtils]: 68: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L290 TraceCheckUtils]: 67: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,092 INFO L272 TraceCheckUtils]: 65: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,093 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8829#true} {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #104#return; {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,093 INFO L272 TraceCheckUtils]: 60: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,094 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8829#true} {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} #102#return; {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,094 INFO L272 TraceCheckUtils]: 55: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} assume !false; {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {9125#(<= (+ main_~b~0 main_~v~0) main_~c~0)} is VALID [2022-04-27 13:08:55,095 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8829#true} {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} #108#return; {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:55,096 INFO L290 TraceCheckUtils]: 51: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L272 TraceCheckUtils]: 48: Hoare triple {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8829#true} {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} #106#return; {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:55,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,096 INFO L272 TraceCheckUtils]: 43: Hoare triple {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,097 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8829#true} {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} #104#return; {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:55,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,097 INFO L272 TraceCheckUtils]: 38: Hoare triple {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,098 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8829#true} {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} #102#return; {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:55,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,098 INFO L272 TraceCheckUtils]: 33: Hoare triple {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} assume !false; {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:55,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {9262#(<= (div main_~c~0 2) (+ (div (+ (- 2) (* (- 1) (div main_~c~0 2)) main_~c~0) 2) 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9195#(or (<= (+ (* main_~v~0 2) main_~b~0) main_~c~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-27 13:08:55,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {9262#(<= (div main_~c~0 2) (+ (div (+ (- 2) (* (- 1) (div main_~c~0 2)) main_~c~0) 2) 1))} assume !false; {9262#(<= (div main_~c~0 2) (+ (div (+ (- 2) (* (- 1) (div main_~c~0 2)) main_~c~0) 2) 1))} is VALID [2022-04-27 13:08:55,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {8918#(<= main_~a~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9262#(<= (div main_~c~0 2) (+ (div (+ (- 2) (* (- 1) (div main_~c~0 2)) main_~c~0) 2) 1))} is VALID [2022-04-27 13:08:55,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {8918#(<= main_~a~0 1)} assume !false; {8918#(<= main_~a~0 1)} is VALID [2022-04-27 13:08:55,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {9275#(<= main_~x~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {8918#(<= main_~a~0 1)} is VALID [2022-04-27 13:08:55,101 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8829#true} {9275#(<= main_~x~0 1)} #100#return; {9275#(<= main_~x~0 1)} is VALID [2022-04-27 13:08:55,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,102 INFO L272 TraceCheckUtils]: 22: Hoare triple {9275#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,102 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8829#true} {9275#(<= main_~x~0 1)} #98#return; {9275#(<= main_~x~0 1)} is VALID [2022-04-27 13:08:55,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,102 INFO L272 TraceCheckUtils]: 17: Hoare triple {9275#(<= main_~x~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,103 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8829#true} {9275#(<= main_~x~0 1)} #96#return; {9275#(<= main_~x~0 1)} is VALID [2022-04-27 13:08:55,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {8829#true} assume !(0 == ~cond); {8829#true} is VALID [2022-04-27 13:08:55,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {8829#true} ~cond := #in~cond; {8829#true} is VALID [2022-04-27 13:08:55,103 INFO L272 TraceCheckUtils]: 12: Hoare triple {9275#(<= main_~x~0 1)} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {9275#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9275#(<= main_~x~0 1)} is VALID [2022-04-27 13:08:55,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8859#(not (= |assume_abort_if_not_#in~cond| 0))} {8829#true} #94#return; {9275#(<= main_~x~0 1)} is VALID [2022-04-27 13:08:55,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {8859#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8859#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:55,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {9336#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {8859#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:08:55,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {8829#true} ~cond := #in~cond; {9336#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:08:55,105 INFO L272 TraceCheckUtils]: 6: Hoare triple {8829#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 1 then 1 else 0)); {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {8829#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {8829#true} call #t~ret6 := main(); {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8829#true} {8829#true} #112#return; {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {8829#true} assume true; {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {8829#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(11, 2);call #Ultimate.allocInit(12, 3); {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {8829#true} call ULTIMATE.init(); {8829#true} is VALID [2022-04-27 13:08:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-27 13:08:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:08:55,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281203292] [2022-04-27 13:08:55,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:08:55,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144886034] [2022-04-27 13:08:55,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144886034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:08:55,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:08:55,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 13:08:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043438556] [2022-04-27 13:08:55,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:08:55,106 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 86 [2022-04-27 13:08:55,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:08:55,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:08:55,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:08:55,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 13:08:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:08:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 13:08:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:08:55,184 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:08:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:55,899 INFO L93 Difference]: Finished difference Result 144 states and 186 transitions. [2022-04-27 13:08:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:08:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 86 [2022-04-27 13:08:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:08:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:08:55,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-27 13:08:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:08:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2022-04-27 13:08:55,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 72 transitions. [2022-04-27 13:08:55,966 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-27 13:08:55,966 INFO L225 Difference]: With dead ends: 144 [2022-04-27 13:08:55,966 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 13:08:55,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:08:55,967 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:08:55,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 202 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:08:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 13:08:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 13:08:55,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:08:55,968 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-27 13:08:55,968 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-27 13:08:55,968 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-27 13:08:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:55,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:08:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:08:55,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:55,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:55,969 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-27 13:08:55,969 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-27 13:08:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:08:55,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 13:08:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:08:55,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:55,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:08:55,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:08:55,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:08:55,969 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-27 13:08:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 13:08:55,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2022-04-27 13:08:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:08:55,970 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 13:08:55,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2022-04-27 13:08:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 13:08:55,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:08:55,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:08:55,998 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-27 13:08:56,177 WARN L477 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-27 13:08:56,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 13:08:57,404 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 13:08:57,404 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 73) the Hoare annotation is: (let ((.cse0 (<= main_~y~0 1))) (or (and (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~x~0 1) (<= 1 main_~a~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) .cse0 (= main_~p~0 1)) (and (< main_~b~0 1) (= main_~p~0 0) (< (div main_~x~0 2) main_~a~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (<= main_~a~0 main_~x~0) (<= main_~b~0 main_~c~0) (<= 0 main_~b~0) (= main_~q~0 1) (<= main_~c~0 main_~b~0) (= (+ main_~s~0 1) 0) .cse0))) [2022-04-27 13:08:57,405 INFO L895 garLoopResultBuilder]: At program point L35-3(lines 35 73) the Hoare annotation is: (and (<= 1 main_~x~0) (= main_~b~0 0) (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= main_~b~0 main_~c~0) (<= 1 main_~y~0) (<= main_~y~0 1)) [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 76) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= main_~k~0 0) (<= main_~v~0 main_~c~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (<= main_~b~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~c~0 1) (= main_~c~0 main_~x~0) (= main_~p~0 1)) [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 1)) [2022-04-27 13:08:57,405 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point L53(lines 49 59) no Hoare annotation was computed. [2022-04-27 13:08:57,405 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 59) the Hoare annotation is: (and (= main_~k~0 0) (<= main_~v~0 main_~c~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (<= main_~b~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~c~0 1) (= main_~c~0 main_~x~0) (= main_~p~0 1)) [2022-04-27 13:08:57,405 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 59) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~x~0 1) (<= main_~y~0 1)) [2022-04-27 13:08:57,406 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (= main_~k~0 0) (<= main_~v~0 main_~c~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (<= main_~b~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~c~0 1) (= main_~c~0 main_~x~0) (= main_~p~0 1)) [2022-04-27 13:08:57,406 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (= main_~k~0 0) (<= main_~v~0 main_~c~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (<= main_~b~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~c~0 1) (= main_~c~0 main_~x~0) (= main_~p~0 1)) [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 76) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 62) the Hoare annotation is: (let ((.cse0 (= main_~s~0 1)) (.cse1 (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (.cse2 (<= 1 main_~a~0)) (.cse3 (= main_~b~0 main_~y~0)) (.cse4 (= main_~q~0 0)) (.cse5 (= main_~a~0 main_~x~0)) (.cse6 (<= main_~y~0 1)) (.cse7 (= main_~p~0 1))) (or (and (= main_~v~0 (* main_~d~0 main_~b~0)) (<= main_~v~0 main_~b~0) (< main_~c~0 (* main_~v~0 2)) .cse0 .cse1 .cse2 (<= 0 main_~c~0) .cse3 (= main_~k~0 1) (< (div main_~x~0 2) main_~b~0) .cse4 (< main_~c~0 main_~b~0) .cse5 .cse6 .cse7) (and (= main_~k~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 main_~y~0) .cse5 (<= main_~c~0 1) (= main_~c~0 main_~x~0) .cse6 .cse7))) [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point L42-3(lines 42 62) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 18 76) the Hoare annotation is: true [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (and (= main_~k~0 0) (<= main_~v~0 main_~c~0) (= main_~s~0 1) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~b~0 main_~y~0) (<= main_~b~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~c~0 1) (= main_~c~0 main_~x~0) (= main_~p~0 1)) [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 44) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:08:57,406 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 13:08:57,407 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 13:08:57,407 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 13:08:57,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 13:08:57,407 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-27 13:08:57,407 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-27 13:08:57,407 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-27 13:08:57,407 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-27 13:08:57,407 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-27 13:08:57,407 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-27 13:08:57,409 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:08:57,410 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:08:57,412 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:08:57,412 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:08:57,413 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 13:08:57,414 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 13:08:57,419 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:08:57,419 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-04-27 13:08:57,419 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-04-27 13:08:57,419 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-04-27 13:08:57,420 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:08:57,420 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-04-27 13:08:57,420 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 13:08:57,421 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 13:08:57,421 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:08:57,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:08:57 BoogieIcfgContainer [2022-04-27 13:08:57,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:08:57,429 INFO L158 Benchmark]: Toolchain (without parser) took 100264.05ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 92.4MB in the end (delta: 49.0MB). Peak memory consumption was 109.6MB. Max. memory is 8.0GB. [2022-04-27 13:08:57,429 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 158.0MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:08:57,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.27ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 141.3MB in the beginning and 206.2MB in the end (delta: -64.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-27 13:08:57,430 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 231.7MB. Free memory was 206.2MB in the beginning and 204.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:08:57,430 INFO L158 Benchmark]: RCFGBuilder took 390.59ms. Allocated memory is still 231.7MB. Free memory was 204.5MB in the beginning and 191.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:08:57,430 INFO L158 Benchmark]: TraceAbstraction took 99583.46ms. Allocated memory is still 231.7MB. Free memory was 190.8MB in the beginning and 92.4MB in the end (delta: 98.4MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2022-04-27 13:08:57,431 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 158.1MB in the beginning and 158.0MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.27ms. Allocated memory was 192.9MB in the beginning and 231.7MB in the end (delta: 38.8MB). Free memory was 141.3MB in the beginning and 206.2MB in the end (delta: -64.9MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 231.7MB. Free memory was 206.2MB in the beginning and 204.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 390.59ms. Allocated memory is still 231.7MB. Free memory was 204.5MB in the beginning and 191.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 99583.46ms. Allocated memory is still 231.7MB. Free memory was 190.8MB in the beginning and 92.4MB in the end (delta: 98.4MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 99.5s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 643 mSDsluCounter, 2287 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1761 mSDsCounter, 720 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2694 IncrementalHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 720 mSolverCounterUnsat, 526 mSDtfsCounter, 2694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 935 SyntacticMatches, 7 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=9, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 131 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 151 PreInvPairs, 170 NumberOfFragments, 489 HoareAnnotationTreeSize, 151 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2652 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 65.0s InterpolantComputationTime, 617 NumberOfCodeBlocks, 617 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 3872 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1688 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 968/1098 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((k == 0 && v <= c) && s == 1) && a == y * r + p * x) && b == y) && b <= v) && d == 1) && q == 0) && 1 <= y) && a == x) && c <= 1) && c == x) && p == 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((s == 1 && a == y * r + p * x) && x <= 1) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && y <= 1) && p == 1) || (((((((((((b < 1 && p == 0) && x / 2 < a) && r == 1) && a == y) && a <= x) && b <= c) && 0 <= b) && q == 1) && c <= b) && s + 1 == 0) && y <= 1) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: ((((((((((((((v == d * b && v <= b) && c < v * 2) && s == 1) && a == y * r + p * x) && 1 <= a) && 0 <= c) && b == y) && k == 1) && x / 2 < b) && q == 0) && c < b) && a == x) && y <= 1) && p == 1) || (((((((((((k == 0 && s == 1) && a == y * r + p * x) && 1 <= a) && b == y) && q == 0) && 1 <= y) && a == x) && c <= 1) && c == x) && y <= 1) && p == 1) RESULT: Ultimate proved your program to be correct! [2022-04-27 13:08:57,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...