/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/egcd-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:50:32,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:50:32,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:50:32,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:50:32,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:50:32,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:50:32,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:50:32,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:50:32,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:50:32,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:50:32,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:50:32,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:50:32,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:50:32,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:50:32,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:50:32,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:50:32,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:50:32,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:50:32,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:50:32,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:50:32,858 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:50:32,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:50:32,859 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:50:32,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:50:32,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:50:32,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:50:32,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:50:32,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:50:32,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:50:32,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:50:32,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:50:32,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:50:32,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:50:32,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:50:32,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:50:32,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:50:32,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:50:32,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:50:32,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:50:32,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:50:32,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:50:32,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:50:32,871 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 11:50:32,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:50:32,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:50:32,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:50:32,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:50:32,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:50:32,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:50:32,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:50:32,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:50:32,895 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:50:32,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:50:32,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:50:32,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:50:32,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:50:32,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:50:32,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:50:32,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:50:32,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:50:32,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:50:32,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:50:32,899 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 11:50:33,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:50:33,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:50:33,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:50:33,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:50:33,090 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:50:33,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-27 11:50:33,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5034eaa/1d5a1cf0edb64bbbb413a02242c5ab0d/FLAGe10272d9b [2022-04-27 11:50:33,498 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:50:33,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-27 11:50:33,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5034eaa/1d5a1cf0edb64bbbb413a02242c5ab0d/FLAGe10272d9b [2022-04-27 11:50:33,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5034eaa/1d5a1cf0edb64bbbb413a02242c5ab0d [2022-04-27 11:50:33,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:50:33,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:50:33,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:50:33,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:50:33,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:50:33,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a95ebfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33, skipping insertion in model container [2022-04-27 11:50:33,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:50:33,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:50:33,687 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/egcd-ll.c[489,502] [2022-04-27 11:50:33,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:50:33,722 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:50:33,730 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/egcd-ll.c[489,502] [2022-04-27 11:50:33,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:50:33,745 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:50:33,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33 WrapperNode [2022-04-27 11:50:33,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:50:33,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:50:33,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:50:33,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:50:33,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:50:33,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:50:33,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:50:33,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:50:33,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (1/1) ... [2022-04-27 11:50:33,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:50:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:33,805 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 11:50:33,822 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 11:50:33,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:50:33,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:50:33,838 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:50:33,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:50:33,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:50:33,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:50:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:50:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:50:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:50:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:50:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:50:33,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:50:33,879 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:50:33,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:50:34,008 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:50:34,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:50:34,012 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:50:34,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:50:34 BoogieIcfgContainer [2022-04-27 11:50:34,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:50:34,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:50:34,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:50:34,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:50:34,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:50:33" (1/3) ... [2022-04-27 11:50:34,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b174aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:50:34, skipping insertion in model container [2022-04-27 11:50:34,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:50:33" (2/3) ... [2022-04-27 11:50:34,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b174aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:50:34, skipping insertion in model container [2022-04-27 11:50:34,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:50:34" (3/3) ... [2022-04-27 11:50:34,018 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll.c [2022-04-27 11:50:34,026 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:50:34,027 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:50:34,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:50:34,066 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@70b5a50f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@230b875f [2022-04-27 11:50:34,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:50:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 11:50:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:50:34,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:34,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:34,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2012836591, now seen corresponding path program 1 times [2022-04-27 11:50:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:34,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693798626] [2022-04-27 11:50:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:50:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:34,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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(10, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-27 11:50:34,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 11:50:34,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2022-04-27 11:50:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:50:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:34,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 11:50:34,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 11:50:34,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 11:50:34,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-27 11:50:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:50:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:34,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 11:50:34,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 11:50:34,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 11:50:34,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-27 11:50:34,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:50:34,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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(10, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-27 11:50:34,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 11:50:34,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2022-04-27 11:50:34,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-27 11:50:34,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37#true} is VALID [2022-04-27 11:50:34,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 11:50:34,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 11:50:34,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 11:50:34,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 11:50:34,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #63#return; {38#false} is VALID [2022-04-27 11:50:34,306 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 11:50:34,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 11:50:34,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 11:50:34,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 11:50:34,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {38#false} #65#return; {38#false} is VALID [2022-04-27 11:50:34,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {38#false} is VALID [2022-04-27 11:50:34,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} assume false; {38#false} is VALID [2022-04-27 11:50:34,308 INFO L272 TraceCheckUtils]: 18: Hoare triple {38#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {38#false} is VALID [2022-04-27 11:50:34,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 11:50:34,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 11:50:34,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 11:50:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:50:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:34,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693798626] [2022-04-27 11:50:34,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693798626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:50:34,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:50:34,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:50:34,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869172760] [2022-04-27 11:50:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:50:34,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:50:34,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:34,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:50:34,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:34,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:50:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:50:34,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:50:34,368 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:50:34,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:34,500 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-04-27 11:50:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:50:34,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:50:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:50:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-27 11:50:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:50:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-04-27 11:50:34,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-04-27 11:50:34,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:34,620 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:50:34,620 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 11:50:34,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 11:50:34,624 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 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 11:50:34,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:50:34,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 11:50:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 11:50:34,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:34,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 11:50:34,651 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 11:50:34,651 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 11:50:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:34,655 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 11:50:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:50:34,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:34,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:34,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 29 states. [2022-04-27 11:50:34,656 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 29 states. [2022-04-27 11:50:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:34,659 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-27 11:50:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:50:34,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:34,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:34,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:34,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 11:50:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-27 11:50:34,663 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2022-04-27 11:50:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:34,663 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-27 11:50:34,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:50:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-27 11:50:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:50:34,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:34,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:34,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:50:34,664 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:34,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1952740121, now seen corresponding path program 1 times [2022-04-27 11:50:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:34,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066440778] [2022-04-27 11:50:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:34,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:34,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750341679] [2022-04-27 11:50:34,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:34,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:34,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:34,688 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 11:50:34,689 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 11:50:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:34,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:50:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:34,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:37,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2022-04-27 11:50:37,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#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(10, 2);call #Ultimate.allocInit(12, 3); {244#true} is VALID [2022-04-27 11:50:37,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 11:50:37,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #81#return; {244#true} is VALID [2022-04-27 11:50:37,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret6 := main(); {244#true} is VALID [2022-04-27 11:50:37,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {244#true} is VALID [2022-04-27 11:50:37,100 INFO L272 TraceCheckUtils]: 6: Hoare triple {244#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {244#true} is VALID [2022-04-27 11:50:37,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {244#true} ~cond := #in~cond; {244#true} is VALID [2022-04-27 11:50:37,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#true} assume !(0 == ~cond); {244#true} is VALID [2022-04-27 11:50:37,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 11:50:37,101 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {244#true} {244#true} #63#return; {244#true} is VALID [2022-04-27 11:50:37,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {244#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {244#true} is VALID [2022-04-27 11:50:37,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {244#true} ~cond := #in~cond; {244#true} is VALID [2022-04-27 11:50:37,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {244#true} assume !(0 == ~cond); {244#true} is VALID [2022-04-27 11:50:37,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {244#true} assume true; {244#true} is VALID [2022-04-27 11:50:37,101 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {244#true} {244#true} #65#return; {244#true} is VALID [2022-04-27 11:50:37,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {244#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 11:50:37,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !false; {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 11:50:37,108 INFO L272 TraceCheckUtils]: 18: Hoare triple {297#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {304#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:37,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {304#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {308#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:37,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {245#false} is VALID [2022-04-27 11:50:37,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-04-27 11:50:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:50:37,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:50:37,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:37,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066440778] [2022-04-27 11:50:37,109 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:37,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750341679] [2022-04-27 11:50:37,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750341679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:50:37,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:50:37,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:50:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130925325] [2022-04-27 11:50:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:50:37,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 11:50:37,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:37,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:50:37,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:37,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:50:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:37,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:50:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:50:37,146 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:50:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:37,359 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 11:50:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:50:37,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-27 11:50:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:50:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 11:50:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:50:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 11:50:37,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 11:50:37,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:37,458 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:50:37,458 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 11:50:37,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 11:50:37,460 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:37,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:50:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 11:50:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-27 11:50:37,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:37,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:37,474 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:37,475 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:37,481 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-27 11:50:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-27 11:50:37,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:37,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:37,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-27 11:50:37,486 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-27 11:50:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:37,488 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-27 11:50:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-27 11:50:37,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:37,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:37,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:37,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2022-04-27 11:50:37,492 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 22 [2022-04-27 11:50:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:37,492 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2022-04-27 11:50:37,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 11:50:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-27 11:50:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:50:37,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:37,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:37,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:50:37,707 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 11:50:37,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:37,708 INFO L85 PathProgramCache]: Analyzing trace with hash 652987931, now seen corresponding path program 1 times [2022-04-27 11:50:37,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:37,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574752974] [2022-04-27 11:50:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:37,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:37,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:37,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938849122] [2022-04-27 11:50:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:37,726 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 11:50:37,727 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 11:50:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:37,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:50:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:37,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:37,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-27 11:50:37,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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(10, 2);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-27 11:50:37,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 11:50:37,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #81#return; {538#true} is VALID [2022-04-27 11:50:37,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret6 := main(); {538#true} is VALID [2022-04-27 11:50:37,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {538#true} is VALID [2022-04-27 11:50:37,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {538#true} is VALID [2022-04-27 11:50:37,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-27 11:50:37,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-27 11:50:37,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 11:50:37,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #63#return; {538#true} is VALID [2022-04-27 11:50:37,985 INFO L272 TraceCheckUtils]: 11: Hoare triple {538#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {538#true} is VALID [2022-04-27 11:50:37,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {538#true} ~cond := #in~cond; {579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:37,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:37,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:37,987 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {583#(not (= |assume_abort_if_not_#in~cond| 0))} {538#true} #65#return; {590#(<= 1 main_~y~0)} is VALID [2022-04-27 11:50:37,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {590#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:37,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:37,989 INFO L272 TraceCheckUtils]: 18: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {538#true} is VALID [2022-04-27 11:50:37,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-27 11:50:37,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-27 11:50:37,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-27 11:50:37,990 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {538#true} {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #67#return; {594#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:37,991 INFO L272 TraceCheckUtils]: 23: Hoare triple {594#(and (= main_~r~0 0) (<= 1 main_~y~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)); {616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:37,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {616#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:37,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {620#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-27 11:50:37,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-27 11:50:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:50:37,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:50:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574752974] [2022-04-27 11:50:37,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:37,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938849122] [2022-04-27 11:50:37,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938849122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:50:37,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:50:37,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:50:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537960339] [2022-04-27 11:50:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:50:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 11:50:37,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:37,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:50:38,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:38,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:50:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:38,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:50:38,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:50:38,017 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:50:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:38,349 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-27 11:50:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:50:38,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 11:50:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:50:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-27 11:50:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:50:38,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-27 11:50:38,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-27 11:50:38,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:38,397 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:50:38,397 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 11:50:38,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:50:38,398 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:38,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:50:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 11:50:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 11:50:38,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:38,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:38,412 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:38,413 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:38,415 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 11:50:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-27 11:50:38,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:38,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:38,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 11:50:38,416 INFO L87 Difference]: Start difference. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 11:50:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:38,418 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-27 11:50:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-27 11:50:38,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:38,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:38,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:38,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 11:50:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-27 11:50:38,421 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 27 [2022-04-27 11:50:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:38,421 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-27 11:50:38,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:50:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-27 11:50:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:50:38,422 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:38,422 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:38,449 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 11:50:38,651 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 11:50:38,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:38,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1028398105, now seen corresponding path program 1 times [2022-04-27 11:50:38,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:38,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353499358] [2022-04-27 11:50:38,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:38,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:38,674 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:38,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1895148833] [2022-04-27 11:50:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:38,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:38,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:38,676 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 11:50:38,677 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 11:50:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:38,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 11:50:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:38,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:38,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2022-04-27 11:50:38,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#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(10, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-04-27 11:50:38,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:38,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #81#return; {870#true} is VALID [2022-04-27 11:50:38,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret6 := main(); {870#true} is VALID [2022-04-27 11:50:38,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {870#true} is VALID [2022-04-27 11:50:38,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {870#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:38,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} ~cond := #in~cond; {896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:38,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {896#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:38,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {900#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:38,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#(not (= |assume_abort_if_not_#in~cond| 0))} {870#true} #63#return; {907#(<= 1 main_~x~0)} is VALID [2022-04-27 11:50:38,898 INFO L272 TraceCheckUtils]: 11: Hoare triple {907#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:38,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:38,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:38,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:38,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {870#true} {907#(<= 1 main_~x~0)} #65#return; {907#(<= 1 main_~x~0)} is VALID [2022-04-27 11:50:38,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {907#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:50:38,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:50:38,900 INFO L272 TraceCheckUtils]: 18: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:38,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:38,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:38,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:38,903 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {870#true} {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #67#return; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:50:38,903 INFO L272 TraceCheckUtils]: 23: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:38,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:38,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:38,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:38,904 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {870#true} {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #69#return; {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:50:38,905 INFO L272 TraceCheckUtils]: 28: Hoare triple {926#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:38,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:38,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-04-27 11:50:38,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-04-27 11:50:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:50:38,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:50:39,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-04-27 11:50:39,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {967#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-04-27 11:50:39,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {963#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {967#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:39,082 INFO L272 TraceCheckUtils]: 28: Hoare triple {983#(= main_~b~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)); {963#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:39,084 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {870#true} {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #69#return; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 11:50:39,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:39,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:39,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:39,085 INFO L272 TraceCheckUtils]: 23: Hoare triple {983#(= main_~b~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)); {870#true} is VALID [2022-04-27 11:50:39,094 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {870#true} {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #67#return; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 11:50:39,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:39,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:39,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:39,095 INFO L272 TraceCheckUtils]: 18: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:39,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 11:50:39,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {983#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 11:50:39,096 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {870#true} {870#true} #65#return; {870#true} is VALID [2022-04-27 11:50:39,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:39,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:39,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:39,097 INFO L272 TraceCheckUtils]: 11: Hoare triple {870#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:39,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {870#true} {870#true} #63#return; {870#true} is VALID [2022-04-27 11:50:39,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:39,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-04-27 11:50:39,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-04-27 11:50:39,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {870#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {870#true} is VALID [2022-04-27 11:50:39,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {870#true} is VALID [2022-04-27 11:50:39,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret6 := main(); {870#true} is VALID [2022-04-27 11:50:39,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #81#return; {870#true} is VALID [2022-04-27 11:50:39,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-27 11:50:39,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#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(10, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-04-27 11:50:39,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2022-04-27 11:50:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 11:50:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:39,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353499358] [2022-04-27 11:50:39,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:39,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895148833] [2022-04-27 11:50:39,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895148833] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:50:39,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:50:39,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 11:50:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774158538] [2022-04-27 11:50:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:50:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 11:50:39,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:39,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:50:39,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:39,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:50:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:39,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:50:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:50:39,118 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:50:39,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:39,350 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 11:50:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:50:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-27 11:50:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:50:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 11:50:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:50:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 11:50:39,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 11:50:39,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:39,427 INFO L225 Difference]: With dead ends: 71 [2022-04-27 11:50:39,427 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 11:50:39,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:50:39,428 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:39,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:50:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 11:50:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 11:50:39,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:39,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:39,452 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:39,452 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:39,455 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-27 11:50:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-27 11:50:39,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:39,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:39,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-27 11:50:39,456 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-27 11:50:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:39,458 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-27 11:50:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-27 11:50:39,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:39,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:39,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:39,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-04-27 11:50:39,462 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 32 [2022-04-27 11:50:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:39,462 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-04-27 11:50:39,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 11:50:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-27 11:50:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:50:39,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:39,463 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-04-27 11:50:39,479 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 11:50:39,675 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 11:50:39,675 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:39,676 INFO L85 PathProgramCache]: Analyzing trace with hash -134474469, now seen corresponding path program 1 times [2022-04-27 11:50:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:39,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137521136] [2022-04-27 11:50:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:39,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:39,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840093711] [2022-04-27 11:50:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:39,688 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 11:50:39,689 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 11:50:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:39,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 11:50:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:39,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:39,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {1424#true} call ULTIMATE.init(); {1424#true} is VALID [2022-04-27 11:50:39,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {1424#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(10, 2);call #Ultimate.allocInit(12, 3); {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1424#true} {1424#true} #81#return; {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {1424#true} call #t~ret6 := main(); {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {1424#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {1424#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1424#true} {1424#true} #63#return; {1424#true} is VALID [2022-04-27 11:50:39,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {1424#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1424#true} {1424#true} #65#return; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {1424#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {1424#true} assume !false; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L272 TraceCheckUtils]: 18: Hoare triple {1424#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-27 11:50:39,801 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1424#true} {1424#true} #67#return; {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L272 TraceCheckUtils]: 23: Hoare triple {1424#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1424#true} {1424#true} #69#return; {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L272 TraceCheckUtils]: 28: Hoare triple {1424#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L290 TraceCheckUtils]: 29: Hoare triple {1424#true} ~cond := #in~cond; {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {1424#true} assume !(0 == ~cond); {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {1424#true} assume true; {1424#true} is VALID [2022-04-27 11:50:39,802 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1424#true} {1424#true} #71#return; {1424#true} is VALID [2022-04-27 11:50:39,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {1424#true} assume !(~a~0 != ~b~0); {1528#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 11:50:39,803 INFO L272 TraceCheckUtils]: 34: Hoare triple {1528#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:39,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {1532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:39,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {1536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1425#false} is VALID [2022-04-27 11:50:39,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2022-04-27 11:50:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 11:50:39,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:50:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:39,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137521136] [2022-04-27 11:50:39,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:39,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840093711] [2022-04-27 11:50:39,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840093711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:50:39,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:50:39,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:50:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097955443] [2022-04-27 11:50:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:50:39,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-27 11:50:39,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:39,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 11:50:39,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:39,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:50:39,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:39,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:50:39,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:50:39,822 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 11:50:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:39,954 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2022-04-27 11:50:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:50:39,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-27 11:50:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 11:50:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 11:50:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 11:50:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-27 11:50:39,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-27 11:50:39,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:39,989 INFO L225 Difference]: With dead ends: 73 [2022-04-27 11:50:39,989 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 11:50:39,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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 11:50:39,990 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:39,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:50:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 11:50:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 11:50:40,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:40,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:40,012 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:40,012 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:40,014 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-27 11:50:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-27 11:50:40,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:40,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:40,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 11:50:40,015 INFO L87 Difference]: Start difference. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 11:50:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:40,018 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-27 11:50:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-27 11:50:40,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:40,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:40,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:40,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 11:50:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-27 11:50:40,021 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 38 [2022-04-27 11:50:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:40,021 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-27 11:50:40,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 11:50:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-27 11:50:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 11:50:40,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:40,022 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:40,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:50:40,237 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 11:50:40,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:40,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash 251096952, now seen corresponding path program 1 times [2022-04-27 11:50:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:40,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111380926] [2022-04-27 11:50:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:40,247 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:40,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788430736] [2022-04-27 11:50:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:40,248 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 11:50:40,249 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 11:50:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:40,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:50:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:40,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:43,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {1910#true} call ULTIMATE.init(); {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#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(10, 2);call #Ultimate.allocInit(12, 3); {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1910#true} {1910#true} #81#return; {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {1910#true} call #t~ret6 := main(); {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {1910#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {1910#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1910#true} {1910#true} #63#return; {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {1910#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1910#true} is VALID [2022-04-27 11:50:43,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-27 11:50:43,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-27 11:50:43,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-27 11:50:43,177 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1910#true} {1910#true} #65#return; {1910#true} is VALID [2022-04-27 11:50:43,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {1910#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,177 INFO L272 TraceCheckUtils]: 18: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,178 INFO L272 TraceCheckUtils]: 23: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-27 11:50:43,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-27 11:50:43,179 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,179 INFO L272 TraceCheckUtils]: 28: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1910#true} is VALID [2022-04-27 11:50:43,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {1910#true} ~cond := #in~cond; {1910#true} is VALID [2022-04-27 11:50:43,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {1910#true} assume !(0 == ~cond); {1910#true} is VALID [2022-04-27 11:50:43,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {1910#true} assume true; {1910#true} is VALID [2022-04-27 11:50:43,180 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1910#true} {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #71#return; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:50:43,181 INFO L272 TraceCheckUtils]: 36: Hoare triple {1963#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2024#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:43,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {2024#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2028#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:43,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {2028#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1911#false} is VALID [2022-04-27 11:50:43,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {1911#false} assume !false; {1911#false} is VALID [2022-04-27 11:50:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:50:43,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:50:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111380926] [2022-04-27 11:50:43,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788430736] [2022-04-27 11:50:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788430736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:50:43,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:50:43,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:50:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714502664] [2022-04-27 11:50:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:50:43,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-04-27 11:50:43,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:43,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:50:43,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:43,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:50:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:50:43,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:50:43,199 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:50:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:43,354 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-04-27 11:50:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:50:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2022-04-27 11:50:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:50:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 11:50:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:50:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 11:50:43,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-27 11:50:43,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:43,408 INFO L225 Difference]: With dead ends: 81 [2022-04-27 11:50:43,408 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 11:50:43,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 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 11:50:43,409 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:43,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:50:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 11:50:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-27 11:50:43,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:43,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:50:43,429 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:50:43,429 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:50:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:43,431 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-27 11:50:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-27 11:50:43,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:43,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:43,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-27 11:50:43,432 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-27 11:50:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:43,434 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-27 11:50:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-27 11:50:43,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:43,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:43,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:43,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-27 11:50:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-27 11:50:43,437 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 40 [2022-04-27 11:50:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:43,437 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-27 11:50:43,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:50:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-27 11:50:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 11:50:43,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:43,438 INFO L195 NwaCegarLoop]: trace histogram [5, 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 11:50:43,456 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 11:50:43,654 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 11:50:43,654 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1098226535, now seen corresponding path program 1 times [2022-04-27 11:50:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:43,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511625742] [2022-04-27 11:50:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:43,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:43,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502413579] [2022-04-27 11:50:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:43,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:43,666 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 11:50:43,667 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 11:50:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:43,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:50:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:43,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:43,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2022-04-27 11:50:43,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#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(10, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-27 11:50:43,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:43,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #81#return; {2430#true} is VALID [2022-04-27 11:50:43,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret6 := main(); {2430#true} is VALID [2022-04-27 11:50:43,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2430#true} is VALID [2022-04-27 11:50:43,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:43,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:43,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2430#true} {2430#true} #63#return; {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2430#true} {2430#true} #65#return; {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2430#true} is VALID [2022-04-27 11:50:43,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#true} assume !false; {2430#true} is VALID [2022-04-27 11:50:43,856 INFO L272 TraceCheckUtils]: 18: Hoare triple {2430#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:43,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:43,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:43,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:43,858 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2430#true} {2430#true} #67#return; {2430#true} is VALID [2022-04-27 11:50:43,858 INFO L272 TraceCheckUtils]: 23: Hoare triple {2430#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:43,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {2430#true} ~cond := #in~cond; {2507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:43,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {2507#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:50:43,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:50:43,860 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} {2430#true} #69#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:43,860 INFO L272 TraceCheckUtils]: 28: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:43,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:43,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:43,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:43,861 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2430#true} {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #71#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:43,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:43,861 INFO L272 TraceCheckUtils]: 34: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:43,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:43,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:43,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:43,862 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2430#true} {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #73#return; {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:43,863 INFO L272 TraceCheckUtils]: 39: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:43,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:43,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2431#false} is VALID [2022-04-27 11:50:43,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-27 11:50:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 11:50:43,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:50:56,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {2431#false} assume !false; {2431#false} is VALID [2022-04-27 11:50:56,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {2560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2431#false} is VALID [2022-04-27 11:50:56,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:56,552 INFO L272 TraceCheckUtils]: 39: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {2556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:56,553 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2430#true} {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #73#return; {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:56,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:56,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:56,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:56,553 INFO L272 TraceCheckUtils]: 34: Hoare triple {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:56,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {2537#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:56,554 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2430#true} {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #71#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:56,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:56,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:56,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:56,555 INFO L272 TraceCheckUtils]: 28: Hoare triple {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:56,556 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} {2430#true} #69#return; {2518#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:56,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:50:56,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {2621#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2511#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {2430#true} ~cond := #in~cond; {2621#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:50:56,557 INFO L272 TraceCheckUtils]: 23: Hoare triple {2430#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2430#true} {2430#true} #67#return; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L272 TraceCheckUtils]: 18: Hoare triple {2430#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {2430#true} assume !false; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {2430#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2430#true} {2430#true} #65#return; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:56,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L272 TraceCheckUtils]: 11: Hoare triple {2430#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2430#true} {2430#true} #63#return; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {2430#true} assume !(0 == ~cond); {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2430#true} ~cond := #in~cond; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {2430#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {2430#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {2430#true} call #t~ret6 := main(); {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2430#true} {2430#true} #81#return; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {2430#true} assume true; {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {2430#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(10, 2);call #Ultimate.allocInit(12, 3); {2430#true} is VALID [2022-04-27 11:50:56,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {2430#true} call ULTIMATE.init(); {2430#true} is VALID [2022-04-27 11:50:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 11:50:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511625742] [2022-04-27 11:50:56,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502413579] [2022-04-27 11:50:56,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502413579] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:50:56,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:50:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 11:50:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955517510] [2022-04-27 11:50:56,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:50:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-27 11:50:56,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:56,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 11:50:56,586 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 11:50:56,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:50:56,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:56,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:50:56,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:50:56,586 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 11:50:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:57,020 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-27 11:50:57,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:50:57,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-27 11:50:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 11:50:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 11:50:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 11:50:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 11:50:57,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 11:50:57,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:57,063 INFO L225 Difference]: With dead ends: 85 [2022-04-27 11:50:57,063 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 11:50:57,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:50:57,064 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:57,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 90 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:50:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 11:50:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-27 11:50:57,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:57,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:50:57,089 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:50:57,089 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:50:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:57,091 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-27 11:50:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-27 11:50:57,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:57,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:57,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-27 11:50:57,092 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-27 11:50:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:57,094 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-27 11:50:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-27 11:50:57,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:57,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:57,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:57,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 11:50:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-27 11:50:57,099 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 43 [2022-04-27 11:50:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:57,099 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-27 11:50:57,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 11:50:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-27 11:50:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 11:50:57,100 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:57,100 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2022-04-27 11:50:57,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:50:57,311 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 11:50:57,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:57,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -17648356, now seen corresponding path program 2 times [2022-04-27 11:50:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:57,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546450585] [2022-04-27 11:50:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:57,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:50:57,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2136714751] [2022-04-27 11:50:57,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:50:57,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:57,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:57,330 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 11:50:57,331 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 11:50:57,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:50:57,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:50:57,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:50:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:57,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:57,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {3114#true} call ULTIMATE.init(); {3114#true} is VALID [2022-04-27 11:50:57,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#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(10, 2);call #Ultimate.allocInit(12, 3); {3114#true} is VALID [2022-04-27 11:50:57,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3114#true} {3114#true} #81#return; {3114#true} is VALID [2022-04-27 11:50:57,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {3114#true} call #t~ret6 := main(); {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {3114#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L272 TraceCheckUtils]: 6: Hoare triple {3114#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3114#true} {3114#true} #63#return; {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L272 TraceCheckUtils]: 11: Hoare triple {3114#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,599 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3114#true} {3114#true} #65#return; {3114#true} is VALID [2022-04-27 11:50:57,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {3114#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3167#(and (= 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_~p~0 1))} is VALID [2022-04-27 11:50:57,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {3167#(and (= 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_~p~0 1))} assume !false; {3167#(and (= 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_~p~0 1))} is VALID [2022-04-27 11:50:57,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {3167#(and (= 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_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,601 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3114#true} {3167#(and (= 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_~p~0 1))} #67#return; {3167#(and (= 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_~p~0 1))} is VALID [2022-04-27 11:50:57,601 INFO L272 TraceCheckUtils]: 23: Hoare triple {3167#(and (= 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_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,602 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3114#true} {3167#(and (= 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_~p~0 1))} #69#return; {3167#(and (= 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_~p~0 1))} is VALID [2022-04-27 11:50:57,602 INFO L272 TraceCheckUtils]: 28: Hoare triple {3167#(and (= 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_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,603 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3114#true} {3167#(and (= 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_~p~0 1))} #71#return; {3167#(and (= 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_~p~0 1))} is VALID [2022-04-27 11:50:57,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {3167#(and (= 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_~p~0 1))} assume !!(~a~0 != ~b~0); {3167#(and (= 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_~p~0 1))} is VALID [2022-04-27 11:50:57,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {3167#(and (= 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_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-27 11:50:57,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} assume !false; {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-27 11:50:57,604 INFO L272 TraceCheckUtils]: 36: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,605 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3114#true} {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} #67#return; {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-27 11:50:57,605 INFO L272 TraceCheckUtils]: 41: Hoare triple {3222#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:57,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:57,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {3248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3115#false} is VALID [2022-04-27 11:50:57,606 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#false} assume !false; {3115#false} is VALID [2022-04-27 11:50:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:50:57,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:50:57,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#false} assume !false; {3115#false} is VALID [2022-04-27 11:50:57,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {3248#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3115#false} is VALID [2022-04-27 11:50:57,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:50:57,753 INFO L272 TraceCheckUtils]: 41: Hoare triple {3264#(= 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)); {3244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:50:57,753 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3114#true} {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #67#return; {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:57,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,754 INFO L272 TraceCheckUtils]: 36: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:57,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3264#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 11:50:57,882 INFO L290 TraceCheckUtils]: 33: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 11:50:57,883 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3114#true} {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #71#return; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 11:50:57,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,883 INFO L272 TraceCheckUtils]: 28: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,885 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3114#true} {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #69#return; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 11:50:57,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,885 INFO L272 TraceCheckUtils]: 23: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,890 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3114#true} {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #67#return; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 11:50:57,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,890 INFO L272 TraceCheckUtils]: 18: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !false; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 11:50:57,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {3114#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3286#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 11:50:57,903 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3114#true} {3114#true} #65#return; {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L272 TraceCheckUtils]: 11: Hoare triple {3114#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3114#true} {3114#true} #63#return; {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {3114#true} assume !(0 == ~cond); {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {3114#true} ~cond := #in~cond; {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {3114#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3114#true} is VALID [2022-04-27 11:50:57,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {3114#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3114#true} is VALID [2022-04-27 11:50:57,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {3114#true} call #t~ret6 := main(); {3114#true} is VALID [2022-04-27 11:50:57,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3114#true} {3114#true} #81#return; {3114#true} is VALID [2022-04-27 11:50:57,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {3114#true} assume true; {3114#true} is VALID [2022-04-27 11:50:57,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {3114#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(10, 2);call #Ultimate.allocInit(12, 3); {3114#true} is VALID [2022-04-27 11:50:57,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {3114#true} call ULTIMATE.init(); {3114#true} is VALID [2022-04-27 11:50:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:50:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546450585] [2022-04-27 11:50:57,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:50:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136714751] [2022-04-27 11:50:57,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136714751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:50:57,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:50:57,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 11:50:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589243377] [2022-04-27 11:50:57,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:50:57,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-27 11:50:57,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:57,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 11:50:58,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:58,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:50:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:50:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:50:58,057 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 11:50:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:59,666 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-04-27 11:50:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:50:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-27 11:50:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 11:50:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 11:50:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 11:50:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-04-27 11:50:59,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2022-04-27 11:50:59,849 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 11:50:59,851 INFO L225 Difference]: With dead ends: 107 [2022-04-27 11:50:59,851 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 11:50:59,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:50:59,852 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:59,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 147 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 11:50:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 11:50:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2022-04-27 11:50:59,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:59,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 11:50:59,872 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 11:50:59,872 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 11:50:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:59,874 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 11:50:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 11:50:59,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:59,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:59,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-27 11:50:59,875 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-27 11:50:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:59,878 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-27 11:50:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-27 11:50:59,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:59,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:59,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:59,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 11:50:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-04-27 11:50:59,880 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 45 [2022-04-27 11:50:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:59,880 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-04-27 11:50:59,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 11:50:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-04-27 11:50:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 11:50:59,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:59,881 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:59,899 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 11:51:00,099 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 11:51:00,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:51:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:51:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -152607915, now seen corresponding path program 1 times [2022-04-27 11:51:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:51:00,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673853576] [2022-04-27 11:51:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:51:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:51:00,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:51:00,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477308994] [2022-04-27 11:51:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:51:00,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:51:00,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:51:00,111 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 11:51:00,113 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 11:51:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:51:00,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 11:51:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:51:00,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:51:00,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {3883#true} call ULTIMATE.init(); {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#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(10, 2);call #Ultimate.allocInit(12, 3); {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3883#true} {3883#true} #81#return; {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {3883#true} call #t~ret6 := main(); {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L272 TraceCheckUtils]: 6: Hoare triple {3883#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,429 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3883#true} {3883#true} #63#return; {3883#true} is VALID [2022-04-27 11:51:00,430 INFO L272 TraceCheckUtils]: 11: Hoare triple {3883#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} #65#return; {3883#true} is VALID [2022-04-27 11:51:00,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:51:00,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:51:00,431 INFO L272 TraceCheckUtils]: 18: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,432 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #67#return; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:51:00,432 INFO L272 TraceCheckUtils]: 23: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,433 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #69#return; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:51:00,433 INFO L272 TraceCheckUtils]: 28: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,434 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3883#true} {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #71#return; {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:51:00,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 11:51:00,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {3936#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 11:51:00,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !false; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 11:51:00,436 INFO L272 TraceCheckUtils]: 36: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,438 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #67#return; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 11:51:00,438 INFO L272 TraceCheckUtils]: 41: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,439 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #69#return; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 11:51:00,439 INFO L272 TraceCheckUtils]: 46: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,440 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3883#true} {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} #71#return; {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 11:51:00,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !!(~a~0 != ~b~0); {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-27 11:51:00,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {3991#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 11:51:00,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} assume !false; {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-27 11:51:00,442 INFO L272 TraceCheckUtils]: 54: Hoare triple {4046#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:51:00,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:51:00,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {4057#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3884#false} is VALID [2022-04-27 11:51:00,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {3884#false} assume !false; {3884#false} is VALID [2022-04-27 11:51:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-27 11:51:00,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:51:00,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {3884#false} assume !false; {3884#false} is VALID [2022-04-27 11:51:00,663 INFO L290 TraceCheckUtils]: 56: Hoare triple {4057#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3884#false} is VALID [2022-04-27 11:51:00,663 INFO L290 TraceCheckUtils]: 55: Hoare triple {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4057#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:51:00,664 INFO L272 TraceCheckUtils]: 54: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4053#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:51:00,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !(~a~0 > ~b~0);~b~0 := ~b~0 - ~a~0;~q~0 := ~q~0 - ~p~0;~s~0 := ~s~0 - ~r~0; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,667 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #71#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,667 INFO L290 TraceCheckUtils]: 47: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,668 INFO L272 TraceCheckUtils]: 46: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,668 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #69#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,668 INFO L290 TraceCheckUtils]: 44: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,668 INFO L272 TraceCheckUtils]: 41: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,669 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #67#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,669 INFO L272 TraceCheckUtils]: 36: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !!(~a~0 != ~b~0); {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,672 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #71#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,673 INFO L272 TraceCheckUtils]: 28: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,673 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #69#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,673 INFO L272 TraceCheckUtils]: 23: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,674 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3883#true} {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} #67#return; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,674 INFO L272 TraceCheckUtils]: 18: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} assume !false; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {3883#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4073#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-27 11:51:00,675 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3883#true} {3883#true} #65#return; {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L272 TraceCheckUtils]: 11: Hoare triple {3883#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3883#true} {3883#true} #63#return; {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {3883#true} assume !(0 == ~cond); {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#true} ~cond := #in~cond; {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L272 TraceCheckUtils]: 6: Hoare triple {3883#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3883#true} is VALID [2022-04-27 11:51:00,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {3883#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3883#true} is VALID [2022-04-27 11:51:00,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {3883#true} call #t~ret6 := main(); {3883#true} is VALID [2022-04-27 11:51:00,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3883#true} {3883#true} #81#return; {3883#true} is VALID [2022-04-27 11:51:00,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {3883#true} assume true; {3883#true} is VALID [2022-04-27 11:51:00,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {3883#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(10, 2);call #Ultimate.allocInit(12, 3); {3883#true} is VALID [2022-04-27 11:51:00,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {3883#true} call ULTIMATE.init(); {3883#true} is VALID [2022-04-27 11:51:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-27 11:51:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:51:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673853576] [2022-04-27 11:51:00,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:51:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477308994] [2022-04-27 11:51:00,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477308994] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:51:00,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:51:00,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-27 11:51:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115878447] [2022-04-27 11:51:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:51:00,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-04-27 11:51:00,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:51:00,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:51:00,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:51:00,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:51:00,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:51:00,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:51:00,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:51:00,704 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:51:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:00,835 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2022-04-27 11:51:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:51:00,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 58 [2022-04-27 11:51:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:51:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:51:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 11:51:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:51:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-27 11:51:00,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-27 11:51:00,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:51:00,866 INFO L225 Difference]: With dead ends: 85 [2022-04-27 11:51:00,866 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:51:00,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:51:00,867 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:51:00,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:51:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:51:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:51:00,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:51:00,868 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 11:51:00,868 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 11:51:00,868 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 11:51:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:00,868 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:51:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:51:00,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:51:00,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:51:00,869 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 11:51:00,869 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 11:51:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:51:00,869 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:51:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:51:00,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:51:00,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:51:00,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:51:00,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:51:00,869 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 11:51:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:51:00,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-04-27 11:51:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:51:00,869 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:51:00,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 11:51:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:51:00,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:51:00,871 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:51:00,891 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 11:51:01,072 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 11:51:01,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:51:04,677 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-27 11:51:04,678 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 50) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (let ((.cse2 (+ .cse0 .cse1))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~b~0 .cse2) (= main_~a~0 .cse2) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))))) [2022-04-27 11:51:04,678 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 18 57) no Hoare annotation was computed. [2022-04-27 11:51:04,678 INFO L902 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-27 11:51:04,678 INFO L902 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: true [2022-04-27 11:51:04,678 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~y~0)) [2022-04-27 11:51:04,678 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (let ((.cse2 (+ .cse0 .cse1))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~b~0 .cse2) (= main_~a~0 .cse2) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))))) [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 18 57) no Hoare annotation was computed. [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point L36(lines 33 50) no Hoare annotation was computed. [2022-04-27 11:51:04,679 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 11:51:04,679 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 11:51:04,679 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 18 57) the Hoare annotation is: true [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-04-27 11:51:04,679 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse4 (* main_~q~0 main_~x~0)) (.cse5 (* main_~y~0 main_~s~0))) (let ((.cse0 (= main_~b~0 (+ .cse4 .cse5))) (.cse1 (= main_~s~0 1)) (.cse3 (= main_~p~0 1)) (.cse2 (<= 1 main_~y~0))) (or (and (= main_~r~0 0) .cse0 .cse1 .cse2 (= main_~a~0 main_~x~0) .cse3) (and (= main_~b~0 main_~a~0) .cse0 .cse1 (= main_~q~0 0) .cse2 .cse3) (let ((.cse6 (* main_~y~0 main_~r~0)) (.cse7 (* main_~p~0 main_~x~0))) (let ((.cse8 (+ .cse6 .cse7))) (and (= (+ .cse4 main_~a~0 .cse5) (+ .cse6 main_~b~0 .cse7)) (= main_~b~0 .cse8) (= main_~a~0 .cse8) .cse2 (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))))))) [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 49) no Hoare annotation was computed. [2022-04-27 11:51:04,679 INFO L895 garLoopResultBuilder]: At program point L41-2(lines 33 50) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 11:51:04,679 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~y~0 main_~r~0)) (.cse1 (* main_~p~0 main_~x~0))) (and (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ .cse0 main_~b~0 .cse1)) (= main_~a~0 (+ .cse0 .cse1)) (<= 1 main_~y~0) (= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1)))) [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:51:04,679 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 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:51:04,680 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:51:04,680 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:51:04,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:51:04,680 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 16) the Hoare annotation is: true [2022-04-27 11:51:04,680 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2022-04-27 11:51:04,680 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2022-04-27 11:51:04,681 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2022-04-27 11:51:04,681 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2022-04-27 11:51:04,681 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-04-27 11:51:04,683 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:51:04,684 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:51:04,686 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:51:04,686 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:51:04,695 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:51:04,695 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:51:04,695 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:51:04,695 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,696 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:51:04,698 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:51:04,698 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 11:51:04,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:51:04 BoogieIcfgContainer [2022-04-27 11:51:04,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:51:04,706 INFO L158 Benchmark]: Toolchain (without parser) took 31185.75ms. Allocated memory was 182.5MB in the beginning and 235.9MB in the end (delta: 53.5MB). Free memory was 132.6MB in the beginning and 113.4MB in the end (delta: 19.2MB). Peak memory consumption was 74.2MB. Max. memory is 8.0GB. [2022-04-27 11:51:04,706 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 182.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:51:04,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.69ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 157.5MB in the end (delta: -25.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-27 11:51:04,706 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 182.5MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:51:04,706 INFO L158 Benchmark]: RCFGBuilder took 237.25ms. Allocated memory is still 182.5MB. Free memory was 156.0MB in the beginning and 143.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:51:04,707 INFO L158 Benchmark]: TraceAbstraction took 30690.58ms. Allocated memory was 182.5MB in the beginning and 235.9MB in the end (delta: 53.5MB). Free memory was 143.4MB in the beginning and 113.4MB in the end (delta: 30.0MB). Peak memory consumption was 84.5MB. Max. memory is 8.0GB. [2022-04-27 11:51:04,707 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.08ms. Allocated memory is still 182.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.69ms. Allocated memory is still 182.5MB. Free memory was 132.4MB in the beginning and 157.5MB in the end (delta: -25.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 182.5MB. Free memory was 157.5MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 237.25ms. Allocated memory is still 182.5MB. Free memory was 156.0MB in the beginning and 143.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 30690.58ms. Allocated memory was 182.5MB in the beginning and 235.9MB in the end (delta: 53.5MB). Free memory was 143.4MB in the beginning and 113.4MB in the end (delta: 30.0MB). Peak memory consumption was 84.5MB. 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 995 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 684 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 583 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 311 mSDtfsCounter, 583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 51 PreInvPairs, 84 NumberOfFragments, 378 HoareAnnotationTreeSize, 51 FomulaSimplifications, 136 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1838 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 1506 SizeOfPredicates, 16 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 373/406 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: 33]: Loop Invariant Derived loop invariant: ((q * x + a + y * s == y * r + b + p * x && a == y * r + p * x) && 1 <= y) && p * s == q * r + 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:51:04,720 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...