./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc77cb5fe4af5100e01bafbf150d5df54332b351a9f9d4040d6b54bbf20f5710 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:16:27,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:16:27,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:16:27,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:16:27,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:16:27,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:16:27,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:16:27,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:16:27,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:16:27,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:16:27,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:16:27,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:16:27,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:16:27,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:16:27,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:16:27,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:16:27,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:16:27,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:16:27,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:16:27,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:16:27,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:16:27,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:16:27,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:16:27,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:16:27,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:16:27,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:16:27,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:16:27,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:16:27,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:16:27,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:16:27,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:16:27,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:16:27,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:16:27,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:16:27,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:16:27,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:16:27,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:16:27,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:16:27,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:16:27,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:16:27,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:16:27,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:16:27,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:16:27,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:16:27,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:16:27,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:16:27,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:16:27,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:16:27,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:16:27,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:16:27,780 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:16:27,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:16:27,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:16:27,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:16:27,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:16:27,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:16:27,781 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:16:27,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:16:27,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:16:27,782 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:16:27,782 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:16:27,782 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:16:27,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:16:27,783 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:16:27,783 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:16:27,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:16:27,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:27,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:16:27,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:16:27,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:16:27,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:16:27,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:16:27,786 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:16:27,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:16:27,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:16:27,786 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc77cb5fe4af5100e01bafbf150d5df54332b351a9f9d4040d6b54bbf20f5710 [2022-02-20 17:16:27,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:16:28,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:16:28,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:16:28,020 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:16:28,020 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:16:28,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2022-02-20 17:16:28,072 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4b887e1/c64ee0bdc1bc4ddca125bf44cc299ffd/FLAG1e0f6fcf8 [2022-02-20 17:16:28,415 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:16:28,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c [2022-02-20 17:16:28,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4b887e1/c64ee0bdc1bc4ddca125bf44cc299ffd/FLAG1e0f6fcf8 [2022-02-20 17:16:28,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4b887e1/c64ee0bdc1bc4ddca125bf44cc299ffd [2022-02-20 17:16:28,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:16:28,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:16:28,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:28,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:16:28,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:16:28,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:28" (1/1) ... [2022-02-20 17:16:28,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753667f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:28, skipping insertion in model container [2022-02-20 17:16:28,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:16:28" (1/1) ... [2022-02-20 17:16:28,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:16:28,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:16:29,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c[576,589] [2022-02-20 17:16:29,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:29,063 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:16:29,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_valuebound5.c[576,589] [2022-02-20 17:16:29,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:16:29,099 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:16:29,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29 WrapperNode [2022-02-20 17:16:29,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:16:29,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:29,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:16:29,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:16:29,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,135 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2022-02-20 17:16:29,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:16:29,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:16:29,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:16:29,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:16:29,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:16:29,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:16:29,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:16:29,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:16:29,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (1/1) ... [2022-02-20 17:16:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:16:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:29,197 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-02-20 17:16:29,207 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-02-20 17:16:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:16:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:16:29,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:16:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:16:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:16:29,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:16:29,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:16:29,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:16:29,296 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:16:29,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:16:29,497 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:16:29,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:16:29,503 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:16:29,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:29 BoogieIcfgContainer [2022-02-20 17:16:29,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:16:29,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:16:29,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:16:29,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:16:29,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:16:28" (1/3) ... [2022-02-20 17:16:29,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1402ce8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:29, skipping insertion in model container [2022-02-20 17:16:29,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:16:29" (2/3) ... [2022-02-20 17:16:29,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1402ce8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:16:29, skipping insertion in model container [2022-02-20 17:16:29,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:29" (3/3) ... [2022-02-20 17:16:29,522 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_valuebound5.c [2022-02-20 17:16:29,526 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:16:29,531 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:16:29,598 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:16:29,604 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:16:29,610 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:16:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:16:29,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:29,634 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:29,635 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1418986431, now seen corresponding path program 1 times [2022-02-20 17:16:29,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:29,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795667164] [2022-02-20 17:16:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:29,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:16:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:29,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:29,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:29,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:29,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #75#return; {38#false} is VALID [2022-02-20 17:16:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:16:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:29,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:29,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:29,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:29,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2022-02-20 17:16:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:16:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:29,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:29,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:29,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:29,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #79#return; {38#false} is VALID [2022-02-20 17:16:29,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-02-20 17:16:29,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {37#true} is VALID [2022-02-20 17:16:29,905 INFO L272 TraceCheckUtils]: 2: Hoare triple {37#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {37#true} is VALID [2022-02-20 17:16:29,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:29,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:29,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:29,906 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {38#false} {37#true} #75#return; {38#false} is VALID [2022-02-20 17:16:29,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {38#false} is VALID [2022-02-20 17:16:29,907 INFO L272 TraceCheckUtils]: 8: Hoare triple {38#false} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {37#true} is VALID [2022-02-20 17:16:29,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:29,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:29,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:29,910 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {38#false} {38#false} #77#return; {38#false} is VALID [2022-02-20 17:16:29,910 INFO L272 TraceCheckUtils]: 13: Hoare triple {38#false} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {37#true} is VALID [2022-02-20 17:16:29,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-02-20 17:16:29,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-02-20 17:16:29,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID [2022-02-20 17:16:29,911 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {38#false} #79#return; {38#false} is VALID [2022-02-20 17:16:29,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {38#false} is VALID [2022-02-20 17:16:29,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-02-20 17:16:29,912 INFO L272 TraceCheckUtils]: 20: Hoare triple {38#false} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {38#false} is VALID [2022-02-20 17:16:29,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-02-20 17:16:29,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-02-20 17:16:29,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-02-20 17:16:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:16:29,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:29,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795667164] [2022-02-20 17:16:29,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795667164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:29,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:29,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:16:29,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186049975] [2022-02-20 17:16:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:29,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:16:29,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:29,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:29,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:29,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:16:29,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:16:29,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:30,001 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:30,111 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2022-02-20 17:16:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:16:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:16:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:16:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:16:30,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 104 transitions. [2022-02-20 17:16:30,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:30,287 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:16:30,287 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:16:30,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:16:30,293 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:30,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:16:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:16:30,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:30,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:30,319 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:30,319 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:30,325 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:16:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:16:30,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:30,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:30,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:16:30,327 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 30 states. [2022-02-20 17:16:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:30,331 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:16:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:16:30,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:30,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:30,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:30,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:16:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:16:30,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 24 [2022-02-20 17:16:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:30,347 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:16:30,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:16:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:16:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:16:30,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:30,349 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:30,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:16:30,350 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 240368937, now seen corresponding path program 1 times [2022-02-20 17:16:30,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:30,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241205656] [2022-02-20 17:16:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:30,387 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:30,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790729017] [2022-02-20 17:16:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:30,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:30,398 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-02-20 17:16:30,422 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-02-20 17:16:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:30,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:16:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:30,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:30,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-02-20 17:16:30,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {251#true} is VALID [2022-02-20 17:16:30,719 INFO L272 TraceCheckUtils]: 2: Hoare triple {251#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {251#true} is VALID [2022-02-20 17:16:30,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 17:16:30,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 17:16:30,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 17:16:30,720 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {251#true} {251#true} #75#return; {251#true} is VALID [2022-02-20 17:16:30,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {251#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {251#true} is VALID [2022-02-20 17:16:30,720 INFO L272 TraceCheckUtils]: 8: Hoare triple {251#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {251#true} is VALID [2022-02-20 17:16:30,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 17:16:30,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 17:16:30,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 17:16:30,725 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {251#true} {251#true} #77#return; {251#true} is VALID [2022-02-20 17:16:30,726 INFO L272 TraceCheckUtils]: 13: Hoare triple {251#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {251#true} is VALID [2022-02-20 17:16:30,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {251#true} ~cond := #in~cond; {251#true} is VALID [2022-02-20 17:16:30,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#true} assume !(0 == ~cond); {251#true} is VALID [2022-02-20 17:16:30,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {251#true} assume true; {251#true} is VALID [2022-02-20 17:16:30,726 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {251#true} {251#true} #79#return; {251#true} is VALID [2022-02-20 17:16:30,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {251#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:16:30,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} assume !false; {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} is VALID [2022-02-20 17:16:30,732 INFO L272 TraceCheckUtils]: 20: Hoare triple {310#(and (= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {317#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:30,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {317#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {321#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:30,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {321#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {252#false} is VALID [2022-02-20 17:16:30,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-02-20 17:16:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:16:30,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:30,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:30,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241205656] [2022-02-20 17:16:30,737 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:30,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790729017] [2022-02-20 17:16:30,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790729017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:30,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:30,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:16:30,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981873010] [2022-02-20 17:16:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:30,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:16:30,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:30,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:30,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:30,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:30,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:30,765 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:30,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:30,952 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-02-20 17:16:30,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:30,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:16:30,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-02-20 17:16:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-02-20 17:16:30,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2022-02-20 17:16:31,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:31,016 INFO L225 Difference]: With dead ends: 41 [2022-02-20 17:16:31,016 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:16:31,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-02-20 17:16:31,018 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:31,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:16:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-02-20 17:16:31,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:31,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:31,026 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:31,026 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:31,029 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:16:31,029 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-02-20 17:16:31,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:31,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:31,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 39 states. [2022-02-20 17:16:31,031 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 39 states. [2022-02-20 17:16:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:31,034 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-02-20 17:16:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-02-20 17:16:31,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:31,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:31,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:31,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:16:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-02-20 17:16:31,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 24 [2022-02-20 17:16:31,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:31,039 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-02-20 17:16:31,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:16:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 17:16:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:16:31,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:31,041 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:31,070 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-02-20 17:16:31,244 WARN L452 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-02-20 17:16:31,245 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:31,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash -854318377, now seen corresponding path program 1 times [2022-02-20 17:16:31,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:31,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261277529] [2022-02-20 17:16:31,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:31,268 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:31,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318940191] [2022-02-20 17:16:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:31,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:31,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:31,272 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-02-20 17:16:31,275 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-02-20 17:16:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:31,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:16:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:31,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:31,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {520#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {520#true} is VALID [2022-02-20 17:16:31,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {520#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {520#true} is VALID [2022-02-20 17:16:31,681 INFO L272 TraceCheckUtils]: 2: Hoare triple {520#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:31,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {520#true} ~cond := #in~cond; {520#true} is VALID [2022-02-20 17:16:31,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {520#true} assume !(0 == ~cond); {520#true} is VALID [2022-02-20 17:16:31,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#true} assume true; {520#true} is VALID [2022-02-20 17:16:31,682 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {520#true} {520#true} #75#return; {520#true} is VALID [2022-02-20 17:16:31,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {520#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {520#true} is VALID [2022-02-20 17:16:31,682 INFO L272 TraceCheckUtils]: 8: Hoare triple {520#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:31,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#true} ~cond := #in~cond; {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:31,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:31,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {556#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:31,685 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {556#(not (= |assume_abort_if_not_#in~cond| 0))} {520#true} #77#return; {563#(and (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:16:31,685 INFO L272 TraceCheckUtils]: 13: Hoare triple {563#(and (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 0 |ULTIMATE.start_main_~y~0#1|))} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:31,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#true} ~cond := #in~cond; {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:31,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:31,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:31,687 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {556#(not (= |assume_abort_if_not_#in~cond| 0))} {563#(and (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 0 |ULTIMATE.start_main_~y~0#1|))} #79#return; {579#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5))} is VALID [2022-02-20 17:16:31,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {579#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5))} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:31,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !false; {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:31,689 INFO L272 TraceCheckUtils]: 20: Hoare triple {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {520#true} is VALID [2022-02-20 17:16:31,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#true} ~cond := #in~cond; {520#true} is VALID [2022-02-20 17:16:31,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {520#true} assume !(0 == ~cond); {520#true} is VALID [2022-02-20 17:16:31,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {520#true} assume true; {520#true} is VALID [2022-02-20 17:16:31,690 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {520#true} {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #81#return; {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:31,691 INFO L272 TraceCheckUtils]: 25: Hoare triple {583#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:31,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:31,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {521#false} is VALID [2022-02-20 17:16:31,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {521#false} assume !false; {521#false} is VALID [2022-02-20 17:16:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:16:31,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:31,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:31,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261277529] [2022-02-20 17:16:31,696 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:31,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318940191] [2022-02-20 17:16:31,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318940191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:31,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:31,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 17:16:31,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100234090] [2022-02-20 17:16:31,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 17:16:31,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:31,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:31,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:31,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 17:16:31,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 17:16:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:16:31,723 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,161 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-02-20 17:16:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 17:16:32,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-02-20 17:16:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-02-20 17:16:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-02-20 17:16:32,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-02-20 17:16:32,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:32,239 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:16:32,239 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 17:16:32,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:32,240 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:32,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 193 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 17:16:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-02-20 17:16:32,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:32,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:32,266 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:32,267 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,270 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 17:16:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 17:16:32,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:32,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:32,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 50 states. [2022-02-20 17:16:32,272 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 50 states. [2022-02-20 17:16:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,275 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-02-20 17:16:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-02-20 17:16:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:32,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:32,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 17:16:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-02-20 17:16:32,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2022-02-20 17:16:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:32,280 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2022-02-20 17:16:32,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 17:16:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-02-20 17:16:32,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 17:16:32,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:32,281 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:32,310 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-02-20 17:16:32,507 WARN L452 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-02-20 17:16:32,508 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:32,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1997084946, now seen corresponding path program 1 times [2022-02-20 17:16:32,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:32,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732046228] [2022-02-20 17:16:32,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:32,528 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:32,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138767147] [2022-02-20 17:16:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:32,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:32,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:32,538 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-02-20 17:16:32,575 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-02-20 17:16:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:32,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:16:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:32,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:32,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {870#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {870#true} is VALID [2022-02-20 17:16:32,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {870#true} is VALID [2022-02-20 17:16:32,721 INFO L272 TraceCheckUtils]: 2: Hoare triple {870#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:32,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:32,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:32,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:32,721 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {870#true} {870#true} #75#return; {870#true} is VALID [2022-02-20 17:16:32,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {870#true} is VALID [2022-02-20 17:16:32,722 INFO L272 TraceCheckUtils]: 8: Hoare triple {870#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:32,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:32,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:32,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:32,725 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {870#true} {870#true} #77#return; {870#true} is VALID [2022-02-20 17:16:32,725 INFO L272 TraceCheckUtils]: 13: Hoare triple {870#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:32,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:32,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:32,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:32,726 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {870#true} {870#true} #79#return; {870#true} is VALID [2022-02-20 17:16:32,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {870#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {870#true} is VALID [2022-02-20 17:16:32,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#true} assume !false; {870#true} is VALID [2022-02-20 17:16:32,726 INFO L272 TraceCheckUtils]: 20: Hoare triple {870#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:32,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:32,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:32,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:32,726 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {870#true} {870#true} #81#return; {870#true} is VALID [2022-02-20 17:16:32,727 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#true} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {870#true} is VALID [2022-02-20 17:16:32,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {870#true} ~cond := #in~cond; {870#true} is VALID [2022-02-20 17:16:32,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {870#true} assume !(0 == ~cond); {870#true} is VALID [2022-02-20 17:16:32,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {870#true} assume true; {870#true} is VALID [2022-02-20 17:16:32,727 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {870#true} {870#true} #83#return; {870#true} is VALID [2022-02-20 17:16:32,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#true} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {965#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:16:32,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {965#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} assume !false; {965#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-20 17:16:32,730 INFO L272 TraceCheckUtils]: 32: Hoare triple {965#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {972#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:32,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {972#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {976#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:32,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {976#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-02-20 17:16:32,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-02-20 17:16:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:16:32,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:32,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:32,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732046228] [2022-02-20 17:16:32,732 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:32,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138767147] [2022-02-20 17:16:32,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138767147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:32,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:32,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:16:32,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348005674] [2022-02-20 17:16:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:32,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:16:32,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:32,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:32,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:32,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:16:32,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:16:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:16:32,763 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:32,994 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2022-02-20 17:16:32,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:32,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-02-20 17:16:32,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:16:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:32,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 17:16:32,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 17:16:33,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:33,057 INFO L225 Difference]: With dead ends: 75 [2022-02-20 17:16:33,057 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 17:16:33,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-02-20 17:16:33,060 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:33,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:16:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 17:16:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-02-20 17:16:33,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:33,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:33,100 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:33,103 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:33,108 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-02-20 17:16:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2022-02-20 17:16:33,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:33,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:33,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 73 states. [2022-02-20 17:16:33,112 INFO L87 Difference]: Start difference. First operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 73 states. [2022-02-20 17:16:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:33,117 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-02-20 17:16:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2022-02-20 17:16:33,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:33,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:33,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:33,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-02-20 17:16:33,125 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 36 [2022-02-20 17:16:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:33,126 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-02-20 17:16:33,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 17:16:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-02-20 17:16:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 17:16:33,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:33,130 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:33,150 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-02-20 17:16:33,339 WARN L452 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-02-20 17:16:33,340 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2056573358, now seen corresponding path program 1 times [2022-02-20 17:16:33,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:33,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84984945] [2022-02-20 17:16:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:33,361 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:33,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278874675] [2022-02-20 17:16:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:33,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:33,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:33,363 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-02-20 17:16:33,390 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-02-20 17:16:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:33,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:16:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:33,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:33,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {1345#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {1345#true} is VALID [2022-02-20 17:16:33,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1345#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1345#true} is VALID [2022-02-20 17:16:33,624 INFO L272 TraceCheckUtils]: 2: Hoare triple {1345#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {1345#true} ~cond := #in~cond; {1345#true} is VALID [2022-02-20 17:16:33,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {1345#true} assume !(0 == ~cond); {1345#true} is VALID [2022-02-20 17:16:33,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-02-20 17:16:33,625 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1345#true} {1345#true} #75#return; {1345#true} is VALID [2022-02-20 17:16:33,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {1345#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1345#true} is VALID [2022-02-20 17:16:33,625 INFO L272 TraceCheckUtils]: 8: Hoare triple {1345#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {1345#true} ~cond := #in~cond; {1345#true} is VALID [2022-02-20 17:16:33,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {1345#true} assume !(0 == ~cond); {1345#true} is VALID [2022-02-20 17:16:33,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-02-20 17:16:33,626 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1345#true} {1345#true} #77#return; {1345#true} is VALID [2022-02-20 17:16:33,626 INFO L272 TraceCheckUtils]: 13: Hoare triple {1345#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {1345#true} ~cond := #in~cond; {1392#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:16:33,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {1392#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1396#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:33,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {1396#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1396#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:16:33,637 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1396#(not (= |assume_abort_if_not_#in~cond| 0))} {1345#true} #79#return; {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:33,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:33,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !false; {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:33,638 INFO L272 TraceCheckUtils]: 20: Hoare triple {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {1345#true} ~cond := #in~cond; {1345#true} is VALID [2022-02-20 17:16:33,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {1345#true} assume !(0 == ~cond); {1345#true} is VALID [2022-02-20 17:16:33,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-02-20 17:16:33,639 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1345#true} {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #81#return; {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:33,639 INFO L272 TraceCheckUtils]: 25: Hoare triple {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {1345#true} ~cond := #in~cond; {1345#true} is VALID [2022-02-20 17:16:33,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {1345#true} assume !(0 == ~cond); {1345#true} is VALID [2022-02-20 17:16:33,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-02-20 17:16:33,641 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1345#true} {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #83#return; {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:16:33,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {1403#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:33,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} assume !false; {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:33,642 INFO L272 TraceCheckUtils]: 32: Hoare triple {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {1345#true} ~cond := #in~cond; {1345#true} is VALID [2022-02-20 17:16:33,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {1345#true} assume !(0 == ~cond); {1345#true} is VALID [2022-02-20 17:16:33,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-02-20 17:16:33,643 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1345#true} {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} #85#return; {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:33,643 INFO L272 TraceCheckUtils]: 37: Hoare triple {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1345#true} is VALID [2022-02-20 17:16:33,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {1345#true} ~cond := #in~cond; {1345#true} is VALID [2022-02-20 17:16:33,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {1345#true} assume !(0 == ~cond); {1345#true} is VALID [2022-02-20 17:16:33,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {1345#true} assume true; {1345#true} is VALID [2022-02-20 17:16:33,644 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1345#true} {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} #87#return; {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:33,645 INFO L272 TraceCheckUtils]: 42: Hoare triple {1443#(<= 1 |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {1480#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:33,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {1480#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1484#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:33,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {1484#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1346#false} is VALID [2022-02-20 17:16:33,646 INFO L290 TraceCheckUtils]: 45: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2022-02-20 17:16:33,646 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-20 17:16:33,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:16:33,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:33,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84984945] [2022-02-20 17:16:33,647 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:33,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278874675] [2022-02-20 17:16:33,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278874675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:16:33,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:16:33,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 17:16:33,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206025234] [2022-02-20 17:16:33,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-02-20 17:16:33,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:33,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:33,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:33,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:16:33,673 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:16:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:16:33,674 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:34,001 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-02-20 17:16:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:16:34,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-02-20 17:16:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:34,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-02-20 17:16:34,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:34,042 INFO L225 Difference]: With dead ends: 72 [2022-02-20 17:16:34,042 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 17:16:34,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:34,043 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:34,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 169 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 17:16:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-02-20 17:16:34,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:34,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:34,095 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:34,095 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:34,098 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2022-02-20 17:16:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-02-20 17:16:34,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:34,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:34,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 70 states. [2022-02-20 17:16:34,100 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 70 states. [2022-02-20 17:16:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:34,103 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2022-02-20 17:16:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-02-20 17:16:34,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:34,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:34,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:34,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:34,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-02-20 17:16:34,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 46 [2022-02-20 17:16:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:34,107 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-02-20 17:16:34,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 17:16:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-02-20 17:16:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 17:16:34,108 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:34,108 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:34,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:16:34,323 WARN L452 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-02-20 17:16:34,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:34,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2085516536, now seen corresponding path program 1 times [2022-02-20 17:16:34,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:34,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412882044] [2022-02-20 17:16:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:34,341 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:34,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093241905] [2022-02-20 17:16:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:34,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:34,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:34,343 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-02-20 17:16:34,367 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-02-20 17:16:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:34,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:16:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:34,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:34,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1850#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {1850#true} is VALID [2022-02-20 17:16:34,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L272 TraceCheckUtils]: 2: Hoare triple {1850#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1850#true} {1850#true} #75#return; {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1850#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L272 TraceCheckUtils]: 8: Hoare triple {1850#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1850#true} {1850#true} #77#return; {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L272 TraceCheckUtils]: 13: Hoare triple {1850#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,712 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1850#true} {1850#true} #79#return; {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {1850#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {1850#true} assume !false; {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L272 TraceCheckUtils]: 20: Hoare triple {1850#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1850#true} {1850#true} #81#return; {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L272 TraceCheckUtils]: 25: Hoare triple {1850#true} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,714 INFO L290 TraceCheckUtils]: 28: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,714 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1850#true} {1850#true} #83#return; {1850#true} is VALID [2022-02-20 17:16:34,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {1850#true} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {1850#true} is VALID [2022-02-20 17:16:34,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {1850#true} assume !false; {1850#true} is VALID [2022-02-20 17:16:34,714 INFO L272 TraceCheckUtils]: 32: Hoare triple {1850#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {1850#true} ~cond := #in~cond; {1954#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:34,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {1954#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:34,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:34,718 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} {1850#true} #85#return; {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:34,718 INFO L272 TraceCheckUtils]: 37: Hoare triple {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,719 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1850#true} {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} #87#return; {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:34,719 INFO L272 TraceCheckUtils]: 42: Hoare triple {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:34,719 INFO L290 TraceCheckUtils]: 43: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:34,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:34,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:34,721 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1850#true} {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} #89#return; {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:16:34,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {1965#(= (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~b~0#1|)} assume !!(main_~r~0#1 >= 2 * main_~b~0#1); {1999#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:34,722 INFO L272 TraceCheckUtils]: 48: Hoare triple {1999#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 2 * main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:34,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:34,723 INFO L290 TraceCheckUtils]: 50: Hoare triple {2007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1851#false} is VALID [2022-02-20 17:16:34,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-02-20 17:16:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:16:34,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:39,177 INFO L290 TraceCheckUtils]: 51: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2022-02-20 17:16:39,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {2007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1851#false} is VALID [2022-02-20 17:16:39,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:39,179 INFO L272 TraceCheckUtils]: 48: Hoare triple {1999#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 2 * main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:39,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} assume !!(main_~r~0#1 >= 2 * main_~b~0#1); {1999#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:16:39,181 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1850#true} {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} #89#return; {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:16:39,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,182 INFO L272 TraceCheckUtils]: 42: Hoare triple {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,183 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1850#true} {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} #87#return; {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:16:39,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,183 INFO L272 TraceCheckUtils]: 37: Hoare triple {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,184 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} {1850#true} #85#return; {2026#(<= (* (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) 2) (* 2 |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:16:39,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:39,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {2069#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1958#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:16:39,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {1850#true} ~cond := #in~cond; {2069#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:16:39,186 INFO L272 TraceCheckUtils]: 32: Hoare triple {1850#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {1850#true} assume !false; {1850#true} is VALID [2022-02-20 17:16:39,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {1850#true} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {1850#true} is VALID [2022-02-20 17:16:39,187 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1850#true} {1850#true} #83#return; {1850#true} is VALID [2022-02-20 17:16:39,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,198 INFO L272 TraceCheckUtils]: 25: Hoare triple {1850#true} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,200 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1850#true} {1850#true} #81#return; {1850#true} is VALID [2022-02-20 17:16:39,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,204 INFO L272 TraceCheckUtils]: 20: Hoare triple {1850#true} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {1850#true} assume !false; {1850#true} is VALID [2022-02-20 17:16:39,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {1850#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {1850#true} is VALID [2022-02-20 17:16:39,205 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1850#true} {1850#true} #79#return; {1850#true} is VALID [2022-02-20 17:16:39,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {1850#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,206 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1850#true} {1850#true} #77#return; {1850#true} is VALID [2022-02-20 17:16:39,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,206 INFO L272 TraceCheckUtils]: 8: Hoare triple {1850#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1850#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1850#true} is VALID [2022-02-20 17:16:39,209 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1850#true} {1850#true} #75#return; {1850#true} is VALID [2022-02-20 17:16:39,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1850#true} assume true; {1850#true} is VALID [2022-02-20 17:16:39,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2022-02-20 17:16:39,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2022-02-20 17:16:39,210 INFO L272 TraceCheckUtils]: 2: Hoare triple {1850#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {1850#true} is VALID [2022-02-20 17:16:39,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1850#true} is VALID [2022-02-20 17:16:39,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {1850#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {1850#true} is VALID [2022-02-20 17:16:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:16:39,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:39,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412882044] [2022-02-20 17:16:39,212 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:39,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093241905] [2022-02-20 17:16:39,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093241905] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:16:39,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:16:39,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:16:39,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459816620] [2022-02-20 17:16:39,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:16:39,213 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 52 [2022-02-20 17:16:39,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:39,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:39,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:39,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:16:39,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:16:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:16:39,264 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:39,642 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-02-20 17:16:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:16:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 52 [2022-02-20 17:16:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-02-20 17:16:39,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-02-20 17:16:39,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:39,692 INFO L225 Difference]: With dead ends: 76 [2022-02-20 17:16:39,692 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 17:16:39,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:16:39,695 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:39,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 17:16:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 17:16:39,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:39,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:39,749 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:39,749 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:39,752 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-02-20 17:16:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-02-20 17:16:39,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:39,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:39,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 74 states. [2022-02-20 17:16:39,754 INFO L87 Difference]: Start difference. First operand has 74 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 74 states. [2022-02-20 17:16:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:39,757 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-02-20 17:16:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-02-20 17:16:39,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:39,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:39,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:39,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 17:16:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-02-20 17:16:39,761 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 52 [2022-02-20 17:16:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:39,761 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-02-20 17:16:39,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 17:16:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-02-20 17:16:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 17:16:39,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:16:39,763 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1] [2022-02-20 17:16:39,789 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-02-20 17:16:39,979 WARN L452 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-02-20 17:16:39,979 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:16:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:16:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1724367982, now seen corresponding path program 1 times [2022-02-20 17:16:39,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:16:39,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296481087] [2022-02-20 17:16:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:16:39,995 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:16:39,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385436454] [2022-02-20 17:16:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:16:39,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:16:39,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:16:39,996 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-02-20 17:16:39,999 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-02-20 17:16:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:40,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:16:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:16:40,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:16:40,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {2546#true} is VALID [2022-02-20 17:16:40,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2546#true} is VALID [2022-02-20 17:16:40,339 INFO L272 TraceCheckUtils]: 2: Hoare triple {2546#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2546#true} {2546#true} #75#return; {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,341 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2546#true} {2546#true} #77#return; {2546#true} is VALID [2022-02-20 17:16:40,341 INFO L272 TraceCheckUtils]: 13: Hoare triple {2546#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,341 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2546#true} {2546#true} #79#return; {2546#true} is VALID [2022-02-20 17:16:40,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {2546#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !false; {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,342 INFO L272 TraceCheckUtils]: 20: Hoare triple {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,343 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2546#true} {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #81#return; {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,343 INFO L272 TraceCheckUtils]: 25: Hoare triple {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,345 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2546#true} {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #83#return; {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {2605#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !false; {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,346 INFO L272 TraceCheckUtils]: 32: Hoare triple {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,347 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2546#true} {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #85#return; {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,347 INFO L272 TraceCheckUtils]: 37: Hoare triple {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,348 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2546#true} {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #87#return; {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,348 INFO L272 TraceCheckUtils]: 42: Hoare triple {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,349 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2546#true} {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} #89#return; {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} assume !(main_~r~0#1 >= 2 * main_~b~0#1); {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} is VALID [2022-02-20 17:16:40,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {2642#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~a~0#1| 1) (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0))} main_~r~0#1 := main_~r~0#1 - main_~b~0#1;main_~q~0#1 := main_~q~0#1 + main_~a~0#1; {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:40,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} assume !false; {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:40,351 INFO L272 TraceCheckUtils]: 50: Hoare triple {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,351 INFO L290 TraceCheckUtils]: 53: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,352 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2546#true} {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} #81#return; {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} is VALID [2022-02-20 17:16:40,352 INFO L272 TraceCheckUtils]: 55: Hoare triple {2697#(and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| 1))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:40,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {2719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:40,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {2723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2547#false} is VALID [2022-02-20 17:16:40,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2022-02-20 17:16:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-02-20 17:16:40,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:16:40,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2022-02-20 17:16:40,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {2723#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2547#false} is VALID [2022-02-20 17:16:40,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {2719#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2723#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:16:40,585 INFO L272 TraceCheckUtils]: 55: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2719#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:16:40,586 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {2546#true} {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} #81#return; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,586 INFO L290 TraceCheckUtils]: 51: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,586 INFO L272 TraceCheckUtils]: 50: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} main_~r~0#1 := main_~r~0#1 - main_~b~0#1;main_~q~0#1 := main_~q~0#1 + main_~a~0#1; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !(main_~r~0#1 >= 2 * main_~b~0#1); {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:40,608 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2546#true} {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} #89#return; {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:40,609 INFO L290 TraceCheckUtils]: 45: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,609 INFO L272 TraceCheckUtils]: 42: Hoare triple {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~r~0#1 >= 0 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,610 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2546#true} {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} #87#return; {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:40,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,610 INFO L272 TraceCheckUtils]: 37: Hoare triple {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,611 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2546#true} {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} #85#return; {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:40,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,611 INFO L272 TraceCheckUtils]: 32: Hoare triple {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !false; {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:40,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~r~0#1 >= main_~y~0#1);main_~a~0#1 := 1;main_~b~0#1 := main_~y~0#1; {2761#(= (+ (* (- 1) |ULTIMATE.start_main_~b~0#1|) (* (+ |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 17:16:40,616 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2546#true} {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} #83#return; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,616 INFO L272 TraceCheckUtils]: 25: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~x~0#1 == main_~q~0#1 * main_~y~0#1 + main_~r~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,617 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2546#true} {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} #81#return; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,617 INFO L272 TraceCheckUtils]: 20: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if main_~b~0#1 == main_~y~0#1 * main_~a~0#1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} assume !false; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {2546#true} main_~q~0#1 := 0;main_~r~0#1 := main_~x~0#1;main_~a~0#1 := 0;main_~b~0#1 := 0; {2739#(= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:16:40,622 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2546#true} {2546#true} #79#return; {2546#true} is VALID [2022-02-20 17:16:40,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,622 INFO L272 TraceCheckUtils]: 13: Hoare triple {2546#true} call assume_abort_if_not((if main_~y~0#1 >= 1 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2546#true} {2546#true} #77#return; {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L272 TraceCheckUtils]: 8: Hoare triple {2546#true} call assume_abort_if_not((if main_~y~0#1 >= 0 && main_~y~0#1 <= 5 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {2546#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2546#true} {2546#true} #75#return; {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {2546#true} assume true; {2546#true} is VALID [2022-02-20 17:16:40,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {2546#true} assume !(0 == ~cond); {2546#true} is VALID [2022-02-20 17:16:40,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {2546#true} ~cond := #in~cond; {2546#true} is VALID [2022-02-20 17:16:40,624 INFO L272 TraceCheckUtils]: 2: Hoare triple {2546#true} call assume_abort_if_not((if main_~x~0#1 >= 0 && main_~x~0#1 <= 5 then 1 else 0)); {2546#true} is VALID [2022-02-20 17:16:40,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~x~0#1, main_~y~0#1, main_~q~0#1, main_~r~0#1, main_~a~0#1, main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~q~0#1;havoc main_~r~0#1;havoc main_~a~0#1;havoc main_~b~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2546#true} is VALID [2022-02-20 17:16:40,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#true} assume { :begin_inline_ULTIMATE.init } 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(14, 2);call #Ultimate.allocInit(12, 3); {2546#true} is VALID [2022-02-20 17:16:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-20 17:16:40,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:16:40,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296481087] [2022-02-20 17:16:40,625 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:16:40,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385436454] [2022-02-20 17:16:40,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385436454] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:16:40,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:16:40,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-02-20 17:16:40,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611393448] [2022-02-20 17:16:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:16:40,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2022-02-20 17:16:40,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:16:40,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:40,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:40,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:16:40,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:16:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:16:40,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:16:40,667 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:41,052 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2022-02-20 17:16:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:16:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2022-02-20 17:16:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:16:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:16:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 17:16:41,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 17:16:41,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:16:41,108 INFO L225 Difference]: With dead ends: 78 [2022-02-20 17:16:41,108 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:16:41,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:16:41,110 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:16:41,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:16:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:16:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:16:41,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:16:41,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:41,111 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:41,111 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:41,111 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:16:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:41,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:41,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:41,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:16:41,112 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:16:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:16:41,112 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:16:41,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:41,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:41,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:16:41,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:16:41,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:16:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:16:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:16:41,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2022-02-20 17:16:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:16:41,113 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:16:41,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:16:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:16:41,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:16:41,115 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:16:41,135 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-02-20 17:16:41,326 WARN L452 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-02-20 17:16:41,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:16:42,089 INFO L858 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-02-20 17:16:42,089 INFO L858 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-02-20 17:16:42,089 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-02-20 17:16:42,089 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-02-20 17:16:42,089 INFO L854 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,089 INFO L854 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,089 INFO L858 garLoopResultBuilder]: For program point L40(lines 38 62) no Hoare annotation was computed. [2022-02-20 17:16:42,089 INFO L861 garLoopResultBuilder]: At program point L65(lines 22 66) the Hoare annotation is: true [2022-02-20 17:16:42,090 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:16:42,090 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:16:42,090 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:16:42,090 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,090 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:16:42,090 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-02-20 17:16:42,090 INFO L854 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 0 |ULTIMATE.start_main_~y~0#1|)) [2022-02-20 17:16:42,090 INFO L858 garLoopResultBuilder]: For program point L50(lines 47 59) no Hoare annotation was computed. [2022-02-20 17:16:42,092 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 62) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,092 INFO L854 garLoopResultBuilder]: At program point L38-3(lines 38 62) the Hoare annotation is: (let ((.cse0 (<= 1 |ULTIMATE.start_main_~y~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~y~0#1| 5))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0)) (let ((.cse2 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse2)) .cse0 .cse1 (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse2)))))) [2022-02-20 17:16:42,092 INFO L854 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 1 |ULTIMATE.start_main_~r~0#1|) (<= (* .cse1 2) |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ .cse1 |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,092 INFO L858 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2022-02-20 17:16:42,093 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 59) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (<= 1 |ULTIMATE.start_main_~r~0#1|) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,093 INFO L858 garLoopResultBuilder]: For program point L47-3(lines 47 59) no Hoare annotation was computed. [2022-02-20 17:16:42,093 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,093 INFO L854 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~r~0#1| .cse0)) (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 5) (= (+ |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~r~0#1| .cse0)))) [2022-02-20 17:16:42,094 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-02-20 17:16:42,094 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-02-20 17:16:42,094 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:16:42,094 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:16:42,094 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:16:42,094 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:16:42,095 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:16:42,095 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:16:42,095 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:16:42,096 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:16:42,098 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:16:42,099 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:16:42,102 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 17:16:42,103 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 17:16:42,106 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 17:16:42,106 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 17:16:42,106 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 17:16:42,107 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 17:16:42,107 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 17:16:42,108 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:16:42,108 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:16:42,108 INFO L163 areAnnotationChecker]: CFG has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:16:42,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:16:42 BoogieIcfgContainer [2022-02-20 17:16:42,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:16:42,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:16:42,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:16:42,117 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:16:42,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:16:29" (3/4) ... [2022-02-20 17:16:42,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:16:42,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:16:42,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:16:42,136 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:16:42,136 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:16:42,136 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:16:42,136 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:16:42,161 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:16:42,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:16:42,162 INFO L158 Benchmark]: Toolchain (without parser) took 13312.61ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 65.6MB in the beginning and 93.2MB in the end (delta: -27.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 17:16:42,162 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:16:42,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.25ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 69.7MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:16:42,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.21ms. Allocated memory is still 94.4MB. Free memory was 69.7MB in the beginning and 68.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:16:42,163 INFO L158 Benchmark]: Boogie Preprocessor took 17.37ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 67.2MB in the end (delta: 856.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:16:42,163 INFO L158 Benchmark]: RCFGBuilder took 352.44ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 55.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:16:42,163 INFO L158 Benchmark]: TraceAbstraction took 12608.34ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 55.1MB in the beginning and 96.3MB in the end (delta: -41.2MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2022-02-20 17:16:42,164 INFO L158 Benchmark]: Witness Printer took 44.08ms. Allocated memory is still 144.7MB. Free memory was 96.3MB in the beginning and 93.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:16:42,165 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.24ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.25ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 69.7MB in the end (delta: -4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.21ms. Allocated memory is still 94.4MB. Free memory was 69.7MB in the beginning and 68.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.37ms. Allocated memory is still 94.4MB. Free memory was 68.1MB in the beginning and 67.2MB in the end (delta: 856.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.44ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 55.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12608.34ms. Allocated memory was 94.4MB in the beginning and 144.7MB in the end (delta: 50.3MB). Free memory was 55.1MB in the beginning and 96.3MB in the end (delta: -41.2MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * Witness Printer took 44.08ms. Allocated memory is still 144.7MB. Free memory was 96.3MB in the beginning and 93.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 911 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 237 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 46 PreInvPairs, 77 NumberOfFragments, 282 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 879 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 815 SizeOfPredicates, 18 NumberOfNonLiveVariables, 649 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 383/400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((x == r + q * y && 1 <= y) && y <= 5) && 1 <= r) && b + x == a * y + r + q * y - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((x == r + q * y && 1 <= y) && y <= 5) && b + x == a * y + r + q * y - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:16:42,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE