/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:04:40,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:04:40,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:04:40,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:04:40,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:04:40,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:04:40,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:04:40,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:04:40,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:04:40,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:04:40,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:04:40,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:04:40,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:04:40,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:04:40,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:04:40,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:04:40,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:04:40,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:04:40,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:04:40,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:04:40,729 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:04:40,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:04:40,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:04:40,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:04:40,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:04:40,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:04:40,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:04:40,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:04:40,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:04:40,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:04:40,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:04:40,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:04:40,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:04:40,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:04:40,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:04:40,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:04:40,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:04:40,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:04:40,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:04:40,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:04:40,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:04:40,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:04:40,742 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:04:40,767 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:04:40,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:04:40,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:04:40,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:04:40,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:04:40,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:04:40,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:04:40,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:04:40,769 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:04:40,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:04:40,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:04:40,771 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:04:40,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:04:40,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:04:40,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:04:40,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:04:40,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:04:40,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:04:40,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:04:40,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:04:40,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:04:40,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:04:40,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:04:40,945 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:04:40,946 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:04:40,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-27 13:04:40,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9bf628a/142d44c876ed46cd97832c61ea9d6b0c/FLAG188dbb9ab [2022-04-27 13:04:41,373 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:04:41,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-27 13:04:41,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9bf628a/142d44c876ed46cd97832c61ea9d6b0c/FLAG188dbb9ab [2022-04-27 13:04:41,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c9bf628a/142d44c876ed46cd97832c61ea9d6b0c [2022-04-27 13:04:41,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:04:41,388 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:04:41,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:04:41,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:04:41,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:04:41,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c94d7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41, skipping insertion in model container [2022-04-27 13:04:41,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:04:41,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:04:41,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c[490,503] [2022-04-27 13:04:41,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:04:41,554 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:04:41,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c[490,503] [2022-04-27 13:04:41,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:04:41,575 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:04:41,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41 WrapperNode [2022-04-27 13:04:41,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:04:41,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:04:41,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:04:41,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:04:41,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:04:41,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:04:41,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:04:41,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:04:41,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (1/1) ... [2022-04-27 13:04:41,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:04:41,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:41,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:04:41,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:04:41,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:04:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:04:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:04:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:04:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:04:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:04:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:04:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:04:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:04:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:04:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:04:41,661 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:04:41,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:04:41,717 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:04:41,718 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:04:41,840 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:04:41,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:04:41,845 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:04:41,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:04:41 BoogieIcfgContainer [2022-04-27 13:04:41,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:04:41,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:04:41,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:04:41,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:04:41,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:04:41" (1/3) ... [2022-04-27 13:04:41,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ef769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:04:41, skipping insertion in model container [2022-04-27 13:04:41,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:04:41" (2/3) ... [2022-04-27 13:04:41,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ef769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:04:41, skipping insertion in model container [2022-04-27 13:04:41,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:04:41" (3/3) ... [2022-04-27 13:04:41,851 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound5.c [2022-04-27 13:04:41,859 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:04:41,859 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:04:41,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:04:41,911 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a5f62c1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6158adc8 [2022-04-27 13:04:41,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:04:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 13:04:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:04:41,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:41,923 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 13:04:41,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:41,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-27 13:04:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:41,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988196591] [2022-04-27 13:04:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:04:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-27 13:04:42,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:04:42,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-27 13:04:42,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:04:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:42,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:42,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:42,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:04:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 13:04:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:42,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:42,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:42,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:04:42,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:04:42,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-27 13:04:42,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-27 13:04:42,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-27 13:04:42,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-27 13:04:42,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID [2022-04-27 13:04:42,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:04:42,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:42,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:42,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:42,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-27 13:04:42,157 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-27 13:04:42,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-27 13:04:42,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-27 13:04:42,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-27 13:04:42,159 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-27 13:04:42,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-27 13:04:42,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-27 13:04:42,160 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-27 13:04:42,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-27 13:04:42,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-27 13:04:42,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-27 13:04:42,161 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 13:04:42,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:42,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988196591] [2022-04-27 13:04:42,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988196591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:42,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:42,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:04:42,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086550173] [2022-04-27 13:04:42,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:42,166 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 13:04:42,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:42,169 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 13:04:42,199 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 13:04:42,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:04:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:42,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:04:42,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:04:42,226 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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 13:04:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,389 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-27 13:04:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:04:42,389 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 13:04:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:42,390 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 13:04:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 13:04:42,402 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 13:04:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 13:04:42,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 13:04:42,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:42,520 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:04:42,521 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 13:04:42,523 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 13:04:42,525 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:42,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 13:04:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 13:04:42,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:42,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,563 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,563 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,567 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 13:04:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-27 13:04:42,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:42,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:42,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 13:04:42,569 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 13:04:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,573 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-27 13:04:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-27 13:04:42,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:42,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:42,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:42,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-27 13:04:42,578 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-27 13:04:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:42,578 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-27 13:04:42,578 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 13:04:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 13:04:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:04:42,579 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:42,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:42,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:04:42,580 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-27 13:04:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:42,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910424641] [2022-04-27 13:04:42,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:42,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:42,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115950846] [2022-04-27 13:04:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:42,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:42,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:42,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:04:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:04:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:42,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:42,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2022-04-27 13:04:42,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#(<= ~counter~0 0)} {284#true} #108#return; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#(<= ~counter~0 0)} call #t~ret9 := main(); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,803 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= ~counter~0 0)} ~cond := #in~cond; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= ~counter~0 0)} assume !(0 == ~cond); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,805 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} #94#return; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,806 INFO L272 TraceCheckUtils]: 11: Hoare triple {292#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#(<= ~counter~0 0)} ~cond := #in~cond; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= ~counter~0 0)} assume !(0 == ~cond); {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,808 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} #96#return; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {292#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:42,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {341#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:04:42,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {285#false} is VALID [2022-04-27 13:04:42,809 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {285#false} is VALID [2022-04-27 13:04:42,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#false} ~cond := #in~cond; {285#false} is VALID [2022-04-27 13:04:42,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#false} assume 0 == ~cond; {285#false} is VALID [2022-04-27 13:04:42,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-27 13:04:42,810 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 13:04:42,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:42,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:42,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910424641] [2022-04-27 13:04:42,810 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:42,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115950846] [2022-04-27 13:04:42,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115950846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:42,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:42,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:04:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098215004] [2022-04-27 13:04:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:42,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:04:42,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:42,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:42,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:04:42,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:04:42,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:04:42,836 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,932 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-27 13:04:42,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:04:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:04:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 13:04:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-27 13:04:42,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-27 13:04:42,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:42,978 INFO L225 Difference]: With dead ends: 44 [2022-04-27 13:04:42,978 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 13:04:42,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:04:42,979 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:42,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:42,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 13:04:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 13:04:42,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:42,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,988 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,988 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,990 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-27 13:04:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 13:04:42,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:42,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:42,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 13:04:42,992 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 13:04:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:42,994 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-27 13:04:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 13:04:42,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:42,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:42,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:42,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-27 13:04:42,998 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-27 13:04:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:42,998 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-27 13:04:42,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 13:04:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 13:04:42,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:42,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:43,019 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 13:04:43,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:43,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:43,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:43,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-27 13:04:43,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:43,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221377778] [2022-04-27 13:04:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:43,240 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:43,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401409911] [2022-04-27 13:04:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:43,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:43,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:43,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:43,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:04:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:43,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:04:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:43,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:43,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} call ULTIMATE.init(); {547#true} is VALID [2022-04-27 13:04:43,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {547#true} is VALID [2022-04-27 13:04:43,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} assume true; {547#true} is VALID [2022-04-27 13:04:43,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} #108#return; {547#true} is VALID [2022-04-27 13:04:43,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} call #t~ret9 := main(); {547#true} is VALID [2022-04-27 13:04:43,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {547#true} is VALID [2022-04-27 13:04:43,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {547#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {547#true} is VALID [2022-04-27 13:04:43,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} ~cond := #in~cond; {547#true} is VALID [2022-04-27 13:04:43,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} assume !(0 == ~cond); {547#true} is VALID [2022-04-27 13:04:43,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#true} assume true; {547#true} is VALID [2022-04-27 13:04:43,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {547#true} {547#true} #94#return; {547#true} is VALID [2022-04-27 13:04:43,417 INFO L272 TraceCheckUtils]: 11: Hoare triple {547#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {547#true} is VALID [2022-04-27 13:04:43,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#true} ~cond := #in~cond; {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:43,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:43,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:43,418 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {547#true} #96#return; {599#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:43,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {603#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:43,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {603#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:43,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {603#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:43,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 main_~b~0)} assume !(0 != ~b~0); {548#false} is VALID [2022-04-27 13:04:43,421 INFO L272 TraceCheckUtils]: 20: Hoare triple {548#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {548#false} is VALID [2022-04-27 13:04:43,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#false} ~cond := #in~cond; {548#false} is VALID [2022-04-27 13:04:43,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} assume 0 == ~cond; {548#false} is VALID [2022-04-27 13:04:43,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} assume !false; {548#false} is VALID [2022-04-27 13:04:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:43,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:43,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221377778] [2022-04-27 13:04:43,422 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:43,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401409911] [2022-04-27 13:04:43,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401409911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:43,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:43,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:04:43,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829726451] [2022-04-27 13:04:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 13:04:43,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:43,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:43,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:04:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:43,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:04:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:43,444 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:43,665 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-27 13:04:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:04:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 13:04:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 13:04:43,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-27 13:04:43,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-27 13:04:43,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:43,733 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:04:43,733 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:04:43,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:04:43,735 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:43,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:43,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:04:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-27 13:04:43,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:43,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,755 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,755 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:43,757 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-27 13:04:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-27 13:04:43,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:43,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:43,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 13:04:43,758 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-27 13:04:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:43,760 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-27 13:04:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-27 13:04:43,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:43,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:43,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:43,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-27 13:04:43,763 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-27 13:04:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:43,763 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-27 13:04:43,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 13:04:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:04:43,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:43,764 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, 1, 1] [2022-04-27 13:04:43,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 13:04:43,972 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:43,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-27 13:04:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346814760] [2022-04-27 13:04:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:43,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:43,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150566947] [2022-04-27 13:04:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:43,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:43,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:43,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:44,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:04:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:44,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:04:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:44,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:44,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2022-04-27 13:04:44,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(<= ~counter~0 0)} {865#true} #108#return; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} call #t~ret9 := main(); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(<= ~counter~0 0)} ~cond := #in~cond; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == ~cond); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} #94#return; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,170 INFO L272 TraceCheckUtils]: 11: Hoare triple {873#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~counter~0 0)} ~cond := #in~cond; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == ~cond); {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,171 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} #96#return; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {873#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:44,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {922#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:44,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {922#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:44,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {922#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:44,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {932#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:04:44,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {866#false} is VALID [2022-04-27 13:04:44,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {866#false} is VALID [2022-04-27 13:04:44,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {866#false} is VALID [2022-04-27 13:04:44,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} assume !(#t~post6 < 5);havoc #t~post6; {866#false} is VALID [2022-04-27 13:04:44,174 INFO L272 TraceCheckUtils]: 25: Hoare triple {866#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {866#false} is VALID [2022-04-27 13:04:44,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} ~cond := #in~cond; {866#false} is VALID [2022-04-27 13:04:44,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} assume 0 == ~cond; {866#false} is VALID [2022-04-27 13:04:44,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-04-27 13:04:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:44,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346814760] [2022-04-27 13:04:44,175 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150566947] [2022-04-27 13:04:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150566947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:04:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349637487] [2022-04-27 13:04:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 13:04:44,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:44,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,196 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 13:04:44,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:04:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:04:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:44,197 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:44,314 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-27 13:04:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:04:44,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-27 13:04:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-27 13:04:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-27 13:04:44,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-27 13:04:44,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:44,372 INFO L225 Difference]: With dead ends: 62 [2022-04-27 13:04:44,372 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 13:04:44,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:44,374 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:44,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:44,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 13:04:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 13:04:44,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:44,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,392 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,393 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:44,394 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 13:04:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 13:04:44,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:44,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:44,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 13:04:44,395 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-27 13:04:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:44,396 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 13:04:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 13:04:44,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:44,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:44,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:44,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:04:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-27 13:04:44,398 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-27 13:04:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:44,398 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-27 13:04:44,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 13:04:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:04:44,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:44,399 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:44,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:44,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 795698770, now seen corresponding path program 1 times [2022-04-27 13:04:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:44,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699638929] [2022-04-27 13:04:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:44,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:44,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249677863] [2022-04-27 13:04:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:44,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:44,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:44,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:04:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:44,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 13:04:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:44,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:45,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #108#return; {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret9 := main(); {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L272 TraceCheckUtils]: 6: Hoare triple {1183#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1183#true} is VALID [2022-04-27 13:04:45,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-27 13:04:45,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-27 13:04:45,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-27 13:04:45,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1183#true} #94#return; {1183#true} is VALID [2022-04-27 13:04:45,065 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1183#true} is VALID [2022-04-27 13:04:45,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:45,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:45,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:45,069 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} {1183#true} #96#return; {1235#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:45,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 5);havoc #t~post8; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:45,075 INFO L272 TraceCheckUtils]: 25: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:45,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:45,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1184#false} is VALID [2022-04-27 13:04:45,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-27 13:04:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:45,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699638929] [2022-04-27 13:04:45,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249677863] [2022-04-27 13:04:45,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249677863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:45,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:45,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 13:04:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165504539] [2022-04-27 13:04:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 13:04:45,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:45,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,114 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 13:04:45,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:04:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:04:45,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:04:45,115 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:45,636 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-27 13:04:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 13:04:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 13:04:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-27 13:04:45,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-27 13:04:45,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:45,713 INFO L225 Difference]: With dead ends: 68 [2022-04-27 13:04:45,713 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 13:04:45,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:04:45,714 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:45,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 237 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 13:04:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-27 13:04:45,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:45,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,746 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,746 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:45,748 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-27 13:04:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-27 13:04:45,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:45,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:45,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-27 13:04:45,749 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-27 13:04:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:45,751 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-27 13:04:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-27 13:04:45,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:45,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:45,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:45,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 13:04:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-27 13:04:45,753 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-27 13:04:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:45,753 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-27 13:04:45,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:04:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-27 13:04:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 13:04:45,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:45,754 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, 1, 1, 1] [2022-04-27 13:04:45,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 13:04:45,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:45,969 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-27 13:04:45,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:45,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365909149] [2022-04-27 13:04:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:45,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:45,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396141281] [2022-04-27 13:04:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:45,990 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:45,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:04:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:46,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:04:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:46,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:46,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-27 13:04:46,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#(<= ~counter~0 0)} {1597#true} #108#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#(<= ~counter~0 0)} call #t~ret9 := main(); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#(<= ~counter~0 0)} ~cond := #in~cond; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#(<= ~counter~0 0)} assume !(0 == ~cond); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} #94#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,211 INFO L272 TraceCheckUtils]: 11: Hoare triple {1605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(<= ~counter~0 0)} ~cond := #in~cond; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(<= ~counter~0 0)} assume !(0 == ~cond); {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,213 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} #96#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1605#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:46,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1654#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:46,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1654#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:46,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1654#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:46,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {1664#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {1664#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {1664#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1677#(<= |main_#t~post6| 2)} is VALID [2022-04-27 13:04:46,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1598#false} is VALID [2022-04-27 13:04:46,219 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1598#false} is VALID [2022-04-27 13:04:46,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} ~cond := #in~cond; {1598#false} is VALID [2022-04-27 13:04:46,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} assume 0 == ~cond; {1598#false} is VALID [2022-04-27 13:04:46,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-27 13:04:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:46,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:46,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-27 13:04:46,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} assume 0 == ~cond; {1598#false} is VALID [2022-04-27 13:04:46,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} ~cond := #in~cond; {1598#false} is VALID [2022-04-27 13:04:46,390 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1598#false} is VALID [2022-04-27 13:04:46,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {1705#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1598#false} is VALID [2022-04-27 13:04:46,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#(< |main_#t~post6| 5)} is VALID [2022-04-27 13:04:46,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(< ~counter~0 5)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1709#(< ~counter~0 5)} is VALID [2022-04-27 13:04:46,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#(< ~counter~0 5)} assume !(~c~0 >= ~b~0); {1709#(< ~counter~0 5)} is VALID [2022-04-27 13:04:46,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#(< ~counter~0 5)} assume !!(#t~post7 < 5);havoc #t~post7; {1709#(< ~counter~0 5)} is VALID [2022-04-27 13:04:46,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {1722#(< ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1709#(< ~counter~0 5)} is VALID [2022-04-27 13:04:46,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< ~counter~0 4)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1722#(< ~counter~0 4)} is VALID [2022-04-27 13:04:46,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1722#(< ~counter~0 4)} is VALID [2022-04-27 13:04:46,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {1664#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1722#(< ~counter~0 4)} is VALID [2022-04-27 13:04:46,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {1664#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,411 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1597#true} {1664#(<= ~counter~0 2)} #96#return; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-27 13:04:46,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-27 13:04:46,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-27 13:04:46,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {1664#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1597#true} is VALID [2022-04-27 13:04:46,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1597#true} {1664#(<= ~counter~0 2)} #94#return; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-27 13:04:46,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-27 13:04:46,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-27 13:04:46,415 INFO L272 TraceCheckUtils]: 6: Hoare triple {1664#(<= ~counter~0 2)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1597#true} is VALID [2022-04-27 13:04:46,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#(<= ~counter~0 2)} call #t~ret9 := main(); {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#(<= ~counter~0 2)} {1597#true} #108#return; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#(<= ~counter~0 2)} assume true; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1664#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:46,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-27 13:04:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:46,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:46,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365909149] [2022-04-27 13:04:46,417 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:46,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396141281] [2022-04-27 13:04:46,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396141281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:46,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:46,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-27 13:04:46,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10741896] [2022-04-27 13:04:46,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-27 13:04:46,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:46,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:46,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:46,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:04:46,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:46,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:04:46,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:04:46,443 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:46,785 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2022-04-27 13:04:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:04:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-27 13:04:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-04-27 13:04:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-04-27 13:04:46,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 114 transitions. [2022-04-27 13:04:46,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:46,867 INFO L225 Difference]: With dead ends: 116 [2022-04-27 13:04:46,867 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 13:04:46,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:04:46,868 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 81 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:46,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:04:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 13:04:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2022-04-27 13:04:46,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:46,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:46,932 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:46,933 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:46,936 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-27 13:04:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-27 13:04:46,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:46,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:46,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 109 states. [2022-04-27 13:04:46,937 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 109 states. [2022-04-27 13:04:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:46,940 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-27 13:04:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-27 13:04:46,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:46,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:46,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:46,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:04:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2022-04-27 13:04:46,943 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 30 [2022-04-27 13:04:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:46,944 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2022-04-27 13:04:46,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:04:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2022-04-27 13:04:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 13:04:46,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:46,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:46,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:47,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:47,161 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-27 13:04:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:47,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120523005] [2022-04-27 13:04:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:47,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:47,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635981790] [2022-04-27 13:04:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:47,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:47,175 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:47,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:04:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:47,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:04:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:47,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:47,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} call ULTIMATE.init(); {2316#true} is VALID [2022-04-27 13:04:47,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2316#true} is VALID [2022-04-27 13:04:47,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-27 13:04:47,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #108#return; {2316#true} is VALID [2022-04-27 13:04:47,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret9 := main(); {2316#true} is VALID [2022-04-27 13:04:47,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2316#true} is VALID [2022-04-27 13:04:47,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {2316#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2316#true} is VALID [2022-04-27 13:04:47,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} ~cond := #in~cond; {2342#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:47,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:47,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:47,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} {2316#true} #94#return; {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:47,347 INFO L272 TraceCheckUtils]: 11: Hoare triple {2353#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2316#true} is VALID [2022-04-27 13:04:47,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {2316#true} ~cond := #in~cond; {2316#true} is VALID [2022-04-27 13:04:47,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#true} assume !(0 == ~cond); {2316#true} is VALID [2022-04-27 13:04:47,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-27 13:04:47,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2316#true} {2353#(<= 1 main_~x~0)} #96#return; {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:47,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {2353#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {2372#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {2382#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {2395#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {2395#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {2395#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2317#false} is VALID [2022-04-27 13:04:47,351 INFO L272 TraceCheckUtils]: 27: Hoare triple {2317#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2317#false} is VALID [2022-04-27 13:04:47,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {2317#false} ~cond := #in~cond; {2317#false} is VALID [2022-04-27 13:04:47,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {2317#false} assume 0 == ~cond; {2317#false} is VALID [2022-04-27 13:04:47,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-27 13:04:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:47,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:47,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-27 13:04:47,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {2317#false} assume 0 == ~cond; {2317#false} is VALID [2022-04-27 13:04:47,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {2317#false} ~cond := #in~cond; {2317#false} is VALID [2022-04-27 13:04:47,513 INFO L272 TraceCheckUtils]: 27: Hoare triple {2317#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2317#false} is VALID [2022-04-27 13:04:47,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {2395#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2317#false} is VALID [2022-04-27 13:04:47,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {2395#(<= 1 main_~b~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {2395#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,514 INFO L290 TraceCheckUtils]: 23: Hoare triple {2382#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2395#(<= 1 main_~b~0)} is VALID [2022-04-27 13:04:47,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {2382#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {2382#(<= 1 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {2382#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {2372#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2382#(<= 1 main_~c~0)} is VALID [2022-04-27 13:04:47,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {2372#(<= 1 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {2353#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2372#(<= 1 main_~a~0)} is VALID [2022-04-27 13:04:47,530 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2316#true} {2353#(<= 1 main_~x~0)} #96#return; {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:47,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-27 13:04:47,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {2316#true} assume !(0 == ~cond); {2316#true} is VALID [2022-04-27 13:04:47,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {2316#true} ~cond := #in~cond; {2316#true} is VALID [2022-04-27 13:04:47,530 INFO L272 TraceCheckUtils]: 11: Hoare triple {2353#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2316#true} is VALID [2022-04-27 13:04:47,532 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} {2316#true} #94#return; {2353#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:47,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:47,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {2486#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2346#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:47,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} ~cond := #in~cond; {2486#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 13:04:47,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {2316#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2316#true} is VALID [2022-04-27 13:04:47,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2316#true} is VALID [2022-04-27 13:04:47,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret9 := main(); {2316#true} is VALID [2022-04-27 13:04:47,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #108#return; {2316#true} is VALID [2022-04-27 13:04:47,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-27 13:04:47,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2316#true} is VALID [2022-04-27 13:04:47,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} call ULTIMATE.init(); {2316#true} is VALID [2022-04-27 13:04:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120523005] [2022-04-27 13:04:47,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635981790] [2022-04-27 13:04:47,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635981790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:47,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:47,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 13:04:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050654761] [2022-04-27 13:04:47,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 31 [2022-04-27 13:04:47,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:47,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 13:04:47,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:47,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:04:47,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:47,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:04:47,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:04:47,557 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 13:04:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:48,224 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2022-04-27 13:04:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 31 [2022-04-27 13:04:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 13:04:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 13:04:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 13:04:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-27 13:04:48,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-27 13:04:48,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:48,344 INFO L225 Difference]: With dead ends: 186 [2022-04-27 13:04:48,344 INFO L226 Difference]: Without dead ends: 174 [2022-04-27 13:04:48,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-27 13:04:48,345 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 117 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:48,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 252 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:04:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-27 13:04:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2022-04-27 13:04:48,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:48,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:48,500 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:48,501 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:48,507 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-27 13:04:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2022-04-27 13:04:48,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:48,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:48,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 174 states. [2022-04-27 13:04:48,509 INFO L87 Difference]: Start difference. First operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 174 states. [2022-04-27 13:04:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:48,515 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-27 13:04:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2022-04-27 13:04:48,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:48,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:48,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:48,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-27 13:04:48,521 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 31 [2022-04-27 13:04:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:48,521 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-27 13:04:48,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 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 13:04:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-27 13:04:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 13:04:48,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:48,522 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:48,547 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 13:04:48,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:48,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash 495607521, now seen corresponding path program 1 times [2022-04-27 13:04:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:48,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823619823] [2022-04-27 13:04:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:48,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:48,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95560274] [2022-04-27 13:04:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:48,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:48,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:48,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:48,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:04:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:48,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 13:04:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:48,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:49,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {3328#true} call ULTIMATE.init(); {3328#true} is VALID [2022-04-27 13:04:49,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {3328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {3328#true} assume true; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3328#true} {3328#true} #108#return; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {3328#true} call #t~ret9 := main(); {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {3328#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {3328#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {3328#true} ~cond := #in~cond; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {3328#true} assume !(0 == ~cond); {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {3328#true} assume true; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3328#true} {3328#true} #94#return; {3328#true} is VALID [2022-04-27 13:04:49,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {3328#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3328#true} is VALID [2022-04-27 13:04:49,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {3328#true} ~cond := #in~cond; {3369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:49,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {3369#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:49,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {3373#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3373#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:49,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3373#(not (= |assume_abort_if_not_#in~cond| 0))} {3328#true} #96#return; {3380#(<= 1 main_~y~0)} is VALID [2022-04-27 13:04:49,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {3380#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {3384#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {3394#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post8 < 5);havoc #t~post8; {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,137 INFO L272 TraceCheckUtils]: 25: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3328#true} is VALID [2022-04-27 13:04:49,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {3328#true} ~cond := #in~cond; {3328#true} is VALID [2022-04-27 13:04:49,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {3328#true} assume !(0 == ~cond); {3328#true} is VALID [2022-04-27 13:04:49,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {3328#true} assume true; {3328#true} is VALID [2022-04-27 13:04:49,139 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3328#true} {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #98#return; {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-27 13:04:49,140 INFO L272 TraceCheckUtils]: 30: Hoare triple {3404#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3429#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:49,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {3429#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3433#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:49,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {3433#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3329#false} is VALID [2022-04-27 13:04:49,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {3329#false} assume !false; {3329#false} is VALID [2022-04-27 13:04:49,141 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 13:04:49,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:49,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823619823] [2022-04-27 13:04:49,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:49,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95560274] [2022-04-27 13:04:49,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95560274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:49,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:49,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 13:04:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136649986] [2022-04-27 13:04:49,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 34 [2022-04-27 13:04:49,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:49,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 13:04:49,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:49,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:04:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:04:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:04:49,168 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 13:04:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:49,842 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2022-04-27 13:04:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 13:04:49,843 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 34 [2022-04-27 13:04:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 13:04:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-27 13:04:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 13:04:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-27 13:04:49,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-04-27 13:04:49,921 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 13:04:49,923 INFO L225 Difference]: With dead ends: 156 [2022-04-27 13:04:49,923 INFO L226 Difference]: Without dead ends: 154 [2022-04-27 13:04:49,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-27 13:04:49,924 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:49,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 241 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-27 13:04:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2022-04-27 13:04:50,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:50,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:50,074 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:50,076 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:50,081 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-27 13:04:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-04-27 13:04:50,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:50,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:50,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 154 states. [2022-04-27 13:04:50,083 INFO L87 Difference]: Start difference. First operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 154 states. [2022-04-27 13:04:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:50,086 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-27 13:04:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-04-27 13:04:50,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:50,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:50,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:50,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 13:04:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-04-27 13:04:50,100 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 34 [2022-04-27 13:04:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:50,100 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-04-27 13:04:50,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 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 13:04:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-04-27 13:04:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:04:50,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:50,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:50,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:50,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:50,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:50,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-27 13:04:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:50,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833004581] [2022-04-27 13:04:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:50,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:50,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126113812] [2022-04-27 13:04:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:50,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:50,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:50,325 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:50,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:04:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:50,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 13:04:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:50,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:50,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {4177#true} call ULTIMATE.init(); {4177#true} is VALID [2022-04-27 13:04:50,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4177#true} is VALID [2022-04-27 13:04:50,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-04-27 13:04:50,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} #108#return; {4177#true} is VALID [2022-04-27 13:04:50,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#true} call #t~ret9 := main(); {4177#true} is VALID [2022-04-27 13:04:50,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4177#true} is VALID [2022-04-27 13:04:50,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {4177#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4177#true} is VALID [2022-04-27 13:04:50,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#true} ~cond := #in~cond; {4203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:04:50,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:50,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {4207#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:04:50,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4207#(not (= |assume_abort_if_not_#in~cond| 0))} {4177#true} #94#return; {4214#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:50,617 INFO L272 TraceCheckUtils]: 11: Hoare triple {4214#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4177#true} is VALID [2022-04-27 13:04:50,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~cond := #in~cond; {4177#true} is VALID [2022-04-27 13:04:50,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} assume !(0 == ~cond); {4177#true} is VALID [2022-04-27 13:04:50,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-04-27 13:04:50,618 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4177#true} {4214#(<= 1 main_~x~0)} #96#return; {4214#(<= 1 main_~x~0)} is VALID [2022-04-27 13:04:50,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {4214#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 13:04:50,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {4233#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,629 INFO L290 TraceCheckUtils]: 31: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post8 < 5);havoc #t~post8; {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:04:50,630 INFO L272 TraceCheckUtils]: 32: Hoare triple {4255#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:50,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:50,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {4287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4178#false} is VALID [2022-04-27 13:04:50,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {4178#false} assume !false; {4178#false} is VALID [2022-04-27 13:04:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 13:04:50,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:50,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {4178#false} assume !false; {4178#false} is VALID [2022-04-27 13:04:50,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {4287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4178#false} is VALID [2022-04-27 13:04:50,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:50,813 INFO L272 TraceCheckUtils]: 32: Hoare triple {4303#(= 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)); {4283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:50,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4303#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:50,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {4177#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4331#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:50,819 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4177#true} {4177#true} #96#return; {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {4177#true} assume !(0 == ~cond); {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {4177#true} ~cond := #in~cond; {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L272 TraceCheckUtils]: 11: Hoare triple {4177#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4177#true} {4177#true} #94#return; {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {4177#true} assume !(0 == ~cond); {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {4177#true} ~cond := #in~cond; {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L272 TraceCheckUtils]: 6: Hoare triple {4177#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4177#true} is VALID [2022-04-27 13:04:50,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {4177#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4177#true} is VALID [2022-04-27 13:04:50,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {4177#true} call #t~ret9 := main(); {4177#true} is VALID [2022-04-27 13:04:50,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4177#true} {4177#true} #108#return; {4177#true} is VALID [2022-04-27 13:04:50,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {4177#true} assume true; {4177#true} is VALID [2022-04-27 13:04:50,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4177#true} is VALID [2022-04-27 13:04:50,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {4177#true} call ULTIMATE.init(); {4177#true} is VALID [2022-04-27 13:04:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:50,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833004581] [2022-04-27 13:04:50,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:50,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126113812] [2022-04-27 13:04:50,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126113812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:50,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:50,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-27 13:04:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943683977] [2022-04-27 13:04:50,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:50,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:04:50,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:50,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:50,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:50,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 13:04:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 13:04:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:04:50,858 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:51,663 INFO L93 Difference]: Finished difference Result 178 states and 239 transitions. [2022-04-27 13:04:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:04:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:04:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 13:04:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-27 13:04:51,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-27 13:04:51,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:51,748 INFO L225 Difference]: With dead ends: 178 [2022-04-27 13:04:51,749 INFO L226 Difference]: Without dead ends: 176 [2022-04-27 13:04:51,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:04:51,749 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 61 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:51,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 357 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:04:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-27 13:04:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2022-04-27 13:04:51,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:51,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:51,923 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:51,924 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:51,928 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-27 13:04:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2022-04-27 13:04:51,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:51,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:51,929 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 176 states. [2022-04-27 13:04:51,929 INFO L87 Difference]: Start difference. First operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 176 states. [2022-04-27 13:04:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:51,932 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-27 13:04:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2022-04-27 13:04:51,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:51,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:51,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:51,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2022-04-27 13:04:51,936 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 36 [2022-04-27 13:04:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:51,936 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2022-04-27 13:04:51,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:04:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-04-27 13:04:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:04:51,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:51,937 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:51,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:52,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 13:04:52,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:52,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash -892181054, now seen corresponding path program 1 times [2022-04-27 13:04:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:52,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174405427] [2022-04-27 13:04:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:52,175 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:52,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1966997399] [2022-04-27 13:04:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:52,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:52,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:52,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:52,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:04:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:52,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:04:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:52,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:52,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {5257#true} call ULTIMATE.init(); {5257#true} is VALID [2022-04-27 13:04:52,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {5257#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {5265#(<= ~counter~0 0)} assume true; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5265#(<= ~counter~0 0)} {5257#true} #108#return; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {5265#(<= ~counter~0 0)} call #t~ret9 := main(); {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {5265#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,373 INFO L272 TraceCheckUtils]: 6: Hoare triple {5265#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {5265#(<= ~counter~0 0)} ~cond := #in~cond; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#(<= ~counter~0 0)} assume !(0 == ~cond); {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {5265#(<= ~counter~0 0)} assume true; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5265#(<= ~counter~0 0)} {5265#(<= ~counter~0 0)} #94#return; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,379 INFO L272 TraceCheckUtils]: 11: Hoare triple {5265#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {5265#(<= ~counter~0 0)} ~cond := #in~cond; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {5265#(<= ~counter~0 0)} assume !(0 == ~cond); {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {5265#(<= ~counter~0 0)} assume true; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,381 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5265#(<= ~counter~0 0)} {5265#(<= ~counter~0 0)} #96#return; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {5265#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5265#(<= ~counter~0 0)} is VALID [2022-04-27 13:04:52,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {5265#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5314#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:52,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {5314#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {5314#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:52,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {5314#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5314#(<= ~counter~0 1)} is VALID [2022-04-27 13:04:52,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {5314#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5324#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:52,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {5324#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {5324#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:52,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {5324#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5324#(<= ~counter~0 2)} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {5324#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5334#(<= |main_#t~post8| 2)} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {5334#(<= |main_#t~post8| 2)} assume !(#t~post8 < 5);havoc #t~post8; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {5258#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {5258#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {5258#false} assume !(#t~post7 < 5);havoc #t~post7; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {5258#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {5258#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {5258#false} assume !!(#t~post6 < 5);havoc #t~post6; {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {5258#false} assume !(0 != ~b~0); {5258#false} is VALID [2022-04-27 13:04:52,387 INFO L272 TraceCheckUtils]: 32: Hoare triple {5258#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5258#false} is VALID [2022-04-27 13:04:52,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {5258#false} ~cond := #in~cond; {5258#false} is VALID [2022-04-27 13:04:52,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {5258#false} assume 0 == ~cond; {5258#false} is VALID [2022-04-27 13:04:52,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {5258#false} assume !false; {5258#false} is VALID [2022-04-27 13:04:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:52,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174405427] [2022-04-27 13:04:52,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966997399] [2022-04-27 13:04:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966997399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:52,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:52,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:04:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865058788] [2022-04-27 13:04:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:52,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 13:04:52,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:52,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:52,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:52,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:04:52,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:52,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:04:52,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:52,413 INFO L87 Difference]: Start difference. First operand 173 states and 234 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:52,652 INFO L93 Difference]: Finished difference Result 240 states and 327 transitions. [2022-04-27 13:04:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:04:52,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-27 13:04:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-27 13:04:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-27 13:04:52,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-27 13:04:52,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:52,711 INFO L225 Difference]: With dead ends: 240 [2022-04-27 13:04:52,711 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 13:04:52,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:52,712 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:52,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 115 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 13:04:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-27 13:04:52,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:52,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:52,889 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:52,889 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:52,892 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-27 13:04:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-27 13:04:52,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:52,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:52,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 173 states. [2022-04-27 13:04:52,893 INFO L87 Difference]: Start difference. First operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 173 states. [2022-04-27 13:04:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:52,896 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-27 13:04:52,896 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-27 13:04:52,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:52,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:52,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:52,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-27 13:04:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-04-27 13:04:52,900 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 36 [2022-04-27 13:04:52,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:52,900 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-04-27 13:04:52,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:04:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-27 13:04:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 13:04:52,901 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:52,901 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:52,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:53,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 13:04:53,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-27 13:04:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:53,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620824554] [2022-04-27 13:04:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:53,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:53,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:53,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461950780] [2022-04-27 13:04:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:53,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:53,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:53,125 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:53,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 13:04:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:53,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:04:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:53,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:55,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {6300#true} call ULTIMATE.init(); {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {6300#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6300#true} {6300#true} #108#return; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {6300#true} call #t~ret9 := main(); {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {6300#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {6300#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6300#true} {6300#true} #94#return; {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L272 TraceCheckUtils]: 11: Hoare triple {6300#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6300#true} is VALID [2022-04-27 13:04:55,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6300#true} {6300#true} #96#return; {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {6300#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {6300#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {6300#true} assume !!(#t~post6 < 5);havoc #t~post6; {6300#true} is VALID [2022-04-27 13:04:55,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {6300#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 5);havoc #t~post7; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post8 < 5);havoc #t~post8; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,304 INFO L272 TraceCheckUtils]: 25: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 13:04:55,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 13:04:55,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 13:04:55,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 13:04:55,305 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6300#true} {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #98#return; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,305 INFO L272 TraceCheckUtils]: 30: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6300#true} is VALID [2022-04-27 13:04:55,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {6300#true} ~cond := #in~cond; {6300#true} is VALID [2022-04-27 13:04:55,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {6300#true} assume !(0 == ~cond); {6300#true} is VALID [2022-04-27 13:04:55,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {6300#true} assume true; {6300#true} is VALID [2022-04-27 13:04:55,306 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6300#true} {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #100#return; {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-27 13:04:55,306 INFO L272 TraceCheckUtils]: 35: Hoare triple {6362#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:55,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {6411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:55,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {6415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6301#false} is VALID [2022-04-27 13:04:55,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {6301#false} assume !false; {6301#false} is VALID [2022-04-27 13:04:55,307 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 13:04:55,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:04:55,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:55,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620824554] [2022-04-27 13:04:55,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:55,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461950780] [2022-04-27 13:04:55,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461950780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:04:55,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:04:55,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:04:55,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408582173] [2022-04-27 13:04:55,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:04:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 39 [2022-04-27 13:04:55,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:55,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:04:55,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:55,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:04:55,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:04:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:04:55,328 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:04:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:55,776 INFO L93 Difference]: Finished difference Result 238 states and 333 transitions. [2022-04-27 13:04:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:04:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 39 [2022-04-27 13:04:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:04:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:04:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:04:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:04:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:04:55,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 13:04:55,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:55,828 INFO L225 Difference]: With dead ends: 238 [2022-04-27 13:04:55,828 INFO L226 Difference]: Without dead ends: 236 [2022-04-27 13:04:55,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:04:55,829 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:04:55,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:04:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-27 13:04:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2022-04-27 13:04:56,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:04:56,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:56,057 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:56,057 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:56,062 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-27 13:04:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2022-04-27 13:04:56,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:56,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:56,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 236 states. [2022-04-27 13:04:56,064 INFO L87 Difference]: Start difference. First operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 236 states. [2022-04-27 13:04:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:04:56,069 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-27 13:04:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2022-04-27 13:04:56,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:04:56,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:04:56,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:04:56,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:04:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 13:04:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2022-04-27 13:04:56,075 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 39 [2022-04-27 13:04:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:04:56,075 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2022-04-27 13:04:56,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:04:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2022-04-27 13:04:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:04:56,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:04:56,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:04:56,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 13:04:56,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 13:04:56,291 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:04:56,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:04:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-27 13:04:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:04:56,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203270117] [2022-04-27 13:04:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:04:56,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:04:56,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959183722] [2022-04-27 13:04:56,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:04:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:04:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:04:56,310 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:04:56,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 13:04:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:56,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 13:04:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:04:56,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:04:58,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {7568#true} call ULTIMATE.init(); {7568#true} is VALID [2022-04-27 13:04:58,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {7568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7568#true} is VALID [2022-04-27 13:04:58,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:58,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7568#true} {7568#true} #108#return; {7568#true} is VALID [2022-04-27 13:04:58,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {7568#true} call #t~ret9 := main(); {7568#true} is VALID [2022-04-27 13:04:58,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {7568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7568#true} is VALID [2022-04-27 13:04:58,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {7568#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {7568#true} ~cond := #in~cond; {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {7568#true} assume !(0 == ~cond); {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7568#true} {7568#true} #94#return; {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {7568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#true} ~cond := #in~cond; {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {7568#true} assume !(0 == ~cond); {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7568#true} {7568#true} #96#return; {7568#true} is VALID [2022-04-27 13:04:58,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {7568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {7621#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:04:58,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {7631#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post8 < 5);havoc #t~post8; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,654 INFO L272 TraceCheckUtils]: 32: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7568#true} is VALID [2022-04-27 13:04:58,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {7568#true} ~cond := #in~cond; {7568#true} is VALID [2022-04-27 13:04:58,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {7568#true} assume !(0 == ~cond); {7568#true} is VALID [2022-04-27 13:04:58,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:58,655 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7568#true} {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #98#return; {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-27 13:04:58,655 INFO L272 TraceCheckUtils]: 37: Hoare triple {7644#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:58,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:58,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {7691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7569#false} is VALID [2022-04-27 13:04:58,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {7569#false} assume !false; {7569#false} is VALID [2022-04-27 13:04:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:58,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:04:58,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {7569#false} assume !false; {7569#false} is VALID [2022-04-27 13:04:58,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {7691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7569#false} is VALID [2022-04-27 13:04:58,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:04:58,829 INFO L272 TraceCheckUtils]: 37: Hoare triple {7707#(= 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)); {7687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:04:58,829 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7568#true} {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:58,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {7568#true} assume !(0 == ~cond); {7568#true} is VALID [2022-04-27 13:04:58,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {7568#true} ~cond := #in~cond; {7568#true} is VALID [2022-04-27 13:04:58,830 INFO L272 TraceCheckUtils]: 32: Hoare triple {7707#(= 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)); {7568#true} is VALID [2022-04-27 13:04:58,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 5);havoc #t~post8; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:58,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:59,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7707#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 13:04:59,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 13:04:59,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 13:04:59,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 13:04:59,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7750#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-27 13:04:59,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:59,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {7568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7763#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:04:59,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7568#true} {7568#true} #96#return; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {7568#true} assume !(0 == ~cond); {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {7568#true} ~cond := #in~cond; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L272 TraceCheckUtils]: 11: Hoare triple {7568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7568#true} {7568#true} #94#return; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {7568#true} assume !(0 == ~cond); {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {7568#true} ~cond := #in~cond; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {7568#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {7568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7568#true} is VALID [2022-04-27 13:04:59,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {7568#true} call #t~ret9 := main(); {7568#true} is VALID [2022-04-27 13:04:59,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7568#true} {7568#true} #108#return; {7568#true} is VALID [2022-04-27 13:04:59,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {7568#true} assume true; {7568#true} is VALID [2022-04-27 13:04:59,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {7568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7568#true} is VALID [2022-04-27 13:04:59,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {7568#true} call ULTIMATE.init(); {7568#true} is VALID [2022-04-27 13:04:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:04:59,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:04:59,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203270117] [2022-04-27 13:04:59,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:04:59,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959183722] [2022-04-27 13:04:59,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959183722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:04:59,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:04:59,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 13:04:59,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281031398] [2022-04-27 13:04:59,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:04:59,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-27 13:04:59,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:04:59,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:04:59,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:04:59,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:04:59,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:04:59,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:04:59,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:04:59,564 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:01,746 INFO L93 Difference]: Finished difference Result 391 states and 576 transitions. [2022-04-27 13:05:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:05:01,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-27 13:05:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-27 13:05:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-27 13:05:01,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 252 transitions. [2022-04-27 13:05:02,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:02,168 INFO L225 Difference]: With dead ends: 391 [2022-04-27 13:05:02,169 INFO L226 Difference]: Without dead ends: 389 [2022-04-27 13:05:02,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:05:02,169 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 162 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:02,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 318 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 13:05:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-27 13:05:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 376. [2022-04-27 13:05:02,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:02,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:02,538 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:02,538 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:02,548 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-27 13:05:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2022-04-27 13:05:02,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:02,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:02,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) Second operand 389 states. [2022-04-27 13:05:02,550 INFO L87 Difference]: Start difference. First operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) Second operand 389 states. [2022-04-27 13:05:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:02,559 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-27 13:05:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2022-04-27 13:05:02,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:02,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:02,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:02,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-27 13:05:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 561 transitions. [2022-04-27 13:05:02,571 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 561 transitions. Word has length 41 [2022-04-27 13:05:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:02,571 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 561 transitions. [2022-04-27 13:05:02,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:05:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 561 transitions. [2022-04-27 13:05:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 13:05:02,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:02,571 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, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:02,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:02,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-27 13:05:02,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-27 13:05:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:02,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880121813] [2022-04-27 13:05:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:02,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:02,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1315341029] [2022-04-27 13:05:02,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:02,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:02,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:02,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:02,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 13:05:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:02,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:05:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:02,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:02,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {9735#true} call ULTIMATE.init(); {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {9735#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {9735#true} assume true; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9735#true} {9735#true} #108#return; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {9735#true} call #t~ret9 := main(); {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {9735#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {9735#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {9735#true} ~cond := #in~cond; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {9735#true} assume !(0 == ~cond); {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {9735#true} assume true; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9735#true} {9735#true} #94#return; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L272 TraceCheckUtils]: 11: Hoare triple {9735#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {9735#true} ~cond := #in~cond; {9735#true} is VALID [2022-04-27 13:05:02,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {9735#true} assume !(0 == ~cond); {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {9735#true} assume true; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9735#true} {9735#true} #96#return; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {9735#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {9735#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {9735#true} assume !!(#t~post6 < 5);havoc #t~post6; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {9735#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {9735#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {9735#true} assume !!(#t~post7 < 5);havoc #t~post7; {9735#true} is VALID [2022-04-27 13:05:02,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {9735#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:02,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:02,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(#t~post8 < 5);havoc #t~post8; {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:02,974 INFO L272 TraceCheckUtils]: 25: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9735#true} is VALID [2022-04-27 13:05:02,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {9735#true} ~cond := #in~cond; {9735#true} is VALID [2022-04-27 13:05:02,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {9735#true} assume !(0 == ~cond); {9735#true} is VALID [2022-04-27 13:05:02,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {9735#true} assume true; {9735#true} is VALID [2022-04-27 13:05:02,975 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9735#true} {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #98#return; {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:02,975 INFO L272 TraceCheckUtils]: 30: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9735#true} is VALID [2022-04-27 13:05:02,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {9735#true} ~cond := #in~cond; {9735#true} is VALID [2022-04-27 13:05:02,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {9735#true} assume !(0 == ~cond); {9735#true} is VALID [2022-04-27 13:05:02,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {9735#true} assume true; {9735#true} is VALID [2022-04-27 13:05:02,976 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9735#true} {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #100#return; {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:02,976 INFO L272 TraceCheckUtils]: 35: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9735#true} is VALID [2022-04-27 13:05:02,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {9735#true} ~cond := #in~cond; {9735#true} is VALID [2022-04-27 13:05:02,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {9735#true} assume !(0 == ~cond); {9735#true} is VALID [2022-04-27 13:05:02,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {9735#true} assume true; {9735#true} is VALID [2022-04-27 13:05:02,976 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9735#true} {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-27 13:05:02,977 INFO L272 TraceCheckUtils]: 40: Hoare triple {9806#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {9861#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:02,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {9861#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9865#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:02,978 INFO L290 TraceCheckUtils]: 42: Hoare triple {9865#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9736#false} is VALID [2022-04-27 13:05:02,978 INFO L290 TraceCheckUtils]: 43: Hoare triple {9736#false} assume !false; {9736#false} is VALID [2022-04-27 13:05:02,978 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 13:05:02,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:05:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:02,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880121813] [2022-04-27 13:05:02,978 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:02,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315341029] [2022-04-27 13:05:02,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315341029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:05:02,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:05:02,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:05:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534971175] [2022-04-27 13:05:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:05:02,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-27 13:05:02,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:02,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:03,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:03,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:05:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:05:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:05:03,001 INFO L87 Difference]: Start difference. First operand 376 states and 561 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:03,746 INFO L93 Difference]: Finished difference Result 560 states and 878 transitions. [2022-04-27 13:05:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:05:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-27 13:05:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:05:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-27 13:05:03,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-27 13:05:03,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:03,813 INFO L225 Difference]: With dead ends: 560 [2022-04-27 13:05:03,813 INFO L226 Difference]: Without dead ends: 558 [2022-04-27 13:05:03,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:05:03,815 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:03,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:05:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-04-27 13:05:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 494. [2022-04-27 13:05:04,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:04,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:04,409 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:04,410 INFO L87 Difference]: Start difference. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:04,427 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-27 13:05:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 875 transitions. [2022-04-27 13:05:04,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:04,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:04,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) Second operand 558 states. [2022-04-27 13:05:04,430 INFO L87 Difference]: Start difference. First operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) Second operand 558 states. [2022-04-27 13:05:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:04,447 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-27 13:05:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 875 transitions. [2022-04-27 13:05:04,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:04,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:04,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:04,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 772 transitions. [2022-04-27 13:05:04,467 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 772 transitions. Word has length 44 [2022-04-27 13:05:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:04,467 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 772 transitions. [2022-04-27 13:05:04,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 13:05:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 772 transitions. [2022-04-27 13:05:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:05:04,468 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:04,468 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:04,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:04,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 13:05:04,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:04,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1018638220, now seen corresponding path program 1 times [2022-04-27 13:05:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:04,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453516951] [2022-04-27 13:05:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:04,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:04,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046800589] [2022-04-27 13:05:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:04,699 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:04,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 13:05:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:04,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:05:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:04,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:04,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {12593#true} call ULTIMATE.init(); {12593#true} is VALID [2022-04-27 13:05:04,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {12593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {12601#(<= ~counter~0 0)} assume true; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12601#(<= ~counter~0 0)} {12593#true} #108#return; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {12601#(<= ~counter~0 0)} call #t~ret9 := main(); {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {12601#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {12601#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {12601#(<= ~counter~0 0)} ~cond := #in~cond; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {12601#(<= ~counter~0 0)} assume !(0 == ~cond); {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {12601#(<= ~counter~0 0)} assume true; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12601#(<= ~counter~0 0)} {12601#(<= ~counter~0 0)} #94#return; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,934 INFO L272 TraceCheckUtils]: 11: Hoare triple {12601#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {12601#(<= ~counter~0 0)} ~cond := #in~cond; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {12601#(<= ~counter~0 0)} assume !(0 == ~cond); {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {12601#(<= ~counter~0 0)} assume true; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,935 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12601#(<= ~counter~0 0)} {12601#(<= ~counter~0 0)} #96#return; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {12601#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12601#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:04,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {12601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:04,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {12650#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:04,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {12650#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:04,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {12650#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:04,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {12660#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:04,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {12660#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:04,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {12660#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:04,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {12660#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:04,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {12673#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:04,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {12673#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {12673#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12683#(<= |main_#t~post7| 3)} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {12683#(<= |main_#t~post7| 3)} assume !(#t~post7 < 5);havoc #t~post7; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {12594#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {12594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {12594#false} assume !!(#t~post6 < 5);havoc #t~post6; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {12594#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {12594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {12594#false} assume !(#t~post7 < 5);havoc #t~post7; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {12594#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {12594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12594#false} is VALID [2022-04-27 13:05:04,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {12594#false} assume !(#t~post6 < 5);havoc #t~post6; {12594#false} is VALID [2022-04-27 13:05:04,947 INFO L272 TraceCheckUtils]: 38: Hoare triple {12594#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {12594#false} is VALID [2022-04-27 13:05:04,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {12594#false} ~cond := #in~cond; {12594#false} is VALID [2022-04-27 13:05:04,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {12594#false} assume 0 == ~cond; {12594#false} is VALID [2022-04-27 13:05:04,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {12594#false} assume !false; {12594#false} is VALID [2022-04-27 13:05:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 13:05:04,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:05,155 INFO L290 TraceCheckUtils]: 41: Hoare triple {12594#false} assume !false; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {12594#false} assume 0 == ~cond; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {12594#false} ~cond := #in~cond; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L272 TraceCheckUtils]: 38: Hoare triple {12594#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {12594#false} assume !(#t~post6 < 5);havoc #t~post6; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {12594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {12594#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {12594#false} assume !(#t~post7 < 5);havoc #t~post7; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 33: Hoare triple {12594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {12594#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {12594#false} assume !!(#t~post6 < 5);havoc #t~post6; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {12594#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12594#false} is VALID [2022-04-27 13:05:05,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {12594#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12594#false} is VALID [2022-04-27 13:05:05,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {12765#(< |main_#t~post7| 5)} assume !(#t~post7 < 5);havoc #t~post7; {12594#false} is VALID [2022-04-27 13:05:05,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {12769#(< ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12765#(< |main_#t~post7| 5)} is VALID [2022-04-27 13:05:05,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {12769#(< ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12769#(< ~counter~0 5)} is VALID [2022-04-27 13:05:05,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {12769#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {12769#(< ~counter~0 5)} is VALID [2022-04-27 13:05:05,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {12673#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12769#(< ~counter~0 5)} is VALID [2022-04-27 13:05:05,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {12673#(<= ~counter~0 3)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:05,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {12673#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:05,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {12673#(<= ~counter~0 3)} assume !!(#t~post7 < 5);havoc #t~post7; {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:05,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {12660#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12673#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:05,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {12660#(<= ~counter~0 2)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:05,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {12660#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:05,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {12650#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12660#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:05,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {12650#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,161 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12593#true} {12650#(<= ~counter~0 1)} #96#return; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {12593#true} assume true; {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {12593#true} assume !(0 == ~cond); {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {12593#true} ~cond := #in~cond; {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L272 TraceCheckUtils]: 11: Hoare triple {12650#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12593#true} {12650#(<= ~counter~0 1)} #94#return; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {12593#true} assume true; {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {12593#true} assume !(0 == ~cond); {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {12593#true} ~cond := #in~cond; {12593#true} is VALID [2022-04-27 13:05:05,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {12650#(<= ~counter~0 1)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12593#true} is VALID [2022-04-27 13:05:05,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {12650#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {12650#(<= ~counter~0 1)} call #t~ret9 := main(); {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12650#(<= ~counter~0 1)} {12593#true} #108#return; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {12650#(<= ~counter~0 1)} assume true; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {12593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12650#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:05,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {12593#true} call ULTIMATE.init(); {12593#true} is VALID [2022-04-27 13:05:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 13:05:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453516951] [2022-04-27 13:05:05,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046800589] [2022-04-27 13:05:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046800589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:05,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:05,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-27 13:05:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160370192] [2022-04-27 13:05:05,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 13:05:05,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:05,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:05,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:05,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 13:05:05,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:05,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 13:05:05,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-27 13:05:05,208 INFO L87 Difference]: Start difference. First operand 494 states and 772 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:06,117 INFO L93 Difference]: Finished difference Result 859 states and 1366 transitions. [2022-04-27 13:05:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:05:06,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-27 13:05:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:05:06,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:05:06,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 13:05:06,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:06,217 INFO L225 Difference]: With dead ends: 859 [2022-04-27 13:05:06,217 INFO L226 Difference]: Without dead ends: 502 [2022-04-27 13:05:06,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:05:06,219 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 49 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:06,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 211 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:05:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-27 13:05:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2022-04-27 13:05:06,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:06,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:06,808 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:06,808 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:06,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:06,824 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-27 13:05:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 778 transitions. [2022-04-27 13:05:06,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:06,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:06,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 502 states. [2022-04-27 13:05:06,826 INFO L87 Difference]: Start difference. First operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 502 states. [2022-04-27 13:05:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:06,841 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-27 13:05:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 778 transitions. [2022-04-27 13:05:06,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:06,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:06,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:06,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 775 transitions. [2022-04-27 13:05:06,861 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 775 transitions. Word has length 42 [2022-04-27 13:05:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:06,861 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 775 transitions. [2022-04-27 13:05:06,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 13:05:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 775 transitions. [2022-04-27 13:05:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 13:05:06,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:06,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:06,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-27 13:05:07,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 13:05:07,078 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -772903697, now seen corresponding path program 1 times [2022-04-27 13:05:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556052159] [2022-04-27 13:05:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:07,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:07,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911951920] [2022-04-27 13:05:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:07,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:07,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:07,101 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:07,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 13:05:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:07,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:05:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:07,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:07,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {15963#true} call ULTIMATE.init(); {15963#true} is VALID [2022-04-27 13:05:07,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {15963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {15971#(<= ~counter~0 0)} assume true; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15971#(<= ~counter~0 0)} {15963#true} #108#return; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {15971#(<= ~counter~0 0)} call #t~ret9 := main(); {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {15971#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {15971#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {15971#(<= ~counter~0 0)} ~cond := #in~cond; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {15971#(<= ~counter~0 0)} assume !(0 == ~cond); {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {15971#(<= ~counter~0 0)} assume true; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15971#(<= ~counter~0 0)} {15971#(<= ~counter~0 0)} #94#return; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,388 INFO L272 TraceCheckUtils]: 11: Hoare triple {15971#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {15971#(<= ~counter~0 0)} ~cond := #in~cond; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {15971#(<= ~counter~0 0)} assume !(0 == ~cond); {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {15971#(<= ~counter~0 0)} assume true; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,389 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15971#(<= ~counter~0 0)} {15971#(<= ~counter~0 0)} #96#return; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {15971#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {15971#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16020#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:07,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16020#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:07,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {16020#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16020#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:07,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {16020#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {16030#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {16030#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {16030#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {16030#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16043#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:07,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {16043#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {16043#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:07,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {16043#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16043#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:07,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {16043#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16053#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:07,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {16053#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {16053#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:07,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {16053#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16053#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:07,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {16053#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16063#(<= |main_#t~post8| 4)} is VALID [2022-04-27 13:05:07,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {16063#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {15964#false} is VALID [2022-04-27 13:05:07,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {15964#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {15964#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {15964#false} assume !(#t~post7 < 5);havoc #t~post7; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {15964#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {15964#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {15964#false} assume !(#t~post6 < 5);havoc #t~post6; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L272 TraceCheckUtils]: 38: Hoare triple {15964#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {15964#false} assume 0 == ~cond; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {15964#false} assume !false; {15964#false} is VALID [2022-04-27 13:05:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:05:07,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {15964#false} assume !false; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {15964#false} assume 0 == ~cond; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {15964#false} ~cond := #in~cond; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L272 TraceCheckUtils]: 38: Hoare triple {15964#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {15964#false} assume !(#t~post6 < 5);havoc #t~post6; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {15964#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {15964#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {15964#false} assume !(#t~post7 < 5);havoc #t~post7; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {15964#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15964#false} is VALID [2022-04-27 13:05:07,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {15964#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {15964#false} is VALID [2022-04-27 13:05:07,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {16063#(<= |main_#t~post8| 4)} assume !(#t~post8 < 5);havoc #t~post8; {15964#false} is VALID [2022-04-27 13:05:07,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {16053#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16063#(<= |main_#t~post8| 4)} is VALID [2022-04-27 13:05:07,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {16053#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {16053#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:07,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {16053#(<= ~counter~0 4)} assume !!(#t~post7 < 5);havoc #t~post7; {16053#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:07,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {16043#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16053#(<= ~counter~0 4)} is VALID [2022-04-27 13:05:07,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {16043#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16043#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:07,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {16043#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {16043#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:07,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {16030#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16043#(<= ~counter~0 3)} is VALID [2022-04-27 13:05:07,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {16030#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {16030#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {16030#(<= ~counter~0 2)} assume !!(#t~post7 < 5);havoc #t~post7; {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {16020#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16030#(<= ~counter~0 2)} is VALID [2022-04-27 13:05:07,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {16020#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {16020#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:07,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {16020#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:07,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {15971#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16020#(<= ~counter~0 1)} is VALID [2022-04-27 13:05:07,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {15971#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,569 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15963#true} {15971#(<= ~counter~0 0)} #96#return; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {15963#true} assume true; {15963#true} is VALID [2022-04-27 13:05:07,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {15963#true} assume !(0 == ~cond); {15963#true} is VALID [2022-04-27 13:05:07,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2022-04-27 13:05:07,569 INFO L272 TraceCheckUtils]: 11: Hoare triple {15971#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {15963#true} is VALID [2022-04-27 13:05:07,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15963#true} {15971#(<= ~counter~0 0)} #94#return; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {15963#true} assume true; {15963#true} is VALID [2022-04-27 13:05:07,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {15963#true} assume !(0 == ~cond); {15963#true} is VALID [2022-04-27 13:05:07,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {15963#true} ~cond := #in~cond; {15963#true} is VALID [2022-04-27 13:05:07,570 INFO L272 TraceCheckUtils]: 6: Hoare triple {15971#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {15963#true} is VALID [2022-04-27 13:05:07,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {15971#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {15971#(<= ~counter~0 0)} call #t~ret9 := main(); {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15971#(<= ~counter~0 0)} {15963#true} #108#return; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {15971#(<= ~counter~0 0)} assume true; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {15963#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15971#(<= ~counter~0 0)} is VALID [2022-04-27 13:05:07,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {15963#true} call ULTIMATE.init(); {15963#true} is VALID [2022-04-27 13:05:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:05:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556052159] [2022-04-27 13:05:07,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911951920] [2022-04-27 13:05:07,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911951920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:07,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:07,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-27 13:05:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85992882] [2022-04-27 13:05:07,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:07,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-27 13:05:07,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:07,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:05:07,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:07,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:05:07,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:07,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:05:07,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:05:07,602 INFO L87 Difference]: Start difference. First operand 498 states and 775 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:05:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:08,484 INFO L93 Difference]: Finished difference Result 859 states and 1363 transitions. [2022-04-27 13:05:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:05:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-27 13:05:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:05:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-27 13:05:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:05:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2022-04-27 13:05:08,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 132 transitions. [2022-04-27 13:05:08,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:08,593 INFO L225 Difference]: With dead ends: 859 [2022-04-27 13:05:08,593 INFO L226 Difference]: Without dead ends: 504 [2022-04-27 13:05:08,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:05:08,596 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:08,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:05:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-04-27 13:05:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2022-04-27 13:05:09,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:09,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:09,246 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:09,247 INFO L87 Difference]: Start difference. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:09,274 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-27 13:05:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 778 transitions. [2022-04-27 13:05:09,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:09,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:09,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 504 states. [2022-04-27 13:05:09,277 INFO L87 Difference]: Start difference. First operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 504 states. [2022-04-27 13:05:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:09,292 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-27 13:05:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 778 transitions. [2022-04-27 13:05:09,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:09,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:09,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:09,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-27 13:05:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 777 transitions. [2022-04-27 13:05:09,313 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 777 transitions. Word has length 42 [2022-04-27 13:05:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:09,313 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 777 transitions. [2022-04-27 13:05:09,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:05:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 777 transitions. [2022-04-27 13:05:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:05:09,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:09,314 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:09,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:09,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:09,530 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1912500411, now seen corresponding path program 2 times [2022-04-27 13:05:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:09,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359396033] [2022-04-27 13:05:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:09,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:09,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798092585] [2022-04-27 13:05:09,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:05:09,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:09,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:09,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:09,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 13:05:09,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:05:09,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:05:09,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:05:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:09,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:09,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {19341#true} call ULTIMATE.init(); {19341#true} is VALID [2022-04-27 13:05:09,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {19341#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19341#true} is VALID [2022-04-27 13:05:09,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {19341#true} assume true; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19341#true} {19341#true} #108#return; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {19341#true} call #t~ret9 := main(); {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {19341#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {19341#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {19341#true} ~cond := #in~cond; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {19341#true} assume !(0 == ~cond); {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {19341#true} assume true; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19341#true} {19341#true} #94#return; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L272 TraceCheckUtils]: 11: Hoare triple {19341#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {19341#true} ~cond := #in~cond; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {19341#true} assume !(0 == ~cond); {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {19341#true} assume true; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19341#true} {19341#true} #96#return; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {19341#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {19341#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19341#true} is VALID [2022-04-27 13:05:09,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {19341#true} assume !!(#t~post6 < 5);havoc #t~post6; {19341#true} is VALID [2022-04-27 13:05:09,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {19341#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {19341#true} is VALID [2022-04-27 13:05:09,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {19341#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19341#true} is VALID [2022-04-27 13:05:09,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {19341#true} assume !!(#t~post7 < 5);havoc #t~post7; {19341#true} is VALID [2022-04-27 13:05:09,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {19341#true} assume !(~c~0 >= ~b~0); {19412#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-27 13:05:09,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {19412#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19416#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:05:09,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {19416#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19416#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:05:09,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {19416#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 5);havoc #t~post6; {19416#(< main_~b~0 main_~a~0)} is VALID [2022-04-27 13:05:09,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {19416#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {19426#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:05:09,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {19426#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19426#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:05:09,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {19426#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 5);havoc #t~post7; {19426#(< main_~b~0 main_~c~0)} is VALID [2022-04-27 13:05:09,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {19426#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {19342#false} is VALID [2022-04-27 13:05:09,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {19342#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19342#false} is VALID [2022-04-27 13:05:09,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {19342#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19342#false} is VALID [2022-04-27 13:05:09,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {19342#false} assume !!(#t~post6 < 5);havoc #t~post6; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {19342#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {19342#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {19342#false} assume !(#t~post7 < 5);havoc #t~post7; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {19342#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {19342#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {19342#false} assume !(#t~post6 < 5);havoc #t~post6; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L272 TraceCheckUtils]: 39: Hoare triple {19342#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {19342#false} ~cond := #in~cond; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {19342#false} assume 0 == ~cond; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {19342#false} assume !false; {19342#false} is VALID [2022-04-27 13:05:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 13:05:09,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:05:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359396033] [2022-04-27 13:05:09,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798092585] [2022-04-27 13:05:09,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798092585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:05:09,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:05:09,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:05:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313477654] [2022-04-27 13:05:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:05:09,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 43 [2022-04-27 13:05:09,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:09,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 13:05:09,748 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 13:05:09,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:05:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:05:09,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:05:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:05:09,749 INFO L87 Difference]: Start difference. First operand 502 states and 777 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 13:05:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,044 INFO L93 Difference]: Finished difference Result 1073 states and 1723 transitions. [2022-04-27 13:05:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:05:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 43 [2022-04-27 13:05:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:05:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 13:05:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 13:05:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 13:05:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 13:05:11,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-27 13:05:11,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:05:11,166 INFO L225 Difference]: With dead ends: 1073 [2022-04-27 13:05:11,166 INFO L226 Difference]: Without dead ends: 760 [2022-04-27 13:05:11,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 13:05:11,168 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:05:11,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 173 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:05:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-27 13:05:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 523. [2022-04-27 13:05:11,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:05:11,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 13:05:11,867 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 13:05:11,867 INFO L87 Difference]: Start difference. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 13:05:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,900 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-27 13:05:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1199 transitions. [2022-04-27 13:05:11,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:11,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:11,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) Second operand 760 states. [2022-04-27 13:05:11,904 INFO L87 Difference]: Start difference. First operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) Second operand 760 states. [2022-04-27 13:05:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:05:11,935 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-27 13:05:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1199 transitions. [2022-04-27 13:05:11,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:05:11,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:05:11,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:05:11,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:05:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-27 13:05:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 794 transitions. [2022-04-27 13:05:11,961 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 794 transitions. Word has length 43 [2022-04-27 13:05:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:05:11,961 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 794 transitions. [2022-04-27 13:05:11,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 13:05:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-27 13:05:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 13:05:11,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:05:11,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:05:11,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 13:05:12,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 13:05:12,178 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:05:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:05:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-27 13:05:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:05:12,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852309290] [2022-04-27 13:05:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:05:12,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:05:12,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78129196] [2022-04-27 13:05:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:05:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:05:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:05:12,207 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:05:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 13:05:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:12,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-27 13:05:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:05:12,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:05:12,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {23453#true} call ULTIMATE.init(); {23453#true} is VALID [2022-04-27 13:05:12,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {23453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23453#true} is VALID [2022-04-27 13:05:12,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23453#true} {23453#true} #108#return; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {23453#true} call #t~ret9 := main(); {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {23453#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {23453#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23453#true} {23453#true} #94#return; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {23453#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:12,910 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23453#true} {23453#true} #96#return; {23453#true} is VALID [2022-04-27 13:05:12,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {23453#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23506#(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 13:05:12,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {23506#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23506#(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 13:05:12,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {23506#(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 !!(#t~post6 < 5);havoc #t~post6; {23506#(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 13:05:12,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {23506#(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 !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 13:05:12,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 13:05:12,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 !!(#t~post7 < 5);havoc #t~post7; {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 13:05:12,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {23516#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~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 !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 5);havoc #t~post8; {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,914 INFO L272 TraceCheckUtils]: 25: Hoare triple {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= 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)); {23453#true} is VALID [2022-04-27 13:05:12,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {23453#true} ~cond := #in~cond; {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:12,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:12,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:12,916 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23526#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,916 INFO L272 TraceCheckUtils]: 30: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~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)); {23453#true} is VALID [2022-04-27 13:05:12,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {23453#true} ~cond := #in~cond; {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:12,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {23539#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:12,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:12,918 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,918 INFO L272 TraceCheckUtils]: 35: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:12,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:12,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:12,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:12,919 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23453#true} {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,919 INFO L272 TraceCheckUtils]: 40: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:12,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:12,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:12,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:12,919 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23453#true} {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {23550#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 5);havoc #t~post7; {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 13:05:12,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {23602#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:12,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:12,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 5);havoc #t~post6; {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:12,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {23615#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !(0 != ~b~0); {23625#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-27 13:05:12,924 INFO L272 TraceCheckUtils]: 54: Hoare triple {23625#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:12,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:12,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {23633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23454#false} is VALID [2022-04-27 13:05:12,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {23454#false} assume !false; {23454#false} is VALID [2022-04-27 13:05:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:05:12,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:05:59,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {23454#false} assume !false; {23454#false} is VALID [2022-04-27 13:05:59,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {23633#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23454#false} is VALID [2022-04-27 13:05:59,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23633#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:05:59,833 INFO L272 TraceCheckUtils]: 54: Hoare triple {23649#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23629#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:05:59,834 INFO L290 TraceCheckUtils]: 53: Hoare triple {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {23649#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 13:05:59,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 5);havoc #t~post6; {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:05:59,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:05:59,874 INFO L290 TraceCheckUtils]: 50: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23653#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-27 13:05:59,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 5);havoc #t~post7; {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {23663#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,928 INFO L290 TraceCheckUtils]: 45: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,929 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23453#true} {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:59,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:59,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:59,929 INFO L272 TraceCheckUtils]: 40: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:59,929 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23453#true} {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:59,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:59,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:59,930 INFO L272 TraceCheckUtils]: 35: Hoare triple {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:59,931 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23713#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {23676#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:59,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:59,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {23453#true} ~cond := #in~cond; {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:05:59,932 INFO L272 TraceCheckUtils]: 30: Hoare triple {23713#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:59,933 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {23713#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:59,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23543#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:05:59,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {23453#true} ~cond := #in~cond; {23723#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:05:59,933 INFO L272 TraceCheckUtils]: 25: Hoare triple {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:59,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 5);havoc #t~post8; {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {23730#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-27 13:05:59,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(#t~post7 < 5);havoc #t~post7; {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:05:59,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:05:59,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {23453#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23752#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {23453#true} assume !!(#t~post6 < 5);havoc #t~post6; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {23453#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {23453#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23453#true} {23453#true} #96#return; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L272 TraceCheckUtils]: 11: Hoare triple {23453#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23453#true} {23453#true} #94#return; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {23453#true} assume !(0 == ~cond); {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {23453#true} ~cond := #in~cond; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {23453#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {23453#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23453#true} is VALID [2022-04-27 13:05:59,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {23453#true} call #t~ret9 := main(); {23453#true} is VALID [2022-04-27 13:05:59,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23453#true} {23453#true} #108#return; {23453#true} is VALID [2022-04-27 13:05:59,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {23453#true} assume true; {23453#true} is VALID [2022-04-27 13:05:59,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {23453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23453#true} is VALID [2022-04-27 13:05:59,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {23453#true} call ULTIMATE.init(); {23453#true} is VALID [2022-04-27 13:05:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:05:59,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:05:59,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852309290] [2022-04-27 13:05:59,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:05:59,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78129196] [2022-04-27 13:05:59,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78129196] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:05:59,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:05:59,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-27 13:05:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460986043] [2022-04-27 13:05:59,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:05:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-27 13:05:59,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:05:59,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:00,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:00,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 13:06:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:06:00,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 13:06:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-27 13:06:00,061 INFO L87 Difference]: Start difference. First operand 523 states and 794 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:16,407 INFO L93 Difference]: Finished difference Result 838 states and 1289 transitions. [2022-04-27 13:06:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-27 13:06:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-27 13:06:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:06:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 314 transitions. [2022-04-27 13:06:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 314 transitions. [2022-04-27 13:06:16,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 314 transitions. [2022-04-27 13:06:24,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:06:24,093 INFO L225 Difference]: With dead ends: 838 [2022-04-27 13:06:24,093 INFO L226 Difference]: Without dead ends: 834 [2022-04-27 13:06:24,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 13:06:24,094 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 161 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:06:24,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 621 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-04-27 13:06:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-27 13:06:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 673. [2022-04-27 13:06:24,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:06:24,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:06:24,948 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:06:24,948 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:06:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:24,986 INFO L93 Difference]: Finished difference Result 834 states and 1273 transitions. [2022-04-27 13:06:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1273 transitions. [2022-04-27 13:06:24,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:06:24,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:06:24,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) Second operand 834 states. [2022-04-27 13:06:24,991 INFO L87 Difference]: Start difference. First operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) Second operand 834 states. [2022-04-27 13:06:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:06:25,024 INFO L93 Difference]: Finished difference Result 834 states and 1273 transitions. [2022-04-27 13:06:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1273 transitions. [2022-04-27 13:06:25,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:06:25,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:06:25,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:06:25,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:06:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:06:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1016 transitions. [2022-04-27 13:06:25,050 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1016 transitions. Word has length 58 [2022-04-27 13:06:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:06:25,052 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 1016 transitions. [2022-04-27 13:06:25,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-27 13:06:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1016 transitions. [2022-04-27 13:06:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 13:06:25,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:06:25,053 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:06:25,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 13:06:25,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 13:06:25,266 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:06:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:06:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash 27973409, now seen corresponding path program 1 times [2022-04-27 13:06:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:06:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677908845] [2022-04-27 13:06:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:06:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:06:25,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:06:25,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141457378] [2022-04-27 13:06:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:06:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:06:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:06:25,280 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:06:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 13:06:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:06:25,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 13:06:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 13:06:25,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 13:06:25,387 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 13:06:25,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 13:06:25,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 13:06:25,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 13:06:25,591 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:06:25,593 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 13:06:25,638 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 13:06:25,638 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 13:06:25,639 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 13:06:25,640 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 13:06:25,641 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 13:06:25,641 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 13:06:25,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 01:06:25 BoogieIcfgContainer [2022-04-27 13:06:25,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 13:06:25,642 INFO L158 Benchmark]: Toolchain (without parser) took 104254.25ms. Allocated memory was 194.0MB in the beginning and 269.5MB in the end (delta: 75.5MB). Free memory was 143.6MB in the beginning and 102.6MB in the end (delta: 40.9MB). Peak memory consumption was 115.5MB. Max. memory is 8.0GB. [2022-04-27 13:06:25,642 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 194.0MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 13:06:25,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.74ms. Allocated memory is still 194.0MB. Free memory was 143.4MB in the beginning and 168.9MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 13:06:25,642 INFO L158 Benchmark]: Boogie Preprocessor took 25.20ms. Allocated memory is still 194.0MB. Free memory was 168.9MB in the beginning and 167.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 13:06:25,643 INFO L158 Benchmark]: RCFGBuilder took 244.68ms. Allocated memory is still 194.0MB. Free memory was 167.4MB in the beginning and 154.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 13:06:25,643 INFO L158 Benchmark]: TraceAbstraction took 103794.13ms. Allocated memory was 194.0MB in the beginning and 269.5MB in the end (delta: 75.5MB). Free memory was 153.8MB in the beginning and 102.6MB in the end (delta: 51.2MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. [2022-04-27 13:06:25,643 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.27ms. Allocated memory is still 194.0MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.74ms. Allocated memory is still 194.0MB. Free memory was 143.4MB in the beginning and 168.9MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.20ms. Allocated memory is still 194.0MB. Free memory was 168.9MB in the beginning and 167.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 244.68ms. Allocated memory is still 194.0MB. Free memory was 167.4MB in the beginning and 154.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 103794.13ms. Allocated memory was 194.0MB in the beginning and 269.5MB in the end (delta: 75.5MB). Free memory was 153.8MB in the beginning and 102.6MB in the end (delta: 51.2MB). Peak memory consumption was 127.1MB. 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=10, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=2, y=3] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=2, y=3] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=2, b=3, counter=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=3, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2, b=3, c=2, counter=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=3, c=2, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2, b=3, c=2, counter=2, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L48] COND TRUE counter++<5 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L41] COND FALSE !(counter++<5) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=2, y=3] [L34] COND FALSE !(counter++<5) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=7] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=7] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 103.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 982 mSDsluCounter, 3686 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2835 mSDsCounter, 602 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2877 IncrementalHoareTripleChecker+Invalid, 3479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 602 mSolverCounterUnsat, 851 mSDtfsCounter, 2877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 747 SyntacticMatches, 7 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 56.6s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 3856 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2313 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 246/348 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 13:06:25,667 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...