./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound20.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf 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/egcd2-ll_unwindbound20.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 e28dece7c557d04b250d1b8a0324022ff350e7d3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/egcd2-ll_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e28dece7c557d04b250d1b8a0324022ff350e7d3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4f25ee8b --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:18:07,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:18:07,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:18:07,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:18:07,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:18:07,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:18:07,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:18:07,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:18:07,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:18:07,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:18:07,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:18:07,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:18:07,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:18:07,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:18:07,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:18:07,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:18:07,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:18:07,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:18:07,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:18:07,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:18:07,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:18:07,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:18:07,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:18:07,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:18:07,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:18:07,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:18:07,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:18:07,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:18:07,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:18:07,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:18:07,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:18:07,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:18:07,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:18:07,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:18:07,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:18:07,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:18:07,388 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:18:07,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:18:07,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:18:07,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:18:07,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:18:07,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-13 14:18:07,428 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:18:07,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:18:07,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:18:07,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:18:07,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:18:07,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:18:07,432 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:18:07,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:18:07,433 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:18:07,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:18:07,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:18:07,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:18:07,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:18:07,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:18:07,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:18:07,434 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:18:07,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:18:07,435 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:18:07,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:18:07,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:18:07,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:18:07,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:18:07,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:18:07,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:18:07,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:18:07,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:18:07,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:18:07,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:18:07,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:18:07,437 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:18:07,437 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 -> e28dece7c557d04b250d1b8a0324022ff350e7d3 [2021-09-13 14:18:07,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:18:07,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:18:07,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:18:07,785 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:18:07,786 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:18:07,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2021-09-13 14:18:07,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b769661f/bf25d219e9d94586ab02963e99773b02/FLAG6cab5ff90 [2021-09-13 14:18:08,271 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:18:08,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2021-09-13 14:18:08,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b769661f/bf25d219e9d94586ab02963e99773b02/FLAG6cab5ff90 [2021-09-13 14:18:08,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b769661f/bf25d219e9d94586ab02963e99773b02 [2021-09-13 14:18:08,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:18:08,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:18:08,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:18:08,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:18:08,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:18:08,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ce6c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08, skipping insertion in model container [2021-09-13 14:18:08,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:18:08,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:18:08,832 WARN L228 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/egcd2-ll_unwindbound20.c[490,503] [2021-09-13 14:18:08,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:18:08,865 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:18:08,873 WARN L228 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/egcd2-ll_unwindbound20.c[490,503] [2021-09-13 14:18:08,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:18:08,938 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:18:08,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08 WrapperNode [2021-09-13 14:18:08,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:18:08,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:18:08,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:18:08,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:18:08,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:18:08,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:18:08,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:18:08,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:18:08,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:08,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:09,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:09,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:18:09,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:18:09,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:18:09,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:18:09,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (1/1) ... [2021-09-13 14:18:09,020 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:18:09,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:09,043 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) [2021-09-13 14:18:09,064 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 [2021-09-13 14:18:09,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:18:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:18:09,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:18:09,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:18:09,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:18:09,373 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-09-13 14:18:09,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:18:09 BoogieIcfgContainer [2021-09-13 14:18:09,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:18:09,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:18:09,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:18:09,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:18:09,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:18:08" (1/3) ... [2021-09-13 14:18:09,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339f8371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:18:09, skipping insertion in model container [2021-09-13 14:18:09,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:18:08" (2/3) ... [2021-09-13 14:18:09,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339f8371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:18:09, skipping insertion in model container [2021-09-13 14:18:09,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:18:09" (3/3) ... [2021-09-13 14:18:09,381 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound20.c [2021-09-13 14:18:09,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:18:09,385 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-09-13 14:18:09,442 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:18:09,460 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-13 14:18:09,461 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-13 14:18:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 states have internal predecessors, (58), 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) [2021-09-13 14:18:09,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:18:09,480 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:09,480 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:09,481 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -141782897, now seen corresponding path program 1 times [2021-09-13 14:18:09,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:09,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756241736] [2021-09-13 14:18:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:09,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:09,689 INFO L281 TraceCheckUtils]: 0: Hoare triple {46#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {46#true} is VALID [2021-09-13 14:18:09,690 INFO L281 TraceCheckUtils]: 1: Hoare triple {46#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {46#true} is VALID [2021-09-13 14:18:09,691 INFO L281 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:18:09,691 INFO L281 TraceCheckUtils]: 3: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:18:09,691 INFO L281 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:18:09,692 INFO L281 TraceCheckUtils]: 5: Hoare triple {47#false} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:18:09,692 INFO L281 TraceCheckUtils]: 6: Hoare triple {47#false} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:18:09,693 INFO L281 TraceCheckUtils]: 7: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:18:09,693 INFO L281 TraceCheckUtils]: 8: Hoare triple {47#false} assume 0 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:18:09,694 INFO L281 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2021-09-13 14:18:09,694 INFO L281 TraceCheckUtils]: 10: Hoare triple {47#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {47#false} is VALID [2021-09-13 14:18:09,694 INFO L281 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0 == __VERIFIER_assert_~cond; {47#false} is VALID [2021-09-13 14:18:09,695 INFO L281 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2021-09-13 14:18:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:09,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:09,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756241736] [2021-09-13 14:18:09,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756241736] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:09,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:09,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:18:09,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190467921] [2021-09-13 14:18:09,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2021-09-13 14:18:09,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:09,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:18:09,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:09,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:18:09,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:18:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:18:09,771 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 states have internal predecessors, (58), 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 has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:18:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:09,933 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-09-13 14:18:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:18:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2021-09-13 14:18:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:18:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:18:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:18:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:18:09,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:18:10,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:10,046 INFO L225 Difference]: With dead ends: 83 [2021-09-13 14:18:10,046 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:18:10,049 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:18:10,052 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.15ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.40ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:10,053 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 1.15ms Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 68.40ms Time] [2021-09-13 14:18:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:18:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:18:10,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:10,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:18:10,090 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:18:10,091 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:18:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:10,094 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:18:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:18:10,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:10,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:10,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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 39 states. [2021-09-13 14:18:10,096 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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 39 states. [2021-09-13 14:18:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:10,099 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:18:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:18:10,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:10,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:10,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:10,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:18:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-09-13 14:18:10,104 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 13 [2021-09-13 14:18:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:10,105 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-09-13 14:18:10,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:18:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:18:10,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:18:10,106 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:10,106 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:10,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:18:10,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:10,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1057770534, now seen corresponding path program 1 times [2021-09-13 14:18:10,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:10,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631301174] [2021-09-13 14:18:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:10,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:10,121 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:10,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1632933712] [2021-09-13 14:18:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:10,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:10,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:10,124 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) [2021-09-13 14:18:10,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-09-13 14:18:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:18:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:10,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:10,367 INFO L281 TraceCheckUtils]: 0: Hoare triple {275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,368 INFO L281 TraceCheckUtils]: 1: Hoare triple {280#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,374 INFO L281 TraceCheckUtils]: 2: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,375 INFO L281 TraceCheckUtils]: 3: Hoare triple {280#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,375 INFO L281 TraceCheckUtils]: 4: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,376 INFO L281 TraceCheckUtils]: 5: Hoare triple {280#(<= ~counter~0 0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,377 INFO L281 TraceCheckUtils]: 6: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,377 INFO L281 TraceCheckUtils]: 7: Hoare triple {280#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,377 INFO L281 TraceCheckUtils]: 8: Hoare triple {280#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {280#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:10,378 INFO L281 TraceCheckUtils]: 9: Hoare triple {280#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {308#(<= |ULTIMATE.start_main_#t~post9| 0)} is VALID [2021-09-13 14:18:10,379 INFO L281 TraceCheckUtils]: 10: Hoare triple {308#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {276#false} is VALID [2021-09-13 14:18:10,380 INFO L281 TraceCheckUtils]: 11: Hoare triple {276#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {276#false} is VALID [2021-09-13 14:18:10,381 INFO L281 TraceCheckUtils]: 12: Hoare triple {276#false} assume 0 == __VERIFIER_assert_~cond; {276#false} is VALID [2021-09-13 14:18:10,382 INFO L281 TraceCheckUtils]: 13: Hoare triple {276#false} assume !false; {276#false} is VALID [2021-09-13 14:18:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:10,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:10,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:10,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631301174] [2021-09-13 14:18:10,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:10,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632933712] [2021-09-13 14:18:10,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632933712] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:10,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:10,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:18:10,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652254791] [2021-09-13 14:18:10,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2021-09-13 14:18:10,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:10,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-09-13 14:18:10,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:10,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:18:10,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:18:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:18:10,409 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-09-13 14:18:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:10,631 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2021-09-13 14:18:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:18:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2021-09-13 14:18:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-09-13 14:18:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2021-09-13 14:18:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-09-13 14:18:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2021-09-13 14:18:10,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2021-09-13 14:18:10,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:10,698 INFO L225 Difference]: With dead ends: 49 [2021-09-13 14:18:10,698 INFO L226 Difference]: Without dead ends: 41 [2021-09-13 14:18:10,699 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.78ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:18:10,700 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.14ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.66ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:10,700 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 2.14ms Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 98.66ms Time] [2021-09-13 14:18:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-09-13 14:18:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-09-13 14:18:10,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:10,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:18:10,707 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:18:10,707 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:18:10,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:10,709 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-09-13 14:18:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:18:10,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:10,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:10,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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 41 states. [2021-09-13 14:18:10,711 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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 41 states. [2021-09-13 14:18:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:10,713 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-09-13 14:18:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:18:10,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:10,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:10,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:10,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:18:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-09-13 14:18:10,716 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 14 [2021-09-13 14:18:10,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:10,716 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-09-13 14:18:10,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-09-13 14:18:10,716 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:18:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:18:10,717 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:10,717 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:10,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:10,940 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 [2021-09-13 14:18:10,940 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1568670238, now seen corresponding path program 1 times [2021-09-13 14:18:10,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:10,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259608348] [2021-09-13 14:18:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:10,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:10,951 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:10,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696132415] [2021-09-13 14:18:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:10,952 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:10,954 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) [2021-09-13 14:18:10,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-09-13 14:18:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:11,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:18:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:11,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:11,225 INFO L281 TraceCheckUtils]: 0: Hoare triple {509#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {509#true} is VALID [2021-09-13 14:18:11,225 INFO L281 TraceCheckUtils]: 1: Hoare triple {509#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {509#true} is VALID [2021-09-13 14:18:11,225 INFO L281 TraceCheckUtils]: 2: Hoare triple {509#true} assume !(0 == assume_abort_if_not_~cond); {509#true} is VALID [2021-09-13 14:18:11,226 INFO L281 TraceCheckUtils]: 3: Hoare triple {509#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {523#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:18:11,228 INFO L281 TraceCheckUtils]: 4: Hoare triple {523#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} assume !(0 == assume_abort_if_not_~cond); {527#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:18:11,230 INFO L281 TraceCheckUtils]: 5: Hoare triple {527#(<= 1 ULTIMATE.start_main_~y~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:11,230 INFO L281 TraceCheckUtils]: 6: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:11,231 INFO L281 TraceCheckUtils]: 7: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:11,231 INFO L281 TraceCheckUtils]: 8: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:11,232 INFO L281 TraceCheckUtils]: 9: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:11,232 INFO L281 TraceCheckUtils]: 10: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {531#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:11,233 INFO L281 TraceCheckUtils]: 11: Hoare triple {531#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {510#false} is VALID [2021-09-13 14:18:11,233 INFO L281 TraceCheckUtils]: 12: Hoare triple {510#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {510#false} is VALID [2021-09-13 14:18:11,233 INFO L281 TraceCheckUtils]: 13: Hoare triple {510#false} assume 0 == __VERIFIER_assert_~cond; {510#false} is VALID [2021-09-13 14:18:11,233 INFO L281 TraceCheckUtils]: 14: Hoare triple {510#false} assume !false; {510#false} is VALID [2021-09-13 14:18:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:11,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:11,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:11,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259608348] [2021-09-13 14:18:11,237 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:11,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696132415] [2021-09-13 14:18:11,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696132415] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:11,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:11,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:18:11,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630303490] [2021-09-13 14:18:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2021-09-13 14:18:11,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:11,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-09-13 14:18:11,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:11,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:18:11,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:11,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:18:11,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:18:11,258 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-09-13 14:18:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:11,577 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2021-09-13 14:18:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:18:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2021-09-13 14:18:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-09-13 14:18:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2021-09-13 14:18:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-09-13 14:18:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2021-09-13 14:18:11,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2021-09-13 14:18:11,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:11,662 INFO L225 Difference]: With dead ends: 69 [2021-09-13 14:18:11,662 INFO L226 Difference]: Without dead ends: 61 [2021-09-13 14:18:11,663 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 54.47ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:18:11,667 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.54ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 118.74ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:11,668 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 126 Unknown, 0 Unchecked, 4.54ms Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 118.74ms Time] [2021-09-13 14:18:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-09-13 14:18:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2021-09-13 14:18:11,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:11,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:18:11,693 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:18:11,695 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:18:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:11,704 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-09-13 14:18:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-09-13 14:18:11,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:11,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:11,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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 61 states. [2021-09-13 14:18:11,706 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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 61 states. [2021-09-13 14:18:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:11,709 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-09-13 14:18:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2021-09-13 14:18:11,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:11,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:11,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:11,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:18:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-09-13 14:18:11,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2021-09-13 14:18:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:11,714 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-09-13 14:18:11,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2021-09-13 14:18:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:18:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:18:11,715 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:11,716 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:11,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:11,929 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 [2021-09-13 14:18:11,930 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1384108475, now seen corresponding path program 1 times [2021-09-13 14:18:11,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:11,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132429119] [2021-09-13 14:18:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:11,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:11,941 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:11,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102839663] [2021-09-13 14:18:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:11,942 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:11,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:11,946 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) [2021-09-13 14:18:11,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-09-13 14:18:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:11,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:18:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:12,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:12,245 INFO L281 TraceCheckUtils]: 0: Hoare triple {817#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {817#true} is VALID [2021-09-13 14:18:12,245 INFO L281 TraceCheckUtils]: 1: Hoare triple {817#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {817#true} is VALID [2021-09-13 14:18:12,246 INFO L281 TraceCheckUtils]: 2: Hoare triple {817#true} assume !(0 == assume_abort_if_not_~cond); {817#true} is VALID [2021-09-13 14:18:12,247 INFO L281 TraceCheckUtils]: 3: Hoare triple {817#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {831#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:18:12,247 INFO L281 TraceCheckUtils]: 4: Hoare triple {831#(or (and (< ULTIMATE.start_main_~y~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~y~0)))} assume !(0 == assume_abort_if_not_~cond); {835#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:18:12,248 INFO L281 TraceCheckUtils]: 5: Hoare triple {835#(<= 1 ULTIMATE.start_main_~y~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:12,248 INFO L281 TraceCheckUtils]: 6: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:12,248 INFO L281 TraceCheckUtils]: 7: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:12,251 INFO L281 TraceCheckUtils]: 8: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 == assume_abort_if_not_~cond); {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:12,252 INFO L281 TraceCheckUtils]: 9: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:12,252 INFO L281 TraceCheckUtils]: 10: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:12,253 INFO L281 TraceCheckUtils]: 11: Hoare triple {839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:12,253 INFO L281 TraceCheckUtils]: 12: Hoare triple {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:12,254 INFO L281 TraceCheckUtils]: 13: Hoare triple {858#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {865#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:12,255 INFO L281 TraceCheckUtils]: 14: Hoare triple {865#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {818#false} is VALID [2021-09-13 14:18:12,256 INFO L281 TraceCheckUtils]: 15: Hoare triple {818#false} assume !false; {818#false} is VALID [2021-09-13 14:18:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:12,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:12,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:12,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132429119] [2021-09-13 14:18:12,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:12,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102839663] [2021-09-13 14:18:12,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102839663] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:12,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:12,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:18:12,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6646746] [2021-09-13 14:18:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 16 [2021-09-13 14:18:12,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:12,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:18:12,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:12,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:18:12,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:12,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:18:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:18:12,271 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:18:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:12,693 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2021-09-13 14:18:12,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:18:12,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 16 [2021-09-13 14:18:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:18:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2021-09-13 14:18:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:18:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2021-09-13 14:18:12,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2021-09-13 14:18:12,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:12,776 INFO L225 Difference]: With dead ends: 80 [2021-09-13 14:18:12,776 INFO L226 Difference]: Without dead ends: 78 [2021-09-13 14:18:12,776 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 85.71ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:18:12,777 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 154.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.57ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 156.74ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:12,777 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 207 Unknown, 0 Unchecked, 2.57ms Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 156.74ms Time] [2021-09-13 14:18:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-09-13 14:18:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2021-09-13 14:18:12,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:12,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:18:12,796 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:18:12,797 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:18:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:12,803 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2021-09-13 14:18:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-09-13 14:18:12,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:12,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:12,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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 78 states. [2021-09-13 14:18:12,804 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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 78 states. [2021-09-13 14:18:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:12,806 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2021-09-13 14:18:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2021-09-13 14:18:12,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:12,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:12,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:12,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:18:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-09-13 14:18:12,809 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2021-09-13 14:18:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:12,809 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-09-13 14:18:12,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2021-09-13 14:18:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-09-13 14:18:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:18:12,810 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:12,810 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:12,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:13,024 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 [2021-09-13 14:18:13,025 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1311460386, now seen corresponding path program 1 times [2021-09-13 14:18:13,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:13,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426400180] [2021-09-13 14:18:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:13,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:13,033 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:13,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1938349705] [2021-09-13 14:18:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:13,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:13,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:13,039 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) [2021-09-13 14:18:13,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-09-13 14:18:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:13,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:18:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:13,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:13,346 INFO L281 TraceCheckUtils]: 0: Hoare triple {1187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1187#true} is VALID [2021-09-13 14:18:13,346 INFO L281 TraceCheckUtils]: 1: Hoare triple {1187#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1187#true} is VALID [2021-09-13 14:18:13,346 INFO L281 TraceCheckUtils]: 2: Hoare triple {1187#true} assume !(0 == assume_abort_if_not_~cond); {1187#true} is VALID [2021-09-13 14:18:13,346 INFO L281 TraceCheckUtils]: 3: Hoare triple {1187#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1187#true} is VALID [2021-09-13 14:18:13,347 INFO L281 TraceCheckUtils]: 4: Hoare triple {1187#true} assume !(0 == assume_abort_if_not_~cond); {1187#true} is VALID [2021-09-13 14:18:13,347 INFO L281 TraceCheckUtils]: 5: Hoare triple {1187#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,348 INFO L281 TraceCheckUtils]: 6: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == assume_abort_if_not_~cond); {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,348 INFO L281 TraceCheckUtils]: 7: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,349 INFO L281 TraceCheckUtils]: 8: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == assume_abort_if_not_~cond); {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,349 INFO L281 TraceCheckUtils]: 9: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,350 INFO L281 TraceCheckUtils]: 10: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,350 INFO L281 TraceCheckUtils]: 11: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,351 INFO L281 TraceCheckUtils]: 12: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,351 INFO L281 TraceCheckUtils]: 13: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,352 INFO L281 TraceCheckUtils]: 14: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == __VERIFIER_assert_~cond); {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:18:13,352 INFO L281 TraceCheckUtils]: 15: Hoare triple {1207#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1238#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:13,353 INFO L281 TraceCheckUtils]: 16: Hoare triple {1238#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1188#false} is VALID [2021-09-13 14:18:13,353 INFO L281 TraceCheckUtils]: 17: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2021-09-13 14:18:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:13,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:13,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:13,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426400180] [2021-09-13 14:18:13,354 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:13,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938349705] [2021-09-13 14:18:13,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938349705] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:13,354 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:13,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:18:13,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317163029] [2021-09-13 14:18:13,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2021-09-13 14:18:13,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:13,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-09-13 14:18:13,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:13,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:18:13,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:18:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:18:13,374 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-09-13 14:18:13,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:13,606 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-09-13 14:18:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:18:13,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2021-09-13 14:18:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-09-13 14:18:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2021-09-13 14:18:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-09-13 14:18:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2021-09-13 14:18:13,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 66 transitions. [2021-09-13 14:18:13,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:13,663 INFO L225 Difference]: With dead ends: 64 [2021-09-13 14:18:13,663 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:18:13,663 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.11ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:18:13,664 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.24ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:13,664 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 96.24ms Time] [2021-09-13 14:18:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:18:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2021-09-13 14:18:13,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:13,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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) [2021-09-13 14:18:13,703 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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) [2021-09-13 14:18:13,703 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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) [2021-09-13 14:18:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:13,704 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-09-13 14:18:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-09-13 14:18:13,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:13,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:13,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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 62 states. [2021-09-13 14:18:13,705 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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 62 states. [2021-09-13 14:18:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:13,707 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2021-09-13 14:18:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-09-13 14:18:13,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:13,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:13,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:13,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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) [2021-09-13 14:18:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-09-13 14:18:13,709 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 18 [2021-09-13 14:18:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:13,710 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-09-13 14:18:13,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) [2021-09-13 14:18:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2021-09-13 14:18:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:18:13,711 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:13,711 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:13,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:13,924 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 [2021-09-13 14:18:13,925 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1862118746, now seen corresponding path program 1 times [2021-09-13 14:18:13,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:13,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679568035] [2021-09-13 14:18:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:13,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:13,935 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:13,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571523062] [2021-09-13 14:18:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:13,935 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:13,936 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) [2021-09-13 14:18:13,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-09-13 14:18:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:14,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:18:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:14,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:14,158 INFO L281 TraceCheckUtils]: 0: Hoare triple {1517#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,159 INFO L281 TraceCheckUtils]: 1: Hoare triple {1522#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,159 INFO L281 TraceCheckUtils]: 2: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,160 INFO L281 TraceCheckUtils]: 3: Hoare triple {1522#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,160 INFO L281 TraceCheckUtils]: 4: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,160 INFO L281 TraceCheckUtils]: 5: Hoare triple {1522#(<= ~counter~0 0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,161 INFO L281 TraceCheckUtils]: 6: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,161 INFO L281 TraceCheckUtils]: 7: Hoare triple {1522#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,161 INFO L281 TraceCheckUtils]: 8: Hoare triple {1522#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1522#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:14,162 INFO L281 TraceCheckUtils]: 9: Hoare triple {1522#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1550#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:14,162 INFO L281 TraceCheckUtils]: 10: Hoare triple {1550#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {1550#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:14,163 INFO L281 TraceCheckUtils]: 11: Hoare triple {1550#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {1550#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:14,163 INFO L281 TraceCheckUtils]: 12: Hoare triple {1550#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1560#(<= |ULTIMATE.start_main_#t~post10| 1)} is VALID [2021-09-13 14:18:14,163 INFO L281 TraceCheckUtils]: 13: Hoare triple {1560#(<= |ULTIMATE.start_main_#t~post10| 1)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {1518#false} is VALID [2021-09-13 14:18:14,164 INFO L281 TraceCheckUtils]: 14: Hoare triple {1518#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {1518#false} is VALID [2021-09-13 14:18:14,164 INFO L281 TraceCheckUtils]: 15: Hoare triple {1518#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1518#false} is VALID [2021-09-13 14:18:14,164 INFO L281 TraceCheckUtils]: 16: Hoare triple {1518#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {1518#false} is VALID [2021-09-13 14:18:14,164 INFO L281 TraceCheckUtils]: 17: Hoare triple {1518#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1518#false} is VALID [2021-09-13 14:18:14,164 INFO L281 TraceCheckUtils]: 18: Hoare triple {1518#false} assume 0 == __VERIFIER_assert_~cond; {1518#false} is VALID [2021-09-13 14:18:14,164 INFO L281 TraceCheckUtils]: 19: Hoare triple {1518#false} assume !false; {1518#false} is VALID [2021-09-13 14:18:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:14,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:14,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:14,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679568035] [2021-09-13 14:18:14,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:14,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571523062] [2021-09-13 14:18:14,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571523062] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:14,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:14,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:18:14,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782729673] [2021-09-13 14:18:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:18:14,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:14,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:18:14,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:14,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:18:14,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:14,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:18:14,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:18:14,184 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:18:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:14,404 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2021-09-13 14:18:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:18:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:18:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:18:14,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2021-09-13 14:18:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:18:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2021-09-13 14:18:14,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2021-09-13 14:18:14,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:14,476 INFO L225 Difference]: With dead ends: 85 [2021-09-13 14:18:14,476 INFO L226 Difference]: Without dead ends: 55 [2021-09-13 14:18:14,477 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.37ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:18:14,478 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.77ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.49ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:14,478 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.77ms Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 99.49ms Time] [2021-09-13 14:18:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-09-13 14:18:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-09-13 14:18:14,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:14,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 states have internal predecessors, (63), 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) [2021-09-13 14:18:14,513 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 states have internal predecessors, (63), 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) [2021-09-13 14:18:14,513 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 states have internal predecessors, (63), 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) [2021-09-13 14:18:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:14,515 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2021-09-13 14:18:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-09-13 14:18:14,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:14,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:14,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 states have internal predecessors, (63), 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 55 states. [2021-09-13 14:18:14,516 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 states have internal predecessors, (63), 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 55 states. [2021-09-13 14:18:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:14,517 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2021-09-13 14:18:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-09-13 14:18:14,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:14,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:14,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:14,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 54 states have internal predecessors, (63), 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) [2021-09-13 14:18:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2021-09-13 14:18:14,519 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2021-09-13 14:18:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:14,520 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2021-09-13 14:18:14,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2021-09-13 14:18:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2021-09-13 14:18:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:18:14,520 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:14,520 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:14,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:14,745 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 [2021-09-13 14:18:14,745 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1887855967, now seen corresponding path program 1 times [2021-09-13 14:18:14,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:14,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175359112] [2021-09-13 14:18:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:14,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:14,755 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:14,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054496473] [2021-09-13 14:18:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:14,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:14,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:14,759 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) [2021-09-13 14:18:14,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-09-13 14:18:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:14,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:18:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:14,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:15,260 INFO L281 TraceCheckUtils]: 0: Hoare triple {1866#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {1866#true} is VALID [2021-09-13 14:18:15,261 INFO L281 TraceCheckUtils]: 1: Hoare triple {1866#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1874#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} is VALID [2021-09-13 14:18:15,262 INFO L281 TraceCheckUtils]: 2: Hoare triple {1874#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} assume !(0 == assume_abort_if_not_~cond); {1878#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:15,262 INFO L281 TraceCheckUtils]: 3: Hoare triple {1878#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1878#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:15,263 INFO L281 TraceCheckUtils]: 4: Hoare triple {1878#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {1878#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:15,263 INFO L281 TraceCheckUtils]: 5: Hoare triple {1878#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,264 INFO L281 TraceCheckUtils]: 6: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,264 INFO L281 TraceCheckUtils]: 7: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,265 INFO L281 TraceCheckUtils]: 8: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,265 INFO L281 TraceCheckUtils]: 9: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,268 INFO L281 TraceCheckUtils]: 10: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,268 INFO L281 TraceCheckUtils]: 11: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,269 INFO L281 TraceCheckUtils]: 12: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,270 INFO L281 TraceCheckUtils]: 13: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,270 INFO L281 TraceCheckUtils]: 14: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,271 INFO L281 TraceCheckUtils]: 15: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,271 INFO L281 TraceCheckUtils]: 16: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:15,272 INFO L281 TraceCheckUtils]: 17: Hoare triple {1888#(and (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:15,272 INFO L281 TraceCheckUtils]: 18: Hoare triple {1925#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1867#false} is VALID [2021-09-13 14:18:15,272 INFO L281 TraceCheckUtils]: 19: Hoare triple {1867#false} assume !false; {1867#false} is VALID [2021-09-13 14:18:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:15,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:15,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:15,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175359112] [2021-09-13 14:18:15,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:15,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054496473] [2021-09-13 14:18:15,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054496473] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:15,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:15,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:18:15,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454151975] [2021-09-13 14:18:15,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:18:15,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:15,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:18:15,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:15,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:18:15,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:15,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:18:15,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:18:15,292 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:18:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:15,643 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2021-09-13 14:18:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:18:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20 [2021-09-13 14:18:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:18:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2021-09-13 14:18:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:18:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2021-09-13 14:18:15,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2021-09-13 14:18:15,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:15,700 INFO L225 Difference]: With dead ends: 62 [2021-09-13 14:18:15,700 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:18:15,700 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.72ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:18:15,701 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.25ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:15,701 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 122.25ms Time] [2021-09-13 14:18:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:18:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2021-09-13 14:18:15,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:15,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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) [2021-09-13 14:18:15,754 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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) [2021-09-13 14:18:15,755 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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) [2021-09-13 14:18:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:15,756 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2021-09-13 14:18:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2021-09-13 14:18:15,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:15,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:15,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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 60 states. [2021-09-13 14:18:15,757 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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 60 states. [2021-09-13 14:18:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:15,759 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2021-09-13 14:18:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2021-09-13 14:18:15,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:15,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:15,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:15,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 54 states have internal predecessors, (62), 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) [2021-09-13 14:18:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2021-09-13 14:18:15,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 20 [2021-09-13 14:18:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:15,762 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2021-09-13 14:18:15,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-09-13 14:18:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2021-09-13 14:18:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:18:15,762 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:15,763 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:15,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:15,982 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 [2021-09-13 14:18:15,983 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1753227772, now seen corresponding path program 1 times [2021-09-13 14:18:15,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:15,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831721336] [2021-09-13 14:18:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:15,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:15,992 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:15,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696598610] [2021-09-13 14:18:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:15,992 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:15,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:15,993 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:15,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-09-13 14:18:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:16,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2021-09-13 14:18:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:16,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:16,524 INFO L281 TraceCheckUtils]: 0: Hoare triple {2200#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2200#true} is VALID [2021-09-13 14:18:16,526 INFO L281 TraceCheckUtils]: 1: Hoare triple {2200#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2200#true} is VALID [2021-09-13 14:18:16,526 INFO L281 TraceCheckUtils]: 2: Hoare triple {2200#true} assume !(0 == assume_abort_if_not_~cond); {2200#true} is VALID [2021-09-13 14:18:16,539 INFO L281 TraceCheckUtils]: 3: Hoare triple {2200#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2200#true} is VALID [2021-09-13 14:18:16,539 INFO L281 TraceCheckUtils]: 4: Hoare triple {2200#true} assume !(0 == assume_abort_if_not_~cond); {2200#true} is VALID [2021-09-13 14:18:16,540 INFO L281 TraceCheckUtils]: 5: Hoare triple {2200#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,541 INFO L281 TraceCheckUtils]: 6: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,542 INFO L281 TraceCheckUtils]: 7: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,543 INFO L281 TraceCheckUtils]: 8: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,543 INFO L281 TraceCheckUtils]: 9: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,544 INFO L281 TraceCheckUtils]: 10: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,544 INFO L281 TraceCheckUtils]: 11: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,546 INFO L281 TraceCheckUtils]: 12: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,546 INFO L281 TraceCheckUtils]: 13: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,547 INFO L281 TraceCheckUtils]: 14: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,547 INFO L281 TraceCheckUtils]: 15: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,548 INFO L281 TraceCheckUtils]: 16: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,549 INFO L281 TraceCheckUtils]: 17: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2257#(and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,549 INFO L281 TraceCheckUtils]: 18: Hoare triple {2257#(and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:18:16,550 INFO L281 TraceCheckUtils]: 19: Hoare triple {2220#(and (= ULTIMATE.start_main_~yy~0 (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2264#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:16,555 INFO L281 TraceCheckUtils]: 20: Hoare triple {2264#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2201#false} is VALID [2021-09-13 14:18:16,556 INFO L281 TraceCheckUtils]: 21: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2021-09-13 14:18:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:16,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:18:16,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:16,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831721336] [2021-09-13 14:18:16,556 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:16,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696598610] [2021-09-13 14:18:16,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696598610] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:18:16,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:18:16,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:18:16,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851781888] [2021-09-13 14:18:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2021-09-13 14:18:16,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:16,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-09-13 14:18:16,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:16,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:18:16,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:16,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:18:16,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:18:16,584 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-09-13 14:18:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:16,855 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-09-13 14:18:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:18:16,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2021-09-13 14:18:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-09-13 14:18:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2021-09-13 14:18:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-09-13 14:18:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2021-09-13 14:18:16,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2021-09-13 14:18:16,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:16,920 INFO L225 Difference]: With dead ends: 67 [2021-09-13 14:18:16,920 INFO L226 Difference]: Without dead ends: 65 [2021-09-13 14:18:16,920 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.36ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:18:16,921 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.17ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.81ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:16,921 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 1.17ms Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 103.81ms Time] [2021-09-13 14:18:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-09-13 14:18:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2021-09-13 14:18:16,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:16,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 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) [2021-09-13 14:18:16,979 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 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) [2021-09-13 14:18:16,979 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 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) [2021-09-13 14:18:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:16,981 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-09-13 14:18:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-09-13 14:18:16,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:16,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:16,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 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 65 states. [2021-09-13 14:18:16,982 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 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 65 states. [2021-09-13 14:18:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:16,983 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-09-13 14:18:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-09-13 14:18:16,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:16,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:16,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:16,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 54 states have internal predecessors, (61), 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) [2021-09-13 14:18:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2021-09-13 14:18:16,986 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2021-09-13 14:18:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:16,986 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2021-09-13 14:18:16,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-09-13 14:18:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2021-09-13 14:18:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-09-13 14:18:16,987 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:16,987 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:17,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:17,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:17,205 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 29719088, now seen corresponding path program 1 times [2021-09-13 14:18:17,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:17,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020921742] [2021-09-13 14:18:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:17,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:17,213 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:17,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42159821] [2021-09-13 14:18:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:17,213 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:17,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:17,214 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:17,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-09-13 14:18:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:17,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:18:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:17,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:17,526 INFO L281 TraceCheckUtils]: 0: Hoare triple {2552#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2552#true} is VALID [2021-09-13 14:18:17,526 INFO L281 TraceCheckUtils]: 1: Hoare triple {2552#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:17,526 INFO L281 TraceCheckUtils]: 2: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 3: Hoare triple {2552#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 4: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 5: Hoare triple {2552#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 6: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 7: Hoare triple {2552#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 8: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 9: Hoare triple {2552#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2552#true} is VALID [2021-09-13 14:18:17,527 INFO L281 TraceCheckUtils]: 10: Hoare triple {2552#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2552#true} is VALID [2021-09-13 14:18:17,528 INFO L281 TraceCheckUtils]: 11: Hoare triple {2552#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,529 INFO L281 TraceCheckUtils]: 12: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,529 INFO L281 TraceCheckUtils]: 13: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,529 INFO L281 TraceCheckUtils]: 14: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,530 INFO L281 TraceCheckUtils]: 15: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,533 INFO L281 TraceCheckUtils]: 16: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,533 INFO L281 TraceCheckUtils]: 17: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,534 INFO L281 TraceCheckUtils]: 18: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,534 INFO L281 TraceCheckUtils]: 19: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,535 INFO L281 TraceCheckUtils]: 20: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:17,535 INFO L281 TraceCheckUtils]: 21: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:18:17,536 INFO L281 TraceCheckUtils]: 22: Hoare triple {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:18:17,536 INFO L281 TraceCheckUtils]: 23: Hoare triple {2621#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~k~0 1))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:17,537 INFO L281 TraceCheckUtils]: 24: Hoare triple {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2553#false} is VALID [2021-09-13 14:18:17,537 INFO L281 TraceCheckUtils]: 25: Hoare triple {2553#false} assume !false; {2553#false} is VALID [2021-09-13 14:18:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:17,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:44,119 INFO L281 TraceCheckUtils]: 25: Hoare triple {2553#false} assume !false; {2553#false} is VALID [2021-09-13 14:18:44,120 INFO L281 TraceCheckUtils]: 24: Hoare triple {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2553#false} is VALID [2021-09-13 14:18:44,121 INFO L281 TraceCheckUtils]: 23: Hoare triple {2641#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2628#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:44,121 INFO L281 TraceCheckUtils]: 22: Hoare triple {2641#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2641#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:44,122 INFO L281 TraceCheckUtils]: 21: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {2641#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:44,122 INFO L281 TraceCheckUtils]: 20: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,123 INFO L281 TraceCheckUtils]: 19: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,123 INFO L281 TraceCheckUtils]: 18: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,124 INFO L281 TraceCheckUtils]: 17: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,124 INFO L281 TraceCheckUtils]: 16: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,125 INFO L281 TraceCheckUtils]: 15: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,125 INFO L281 TraceCheckUtils]: 14: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,126 INFO L281 TraceCheckUtils]: 13: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,127 INFO L281 TraceCheckUtils]: 12: Hoare triple {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,127 INFO L281 TraceCheckUtils]: 11: Hoare triple {2552#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {2590#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:18:44,127 INFO L281 TraceCheckUtils]: 10: Hoare triple {2552#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2552#true} is VALID [2021-09-13 14:18:44,127 INFO L281 TraceCheckUtils]: 9: Hoare triple {2552#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2552#true} is VALID [2021-09-13 14:18:44,128 INFO L281 TraceCheckUtils]: 8: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:44,128 INFO L281 TraceCheckUtils]: 7: Hoare triple {2552#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:44,128 INFO L281 TraceCheckUtils]: 6: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:44,128 INFO L281 TraceCheckUtils]: 5: Hoare triple {2552#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:44,128 INFO L281 TraceCheckUtils]: 4: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:44,129 INFO L281 TraceCheckUtils]: 3: Hoare triple {2552#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:44,129 INFO L281 TraceCheckUtils]: 2: Hoare triple {2552#true} assume !(0 == assume_abort_if_not_~cond); {2552#true} is VALID [2021-09-13 14:18:44,129 INFO L281 TraceCheckUtils]: 1: Hoare triple {2552#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {2552#true} is VALID [2021-09-13 14:18:44,129 INFO L281 TraceCheckUtils]: 0: Hoare triple {2552#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {2552#true} is VALID [2021-09-13 14:18:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:44,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:44,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020921742] [2021-09-13 14:18:44,130 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:44,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42159821] [2021-09-13 14:18:44,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42159821] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:44,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:44,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-09-13 14:18:44,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277855044] [2021-09-13 14:18:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) Word has length 26 [2021-09-13 14:18:44,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:44,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-09-13 14:18:44,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:44,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:18:44,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:44,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:18:44,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:18:44,160 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-09-13 14:18:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:44,696 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2021-09-13 14:18:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:18:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) Word has length 26 [2021-09-13 14:18:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:44,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-09-13 14:18:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2021-09-13 14:18:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-09-13 14:18:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2021-09-13 14:18:44,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2021-09-13 14:18:44,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:44,773 INFO L225 Difference]: With dead ends: 106 [2021-09-13 14:18:44,773 INFO L226 Difference]: Without dead ends: 104 [2021-09-13 14:18:44,774 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.22ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:18:44,775 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 176.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.78ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 178.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:44,775 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 1.78ms Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 178.35ms Time] [2021-09-13 14:18:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-09-13 14:18:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 52. [2021-09-13 14:18:44,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:44,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 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) [2021-09-13 14:18:44,852 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 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) [2021-09-13 14:18:44,852 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 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) [2021-09-13 14:18:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:44,855 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2021-09-13 14:18:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2021-09-13 14:18:44,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:44,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:44,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 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 104 states. [2021-09-13 14:18:44,856 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 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 104 states. [2021-09-13 14:18:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:44,858 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2021-09-13 14:18:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2021-09-13 14:18:44,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:44,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:44,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:44,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 51 states have internal predecessors, (57), 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) [2021-09-13 14:18:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-09-13 14:18:44,860 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2021-09-13 14:18:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:44,861 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-09-13 14:18:44,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2021-09-13 14:18:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-09-13 14:18:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-09-13 14:18:44,863 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:44,863 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:44,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:45,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-09-13 14:18:45,077 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1666886870, now seen corresponding path program 1 times [2021-09-13 14:18:45,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:45,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205723784] [2021-09-13 14:18:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:45,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:45,086 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:45,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825617993] [2021-09-13 14:18:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:45,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:45,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:45,098 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:45,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-09-13 14:18:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:45,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:18:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:45,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:45,395 INFO L281 TraceCheckUtils]: 0: Hoare triple {3129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,396 INFO L281 TraceCheckUtils]: 1: Hoare triple {3134#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,396 INFO L281 TraceCheckUtils]: 2: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,397 INFO L281 TraceCheckUtils]: 3: Hoare triple {3134#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,397 INFO L281 TraceCheckUtils]: 4: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,398 INFO L281 TraceCheckUtils]: 5: Hoare triple {3134#(<= ~counter~0 0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,398 INFO L281 TraceCheckUtils]: 6: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,398 INFO L281 TraceCheckUtils]: 7: Hoare triple {3134#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,399 INFO L281 TraceCheckUtils]: 8: Hoare triple {3134#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {3134#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:45,400 INFO L281 TraceCheckUtils]: 9: Hoare triple {3134#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3162#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:45,400 INFO L281 TraceCheckUtils]: 10: Hoare triple {3162#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {3162#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:45,400 INFO L281 TraceCheckUtils]: 11: Hoare triple {3162#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {3162#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:45,401 INFO L281 TraceCheckUtils]: 12: Hoare triple {3162#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,406 INFO L281 TraceCheckUtils]: 13: Hoare triple {3172#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,406 INFO L281 TraceCheckUtils]: 14: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,407 INFO L281 TraceCheckUtils]: 15: Hoare triple {3172#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,407 INFO L281 TraceCheckUtils]: 16: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,408 INFO L281 TraceCheckUtils]: 17: Hoare triple {3172#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,408 INFO L281 TraceCheckUtils]: 18: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,408 INFO L281 TraceCheckUtils]: 19: Hoare triple {3172#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,409 INFO L281 TraceCheckUtils]: 20: Hoare triple {3172#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,409 INFO L281 TraceCheckUtils]: 21: Hoare triple {3172#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,410 INFO L281 TraceCheckUtils]: 22: Hoare triple {3172#(<= ~counter~0 2)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {3172#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:45,410 INFO L281 TraceCheckUtils]: 23: Hoare triple {3172#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3206#(<= |ULTIMATE.start_main_#t~post9| 2)} is VALID [2021-09-13 14:18:45,411 INFO L281 TraceCheckUtils]: 24: Hoare triple {3206#(<= |ULTIMATE.start_main_#t~post9| 2)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {3130#false} is VALID [2021-09-13 14:18:45,411 INFO L281 TraceCheckUtils]: 25: Hoare triple {3130#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3130#false} is VALID [2021-09-13 14:18:45,411 INFO L281 TraceCheckUtils]: 26: Hoare triple {3130#false} assume 0 == __VERIFIER_assert_~cond; {3130#false} is VALID [2021-09-13 14:18:45,411 INFO L281 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2021-09-13 14:18:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:45,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:45,666 INFO L281 TraceCheckUtils]: 27: Hoare triple {3130#false} assume !false; {3130#false} is VALID [2021-09-13 14:18:45,667 INFO L281 TraceCheckUtils]: 26: Hoare triple {3130#false} assume 0 == __VERIFIER_assert_~cond; {3130#false} is VALID [2021-09-13 14:18:45,667 INFO L281 TraceCheckUtils]: 25: Hoare triple {3130#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3130#false} is VALID [2021-09-13 14:18:45,667 INFO L281 TraceCheckUtils]: 24: Hoare triple {3228#(< |ULTIMATE.start_main_#t~post9| 20)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {3130#false} is VALID [2021-09-13 14:18:45,668 INFO L281 TraceCheckUtils]: 23: Hoare triple {3232#(< ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3228#(< |ULTIMATE.start_main_#t~post9| 20)} is VALID [2021-09-13 14:18:45,668 INFO L281 TraceCheckUtils]: 22: Hoare triple {3232#(< ~counter~0 20)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,669 INFO L281 TraceCheckUtils]: 21: Hoare triple {3232#(< ~counter~0 20)} assume !(main_~c~0 >= main_~b~0); {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,669 INFO L281 TraceCheckUtils]: 20: Hoare triple {3232#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,669 INFO L281 TraceCheckUtils]: 19: Hoare triple {3232#(< ~counter~0 20)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,670 INFO L281 TraceCheckUtils]: 18: Hoare triple {3232#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,670 INFO L281 TraceCheckUtils]: 17: Hoare triple {3232#(< ~counter~0 20)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,671 INFO L281 TraceCheckUtils]: 16: Hoare triple {3232#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,671 INFO L281 TraceCheckUtils]: 15: Hoare triple {3232#(< ~counter~0 20)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,672 INFO L281 TraceCheckUtils]: 14: Hoare triple {3232#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,672 INFO L281 TraceCheckUtils]: 13: Hoare triple {3232#(< ~counter~0 20)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,673 INFO L281 TraceCheckUtils]: 12: Hoare triple {3266#(< ~counter~0 19)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {3232#(< ~counter~0 20)} is VALID [2021-09-13 14:18:45,673 INFO L281 TraceCheckUtils]: 11: Hoare triple {3266#(< ~counter~0 19)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {3266#(< ~counter~0 19)} is VALID [2021-09-13 14:18:45,674 INFO L281 TraceCheckUtils]: 10: Hoare triple {3266#(< ~counter~0 19)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {3266#(< ~counter~0 19)} is VALID [2021-09-13 14:18:45,674 INFO L281 TraceCheckUtils]: 9: Hoare triple {3276#(< ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3266#(< ~counter~0 19)} is VALID [2021-09-13 14:18:45,675 INFO L281 TraceCheckUtils]: 8: Hoare triple {3276#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,675 INFO L281 TraceCheckUtils]: 7: Hoare triple {3276#(< ~counter~0 18)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,676 INFO L281 TraceCheckUtils]: 6: Hoare triple {3276#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,676 INFO L281 TraceCheckUtils]: 5: Hoare triple {3276#(< ~counter~0 18)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,676 INFO L281 TraceCheckUtils]: 4: Hoare triple {3276#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,677 INFO L281 TraceCheckUtils]: 3: Hoare triple {3276#(< ~counter~0 18)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,677 INFO L281 TraceCheckUtils]: 2: Hoare triple {3276#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,677 INFO L281 TraceCheckUtils]: 1: Hoare triple {3276#(< ~counter~0 18)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,679 INFO L281 TraceCheckUtils]: 0: Hoare triple {3129#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {3276#(< ~counter~0 18)} is VALID [2021-09-13 14:18:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:45,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:45,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205723784] [2021-09-13 14:18:45,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:45,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825617993] [2021-09-13 14:18:45,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825617993] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:45,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:45,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:18:45,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63990063] [2021-09-13 14:18:45,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) Word has length 28 [2021-09-13 14:18:45,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:45,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-09-13 14:18:45,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:45,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:18:45,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:18:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:18:45,724 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-09-13 14:18:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:46,408 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2021-09-13 14:18:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:18:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) Word has length 28 [2021-09-13 14:18:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-09-13 14:18:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 153 transitions. [2021-09-13 14:18:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-09-13 14:18:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 153 transitions. [2021-09-13 14:18:46,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 153 transitions. [2021-09-13 14:18:46,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:46,528 INFO L225 Difference]: With dead ends: 171 [2021-09-13 14:18:46,528 INFO L226 Difference]: Without dead ends: 163 [2021-09-13 14:18:46,529 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 77.24ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:18:46,529 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 172.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.49ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 175.18ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:46,529 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 2.49ms Time], IncrementalHoareTripleChecker [17 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 175.18ms Time] [2021-09-13 14:18:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-09-13 14:18:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 121. [2021-09-13 14:18:46,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:46,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 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) [2021-09-13 14:18:46,799 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 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) [2021-09-13 14:18:46,800 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 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) [2021-09-13 14:18:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:46,803 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2021-09-13 14:18:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2021-09-13 14:18:46,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:46,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:46,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 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 163 states. [2021-09-13 14:18:46,804 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 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 163 states. [2021-09-13 14:18:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:46,808 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2021-09-13 14:18:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2021-09-13 14:18:46,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:46,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:46,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:46,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.25) internal successors, (145), 120 states have internal predecessors, (145), 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) [2021-09-13 14:18:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2021-09-13 14:18:46,813 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 28 [2021-09-13 14:18:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:46,813 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2021-09-13 14:18:46,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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) [2021-09-13 14:18:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2021-09-13 14:18:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-09-13 14:18:46,815 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:46,815 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:46,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:47,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-09-13 14:18:47,029 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:47,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash -134066994, now seen corresponding path program 1 times [2021-09-13 14:18:47,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:47,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517409238] [2021-09-13 14:18:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:47,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:47,036 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:47,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875962762] [2021-09-13 14:18:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:47,040 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:47,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:47,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-09-13 14:18:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:47,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:18:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:47,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:47,378 INFO L281 TraceCheckUtils]: 0: Hoare triple {4028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {4028#true} is VALID [2021-09-13 14:18:47,380 INFO L281 TraceCheckUtils]: 1: Hoare triple {4028#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4036#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} is VALID [2021-09-13 14:18:47,387 INFO L281 TraceCheckUtils]: 2: Hoare triple {4036#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:47,388 INFO L281 TraceCheckUtils]: 3: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:47,389 INFO L281 TraceCheckUtils]: 4: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:47,390 INFO L281 TraceCheckUtils]: 5: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,391 INFO L281 TraceCheckUtils]: 6: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,391 INFO L281 TraceCheckUtils]: 7: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,392 INFO L281 TraceCheckUtils]: 8: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,394 INFO L281 TraceCheckUtils]: 9: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,395 INFO L281 TraceCheckUtils]: 10: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,396 INFO L281 TraceCheckUtils]: 11: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,396 INFO L281 TraceCheckUtils]: 12: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,396 INFO L281 TraceCheckUtils]: 13: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,397 INFO L281 TraceCheckUtils]: 14: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,397 INFO L281 TraceCheckUtils]: 15: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,398 INFO L281 TraceCheckUtils]: 16: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,398 INFO L281 TraceCheckUtils]: 17: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,398 INFO L281 TraceCheckUtils]: 18: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,399 INFO L281 TraceCheckUtils]: 19: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,399 INFO L281 TraceCheckUtils]: 20: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,399 INFO L281 TraceCheckUtils]: 21: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,400 INFO L281 TraceCheckUtils]: 22: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:47,400 INFO L281 TraceCheckUtils]: 23: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:47,400 INFO L281 TraceCheckUtils]: 24: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:47,401 INFO L281 TraceCheckUtils]: 25: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {4029#false} is VALID [2021-09-13 14:18:47,409 INFO L281 TraceCheckUtils]: 26: Hoare triple {4029#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4029#false} is VALID [2021-09-13 14:18:47,409 INFO L281 TraceCheckUtils]: 27: Hoare triple {4029#false} assume 0 == __VERIFIER_assert_~cond; {4029#false} is VALID [2021-09-13 14:18:47,409 INFO L281 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2021-09-13 14:18:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:47,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:47,616 INFO L281 TraceCheckUtils]: 28: Hoare triple {4029#false} assume !false; {4029#false} is VALID [2021-09-13 14:18:47,616 INFO L281 TraceCheckUtils]: 27: Hoare triple {4029#false} assume 0 == __VERIFIER_assert_~cond; {4029#false} is VALID [2021-09-13 14:18:47,616 INFO L281 TraceCheckUtils]: 26: Hoare triple {4029#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4029#false} is VALID [2021-09-13 14:18:47,617 INFO L281 TraceCheckUtils]: 25: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {4029#false} is VALID [2021-09-13 14:18:47,617 INFO L281 TraceCheckUtils]: 24: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:47,618 INFO L281 TraceCheckUtils]: 23: Hoare triple {4103#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:47,619 INFO L281 TraceCheckUtils]: 22: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {4103#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:47,619 INFO L281 TraceCheckUtils]: 21: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,620 INFO L281 TraceCheckUtils]: 20: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,620 INFO L281 TraceCheckUtils]: 19: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,620 INFO L281 TraceCheckUtils]: 18: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,621 INFO L281 TraceCheckUtils]: 17: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,621 INFO L281 TraceCheckUtils]: 16: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,621 INFO L281 TraceCheckUtils]: 15: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,621 INFO L281 TraceCheckUtils]: 14: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,622 INFO L281 TraceCheckUtils]: 13: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,622 INFO L281 TraceCheckUtils]: 12: Hoare triple {4069#(<= 1 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,622 INFO L281 TraceCheckUtils]: 11: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {4069#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:18:47,623 INFO L281 TraceCheckUtils]: 10: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,623 INFO L281 TraceCheckUtils]: 9: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,623 INFO L281 TraceCheckUtils]: 8: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,624 INFO L281 TraceCheckUtils]: 7: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,624 INFO L281 TraceCheckUtils]: 6: Hoare triple {4050#(<= 1 ULTIMATE.start_main_~a~0)} assume !(0 == assume_abort_if_not_~cond); {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,625 INFO L281 TraceCheckUtils]: 5: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4050#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:18:47,625 INFO L281 TraceCheckUtils]: 4: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:47,625 INFO L281 TraceCheckUtils]: 3: Hoare triple {4040#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:47,626 INFO L281 TraceCheckUtils]: 2: Hoare triple {4200#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {4040#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:47,626 INFO L281 TraceCheckUtils]: 1: Hoare triple {4028#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {4200#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:47,626 INFO L281 TraceCheckUtils]: 0: Hoare triple {4028#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {4028#true} is VALID [2021-09-13 14:18:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:47,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:47,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517409238] [2021-09-13 14:18:47,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:47,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875962762] [2021-09-13 14:18:47,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875962762] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:47,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:47,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:18:47,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473585003] [2021-09-13 14:18:47,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) Word has length 29 [2021-09-13 14:18:47,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:47,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2021-09-13 14:18:47,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:47,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:18:47,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:18:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:18:47,664 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2021-09-13 14:18:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:48,661 INFO L93 Difference]: Finished difference Result 264 states and 305 transitions. [2021-09-13 14:18:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:18:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) Word has length 29 [2021-09-13 14:18:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2021-09-13 14:18:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2021-09-13 14:18:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2021-09-13 14:18:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2021-09-13 14:18:48,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 178 transitions. [2021-09-13 14:18:48,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:48,796 INFO L225 Difference]: With dead ends: 264 [2021-09-13 14:18:48,796 INFO L226 Difference]: Without dead ends: 256 [2021-09-13 14:18:48,797 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 100.73ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:18:48,797 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 245.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 248.35ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:48,798 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 332 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [13 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 248.35ms Time] [2021-09-13 14:18:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-09-13 14:18:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 179. [2021-09-13 14:18:49,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:49,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 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) [2021-09-13 14:18:49,235 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 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) [2021-09-13 14:18:49,236 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 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) [2021-09-13 14:18:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:49,241 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2021-09-13 14:18:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2021-09-13 14:18:49,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:49,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:49,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 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 256 states. [2021-09-13 14:18:49,242 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 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 256 states. [2021-09-13 14:18:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:49,248 INFO L93 Difference]: Finished difference Result 256 states and 295 transitions. [2021-09-13 14:18:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 295 transitions. [2021-09-13 14:18:49,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:49,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:49,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:49,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.2988505747126438) internal successors, (226), 178 states have internal predecessors, (226), 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) [2021-09-13 14:18:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 226 transitions. [2021-09-13 14:18:49,253 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 226 transitions. Word has length 29 [2021-09-13 14:18:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:49,254 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 226 transitions. [2021-09-13 14:18:49,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 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) [2021-09-13 14:18:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2021-09-13 14:18:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:18:49,254 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:49,255 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:49,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:49,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-09-13 14:18:49,477 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash -94400183, now seen corresponding path program 1 times [2021-09-13 14:18:49,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:49,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712993289] [2021-09-13 14:18:49,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:49,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:49,485 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:49,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714346345] [2021-09-13 14:18:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:49,486 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:49,492 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:49,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-09-13 14:18:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:49,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:18:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:49,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:49,793 INFO L281 TraceCheckUtils]: 0: Hoare triple {5331#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,793 INFO L281 TraceCheckUtils]: 1: Hoare triple {5336#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,793 INFO L281 TraceCheckUtils]: 2: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,794 INFO L281 TraceCheckUtils]: 3: Hoare triple {5336#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,794 INFO L281 TraceCheckUtils]: 4: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,795 INFO L281 TraceCheckUtils]: 5: Hoare triple {5336#(<= ~counter~0 0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,795 INFO L281 TraceCheckUtils]: 6: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,795 INFO L281 TraceCheckUtils]: 7: Hoare triple {5336#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,796 INFO L281 TraceCheckUtils]: 8: Hoare triple {5336#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {5336#(<= ~counter~0 0)} is VALID [2021-09-13 14:18:49,796 INFO L281 TraceCheckUtils]: 9: Hoare triple {5336#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5364#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:49,797 INFO L281 TraceCheckUtils]: 10: Hoare triple {5364#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {5364#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:49,797 INFO L281 TraceCheckUtils]: 11: Hoare triple {5364#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {5364#(<= ~counter~0 1)} is VALID [2021-09-13 14:18:49,798 INFO L281 TraceCheckUtils]: 12: Hoare triple {5364#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,798 INFO L281 TraceCheckUtils]: 13: Hoare triple {5374#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,798 INFO L281 TraceCheckUtils]: 14: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,799 INFO L281 TraceCheckUtils]: 15: Hoare triple {5374#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,799 INFO L281 TraceCheckUtils]: 16: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,799 INFO L281 TraceCheckUtils]: 17: Hoare triple {5374#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,800 INFO L281 TraceCheckUtils]: 18: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,800 INFO L281 TraceCheckUtils]: 19: Hoare triple {5374#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,800 INFO L281 TraceCheckUtils]: 20: Hoare triple {5374#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,801 INFO L281 TraceCheckUtils]: 21: Hoare triple {5374#(<= ~counter~0 2)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {5374#(<= ~counter~0 2)} is VALID [2021-09-13 14:18:49,801 INFO L281 TraceCheckUtils]: 22: Hoare triple {5374#(<= ~counter~0 2)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5405#(<= |ULTIMATE.start_main_#t~post10| 2)} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 23: Hoare triple {5405#(<= |ULTIMATE.start_main_#t~post10| 2)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {5332#false} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 24: Hoare triple {5332#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {5332#false} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 25: Hoare triple {5332#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 26: Hoare triple {5332#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 27: Hoare triple {5332#false} assume !(0 != main_~b~0); {5332#false} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 28: Hoare triple {5332#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5332#false} is VALID [2021-09-13 14:18:49,802 INFO L281 TraceCheckUtils]: 29: Hoare triple {5332#false} assume 0 == __VERIFIER_assert_~cond; {5332#false} is VALID [2021-09-13 14:18:49,803 INFO L281 TraceCheckUtils]: 30: Hoare triple {5332#false} assume !false; {5332#false} is VALID [2021-09-13 14:18:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:49,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:50,010 INFO L281 TraceCheckUtils]: 30: Hoare triple {5332#false} assume !false; {5332#false} is VALID [2021-09-13 14:18:50,010 INFO L281 TraceCheckUtils]: 29: Hoare triple {5332#false} assume 0 == __VERIFIER_assert_~cond; {5332#false} is VALID [2021-09-13 14:18:50,011 INFO L281 TraceCheckUtils]: 28: Hoare triple {5332#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5332#false} is VALID [2021-09-13 14:18:50,011 INFO L281 TraceCheckUtils]: 27: Hoare triple {5332#false} assume !(0 != main_~b~0); {5332#false} is VALID [2021-09-13 14:18:50,011 INFO L281 TraceCheckUtils]: 26: Hoare triple {5332#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:50,011 INFO L281 TraceCheckUtils]: 25: Hoare triple {5332#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5332#false} is VALID [2021-09-13 14:18:50,011 INFO L281 TraceCheckUtils]: 24: Hoare triple {5332#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {5332#false} is VALID [2021-09-13 14:18:50,011 INFO L281 TraceCheckUtils]: 23: Hoare triple {5451#(< |ULTIMATE.start_main_#t~post10| 20)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {5332#false} is VALID [2021-09-13 14:18:50,012 INFO L281 TraceCheckUtils]: 22: Hoare triple {5455#(< ~counter~0 20)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5451#(< |ULTIMATE.start_main_#t~post10| 20)} is VALID [2021-09-13 14:18:50,012 INFO L281 TraceCheckUtils]: 21: Hoare triple {5455#(< ~counter~0 20)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,012 INFO L281 TraceCheckUtils]: 20: Hoare triple {5455#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,012 INFO L281 TraceCheckUtils]: 19: Hoare triple {5455#(< ~counter~0 20)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,013 INFO L281 TraceCheckUtils]: 18: Hoare triple {5455#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,013 INFO L281 TraceCheckUtils]: 17: Hoare triple {5455#(< ~counter~0 20)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,013 INFO L281 TraceCheckUtils]: 16: Hoare triple {5455#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,014 INFO L281 TraceCheckUtils]: 15: Hoare triple {5455#(< ~counter~0 20)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,015 INFO L281 TraceCheckUtils]: 14: Hoare triple {5455#(< ~counter~0 20)} assume !(0 == __VERIFIER_assert_~cond); {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,015 INFO L281 TraceCheckUtils]: 13: Hoare triple {5455#(< ~counter~0 20)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,015 INFO L281 TraceCheckUtils]: 12: Hoare triple {5486#(< ~counter~0 19)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5455#(< ~counter~0 20)} is VALID [2021-09-13 14:18:50,016 INFO L281 TraceCheckUtils]: 11: Hoare triple {5486#(< ~counter~0 19)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {5486#(< ~counter~0 19)} is VALID [2021-09-13 14:18:50,016 INFO L281 TraceCheckUtils]: 10: Hoare triple {5486#(< ~counter~0 19)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {5486#(< ~counter~0 19)} is VALID [2021-09-13 14:18:50,016 INFO L281 TraceCheckUtils]: 9: Hoare triple {5496#(< ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5486#(< ~counter~0 19)} is VALID [2021-09-13 14:18:50,017 INFO L281 TraceCheckUtils]: 8: Hoare triple {5496#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,017 INFO L281 TraceCheckUtils]: 7: Hoare triple {5496#(< ~counter~0 18)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,017 INFO L281 TraceCheckUtils]: 6: Hoare triple {5496#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,018 INFO L281 TraceCheckUtils]: 5: Hoare triple {5496#(< ~counter~0 18)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,018 INFO L281 TraceCheckUtils]: 4: Hoare triple {5496#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,018 INFO L281 TraceCheckUtils]: 3: Hoare triple {5496#(< ~counter~0 18)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,018 INFO L281 TraceCheckUtils]: 2: Hoare triple {5496#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,019 INFO L281 TraceCheckUtils]: 1: Hoare triple {5496#(< ~counter~0 18)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,019 INFO L281 TraceCheckUtils]: 0: Hoare triple {5331#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {5496#(< ~counter~0 18)} is VALID [2021-09-13 14:18:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:50,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:50,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712993289] [2021-09-13 14:18:50,020 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:50,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714346345] [2021-09-13 14:18:50,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714346345] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:50,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:50,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:18:50,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925248648] [2021-09-13 14:18:50,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) Word has length 31 [2021-09-13 14:18:50,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:50,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-09-13 14:18:50,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:50,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:18:50,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:18:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:18:50,061 INFO L87 Difference]: Start difference. First operand 179 states and 226 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-09-13 14:18:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:50,804 INFO L93 Difference]: Finished difference Result 313 states and 385 transitions. [2021-09-13 14:18:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-09-13 14:18:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) Word has length 31 [2021-09-13 14:18:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-09-13 14:18:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2021-09-13 14:18:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-09-13 14:18:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2021-09-13 14:18:50,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 166 transitions. [2021-09-13 14:18:50,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:50,939 INFO L225 Difference]: With dead ends: 313 [2021-09-13 14:18:50,939 INFO L226 Difference]: Without dead ends: 220 [2021-09-13 14:18:50,940 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 69.58ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:18:50,940 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 165.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.60ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 167.50ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:50,940 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 253 Unknown, 0 Unchecked, 1.60ms Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 167.50ms Time] [2021-09-13 14:18:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-09-13 14:18:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 192. [2021-09-13 14:18:51,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:51,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 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) [2021-09-13 14:18:51,311 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 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) [2021-09-13 14:18:51,311 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 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) [2021-09-13 14:18:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:51,315 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2021-09-13 14:18:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2021-09-13 14:18:51,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:51,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:51,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 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 220 states. [2021-09-13 14:18:51,317 INFO L87 Difference]: Start difference. First operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 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 220 states. [2021-09-13 14:18:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:51,326 INFO L93 Difference]: Finished difference Result 220 states and 254 transitions. [2021-09-13 14:18:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2021-09-13 14:18:51,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:51,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:51,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:51,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.2513368983957218) internal successors, (234), 191 states have internal predecessors, (234), 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) [2021-09-13 14:18:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2021-09-13 14:18:51,332 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 31 [2021-09-13 14:18:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:51,332 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2021-09-13 14:18:51,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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) [2021-09-13 14:18:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2021-09-13 14:18:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:18:51,333 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:51,333 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:51,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:51,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-09-13 14:18:51,549 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:51,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash 302394158, now seen corresponding path program 1 times [2021-09-13 14:18:51,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:51,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721051020] [2021-09-13 14:18:51,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:51,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:51,555 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:51,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624194903] [2021-09-13 14:18:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:51,556 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:51,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:51,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:51,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-09-13 14:18:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:51,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2021-09-13 14:18:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:51,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:52,143 INFO L281 TraceCheckUtils]: 0: Hoare triple {6664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {6664#true} is VALID [2021-09-13 14:18:52,144 INFO L281 TraceCheckUtils]: 1: Hoare triple {6664#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,144 INFO L281 TraceCheckUtils]: 2: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:52,144 INFO L281 TraceCheckUtils]: 3: Hoare triple {6664#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,144 INFO L281 TraceCheckUtils]: 4: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:52,145 INFO L281 TraceCheckUtils]: 5: Hoare triple {6664#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,145 INFO L281 TraceCheckUtils]: 6: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == assume_abort_if_not_~cond); {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,149 INFO L281 TraceCheckUtils]: 7: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,150 INFO L281 TraceCheckUtils]: 8: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == assume_abort_if_not_~cond); {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,152 INFO L281 TraceCheckUtils]: 9: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,152 INFO L281 TraceCheckUtils]: 10: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,153 INFO L281 TraceCheckUtils]: 11: Hoare triple {6684#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,154 INFO L281 TraceCheckUtils]: 12: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,154 INFO L281 TraceCheckUtils]: 13: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,155 INFO L281 TraceCheckUtils]: 14: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,155 INFO L281 TraceCheckUtils]: 15: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,155 INFO L281 TraceCheckUtils]: 16: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,157 INFO L281 TraceCheckUtils]: 17: Hoare triple {6703#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6722#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,158 INFO L281 TraceCheckUtils]: 18: Hoare triple {6722#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (or (and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (and (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,159 INFO L281 TraceCheckUtils]: 19: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,159 INFO L281 TraceCheckUtils]: 20: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(0 == __VERIFIER_assert_~cond); {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,159 INFO L281 TraceCheckUtils]: 21: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} assume !(main_~c~0 >= main_~b~0); {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} is VALID [2021-09-13 14:18:52,160 INFO L281 TraceCheckUtils]: 22: Hoare triple {6726#(and (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~q~0 0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,161 INFO L281 TraceCheckUtils]: 23: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,161 INFO L281 TraceCheckUtils]: 24: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,162 INFO L281 TraceCheckUtils]: 25: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,162 INFO L281 TraceCheckUtils]: 26: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,162 INFO L281 TraceCheckUtils]: 27: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,163 INFO L281 TraceCheckUtils]: 28: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} assume !(0 == __VERIFIER_assert_~cond); {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} is VALID [2021-09-13 14:18:52,163 INFO L281 TraceCheckUtils]: 29: Hoare triple {6739#(and (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:52,164 INFO L281 TraceCheckUtils]: 30: Hoare triple {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {6665#false} is VALID [2021-09-13 14:18:52,164 INFO L281 TraceCheckUtils]: 31: Hoare triple {6665#false} assume !false; {6665#false} is VALID [2021-09-13 14:18:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:52,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:52,427 INFO L281 TraceCheckUtils]: 31: Hoare triple {6665#false} assume !false; {6665#false} is VALID [2021-09-13 14:18:52,428 INFO L281 TraceCheckUtils]: 30: Hoare triple {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {6665#false} is VALID [2021-09-13 14:18:52,429 INFO L281 TraceCheckUtils]: 29: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6761#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:52,429 INFO L281 TraceCheckUtils]: 28: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !(0 == __VERIFIER_assert_~cond); {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,429 INFO L281 TraceCheckUtils]: 27: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,430 INFO L281 TraceCheckUtils]: 26: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,430 INFO L281 TraceCheckUtils]: 25: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,430 INFO L281 TraceCheckUtils]: 24: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,431 INFO L281 TraceCheckUtils]: 23: Hoare triple {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,431 INFO L281 TraceCheckUtils]: 22: Hoare triple {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {6774#(= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:18:52,432 INFO L281 TraceCheckUtils]: 21: Hoare triple {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= main_~b~0); {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:52,432 INFO L281 TraceCheckUtils]: 20: Hoare triple {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:52,432 INFO L281 TraceCheckUtils]: 19: Hoare triple {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:52,433 INFO L281 TraceCheckUtils]: 18: Hoare triple {6809#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {6796#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:52,433 INFO L281 TraceCheckUtils]: 17: Hoare triple {6664#true} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6809#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:18:52,433 INFO L281 TraceCheckUtils]: 16: Hoare triple {6664#true} assume !(0 == __VERIFIER_assert_~cond); {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 15: Hoare triple {6664#true} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 14: Hoare triple {6664#true} assume !(0 == __VERIFIER_assert_~cond); {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 13: Hoare triple {6664#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 12: Hoare triple {6664#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 11: Hoare triple {6664#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 10: Hoare triple {6664#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {6664#true} is VALID [2021-09-13 14:18:52,434 INFO L281 TraceCheckUtils]: 9: Hoare triple {6664#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6664#true} is VALID [2021-09-13 14:18:52,435 INFO L281 TraceCheckUtils]: 8: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:52,435 INFO L281 TraceCheckUtils]: 7: Hoare triple {6664#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,435 INFO L281 TraceCheckUtils]: 6: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:52,435 INFO L281 TraceCheckUtils]: 5: Hoare triple {6664#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,435 INFO L281 TraceCheckUtils]: 4: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:52,435 INFO L281 TraceCheckUtils]: 3: Hoare triple {6664#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,436 INFO L281 TraceCheckUtils]: 2: Hoare triple {6664#true} assume !(0 == assume_abort_if_not_~cond); {6664#true} is VALID [2021-09-13 14:18:52,436 INFO L281 TraceCheckUtils]: 1: Hoare triple {6664#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {6664#true} is VALID [2021-09-13 14:18:52,436 INFO L281 TraceCheckUtils]: 0: Hoare triple {6664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {6664#true} is VALID [2021-09-13 14:18:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:52,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:52,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721051020] [2021-09-13 14:18:52,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:52,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624194903] [2021-09-13 14:18:52,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624194903] provided 1 perfect and 1 imperfect interpolant sequences [2021-09-13 14:18:52,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-09-13 14:18:52,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-09-13 14:18:52,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240133076] [2021-09-13 14:18:52,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) Word has length 32 [2021-09-13 14:18:52,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:52,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-09-13 14:18:52,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:52,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:18:52,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:18:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:18:52,464 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-09-13 14:18:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:53,587 INFO L93 Difference]: Finished difference Result 294 states and 364 transitions. [2021-09-13 14:18:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:18:53,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) Word has length 32 [2021-09-13 14:18:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:18:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-09-13 14:18:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2021-09-13 14:18:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-09-13 14:18:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 100 transitions. [2021-09-13 14:18:53,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 100 transitions. [2021-09-13 14:18:53,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:53,684 INFO L225 Difference]: With dead ends: 294 [2021-09-13 14:18:53,684 INFO L226 Difference]: Without dead ends: 286 [2021-09-13 14:18:53,684 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 183.89ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:18:53,685 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 162.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.16ms IncrementalHoareTripleChecker+Time [2021-09-13 14:18:53,686 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [18 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 164.16ms Time] [2021-09-13 14:18:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-09-13 14:18:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 269. [2021-09-13 14:18:54,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:18:54,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states. Second operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 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) [2021-09-13 14:18:54,295 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 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) [2021-09-13 14:18:54,295 INFO L87 Difference]: Start difference. First operand 286 states. Second operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 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) [2021-09-13 14:18:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:54,301 INFO L93 Difference]: Finished difference Result 286 states and 345 transitions. [2021-09-13 14:18:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 345 transitions. [2021-09-13 14:18:54,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:54,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:54,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 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 286 states. [2021-09-13 14:18:54,303 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 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 286 states. [2021-09-13 14:18:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:18:54,309 INFO L93 Difference]: Finished difference Result 286 states and 345 transitions. [2021-09-13 14:18:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 345 transitions. [2021-09-13 14:18:54,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:18:54,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:18:54,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:18:54,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:18:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.2575757575757576) internal successors, (332), 268 states have internal predecessors, (332), 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) [2021-09-13 14:18:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2021-09-13 14:18:54,317 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 32 [2021-09-13 14:18:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:18:54,317 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2021-09-13 14:18:54,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) [2021-09-13 14:18:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2021-09-13 14:18:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-09-13 14:18:54,318 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:18:54,318 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:18:54,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-09-13 14:18:54,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-09-13 14:18:54,541 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:18:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:18:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1456833039, now seen corresponding path program 1 times [2021-09-13 14:18:54,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:18:54,541 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540370576] [2021-09-13 14:18:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:54,541 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:18:54,548 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:18:54,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904134078] [2021-09-13 14:18:54,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:18:54,548 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:18:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:18:54,549 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:18:54,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-09-13 14:18:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:54,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2021-09-13 14:18:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:18:54,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:18:55,875 INFO L281 TraceCheckUtils]: 0: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {8233#true} is VALID [2021-09-13 14:18:55,876 INFO L281 TraceCheckUtils]: 1: Hoare triple {8233#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8241#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} is VALID [2021-09-13 14:18:55,876 INFO L281 TraceCheckUtils]: 2: Hoare triple {8241#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} assume !(0 == assume_abort_if_not_~cond); {8245#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:55,876 INFO L281 TraceCheckUtils]: 3: Hoare triple {8245#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8245#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:55,876 INFO L281 TraceCheckUtils]: 4: Hoare triple {8245#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {8245#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:18:55,877 INFO L281 TraceCheckUtils]: 5: Hoare triple {8245#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,877 INFO L281 TraceCheckUtils]: 6: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,878 INFO L281 TraceCheckUtils]: 7: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,878 INFO L281 TraceCheckUtils]: 8: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,879 INFO L281 TraceCheckUtils]: 9: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,879 INFO L281 TraceCheckUtils]: 10: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,880 INFO L281 TraceCheckUtils]: 11: Hoare triple {8255#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,881 INFO L281 TraceCheckUtils]: 12: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,881 INFO L281 TraceCheckUtils]: 13: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,882 INFO L281 TraceCheckUtils]: 14: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,882 INFO L281 TraceCheckUtils]: 15: Hoare triple {8274#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8287#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,883 INFO L281 TraceCheckUtils]: 16: Hoare triple {8287#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,883 INFO L281 TraceCheckUtils]: 17: Hoare triple {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,884 INFO L281 TraceCheckUtils]: 18: Hoare triple {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,884 INFO L281 TraceCheckUtils]: 19: Hoare triple {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,885 INFO L281 TraceCheckUtils]: 20: Hoare triple {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,886 INFO L281 TraceCheckUtils]: 21: Hoare triple {8291#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(main_~c~0 >= main_~b~0); {8307#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,886 INFO L281 TraceCheckUtils]: 22: Hoare triple {8307#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,887 INFO L281 TraceCheckUtils]: 23: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,887 INFO L281 TraceCheckUtils]: 24: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,887 INFO L281 TraceCheckUtils]: 25: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,888 INFO L281 TraceCheckUtils]: 26: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,888 INFO L281 TraceCheckUtils]: 27: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,889 INFO L281 TraceCheckUtils]: 28: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,889 INFO L281 TraceCheckUtils]: 29: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,889 INFO L281 TraceCheckUtils]: 30: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == __VERIFIER_assert_~cond); {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:18:55,890 INFO L281 TraceCheckUtils]: 31: Hoare triple {8311#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:55,890 INFO L281 TraceCheckUtils]: 32: Hoare triple {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {8234#false} is VALID [2021-09-13 14:18:55,890 INFO L281 TraceCheckUtils]: 33: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2021-09-13 14:18:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:55,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:18:56,748 INFO L281 TraceCheckUtils]: 33: Hoare triple {8234#false} assume !false; {8234#false} is VALID [2021-09-13 14:18:56,749 INFO L281 TraceCheckUtils]: 32: Hoare triple {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {8234#false} is VALID [2021-09-13 14:18:56,750 INFO L281 TraceCheckUtils]: 31: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8339#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:18:56,750 INFO L281 TraceCheckUtils]: 30: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:56,750 INFO L281 TraceCheckUtils]: 29: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:56,751 INFO L281 TraceCheckUtils]: 28: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:56,751 INFO L281 TraceCheckUtils]: 27: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:56,752 INFO L281 TraceCheckUtils]: 26: Hoare triple {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:56,752 INFO L281 TraceCheckUtils]: 25: Hoare triple {8371#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8352#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:18:56,753 INFO L281 TraceCheckUtils]: 24: Hoare triple {8371#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {8371#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:18:56,753 INFO L281 TraceCheckUtils]: 23: Hoare triple {8371#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8371#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:18:57,015 INFO L281 TraceCheckUtils]: 22: Hoare triple {8381#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~c~0 0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {8371#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:18:57,016 INFO L281 TraceCheckUtils]: 21: Hoare triple {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} assume !(main_~c~0 >= main_~b~0); {8381#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,016 INFO L281 TraceCheckUtils]: 20: Hoare triple {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,017 INFO L281 TraceCheckUtils]: 19: Hoare triple {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,017 INFO L281 TraceCheckUtils]: 18: Hoare triple {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,017 INFO L281 TraceCheckUtils]: 17: Hoare triple {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,018 INFO L281 TraceCheckUtils]: 16: Hoare triple {8401#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8385#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,018 INFO L281 TraceCheckUtils]: 15: Hoare triple {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8401#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,019 INFO L281 TraceCheckUtils]: 14: Hoare triple {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} assume !(0 == __VERIFIER_assert_~cond); {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,019 INFO L281 TraceCheckUtils]: 13: Hoare triple {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,019 INFO L281 TraceCheckUtils]: 12: Hoare triple {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 11: Hoare triple {8233#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {8405#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))) (= ULTIMATE.start_main_~c~0 0))} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 10: Hoare triple {8233#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 9: Hoare triple {8233#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 8: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 7: Hoare triple {8233#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 6: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 5: Hoare triple {8233#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 4: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 3: Hoare triple {8233#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:57,020 INFO L281 TraceCheckUtils]: 2: Hoare triple {8233#true} assume !(0 == assume_abort_if_not_~cond); {8233#true} is VALID [2021-09-13 14:18:57,021 INFO L281 TraceCheckUtils]: 1: Hoare triple {8233#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {8233#true} is VALID [2021-09-13 14:18:57,021 INFO L281 TraceCheckUtils]: 0: Hoare triple {8233#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {8233#true} is VALID [2021-09-13 14:18:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:18:57,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:18:57,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540370576] [2021-09-13 14:18:57,021 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:18:57,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904134078] [2021-09-13 14:18:57,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904134078] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:18:57,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:18:57,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2021-09-13 14:18:57,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222772402] [2021-09-13 14:18:57,022 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) Word has length 34 [2021-09-13 14:18:57,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:18:57,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) [2021-09-13 14:18:57,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:18:57,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-09-13 14:18:57,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:18:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-09-13 14:18:57,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:18:57,359 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) [2021-09-13 14:19:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:19:10,164 INFO L93 Difference]: Finished difference Result 361 states and 440 transitions. [2021-09-13 14:19:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-09-13 14:19:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) Word has length 34 [2021-09-13 14:19:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:19:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) [2021-09-13 14:19:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 179 transitions. [2021-09-13 14:19:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) [2021-09-13 14:19:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 179 transitions. [2021-09-13 14:19:10,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 179 transitions. [2021-09-13 14:19:10,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:19:10,453 INFO L225 Difference]: With dead ends: 361 [2021-09-13 14:19:10,453 INFO L226 Difference]: Without dead ends: 359 [2021-09-13 14:19:10,454 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 4789.24ms TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2021-09-13 14:19:10,455 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 495 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4259.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.17ms SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4265.11ms IncrementalHoareTripleChecker+Time [2021-09-13 14:19:10,455 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 7.17ms Time], IncrementalHoareTripleChecker [142 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 4265.11ms Time] [2021-09-13 14:19:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-09-13 14:19:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 300. [2021-09-13 14:19:11,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:19:11,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 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) [2021-09-13 14:19:11,234 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 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) [2021-09-13 14:19:11,235 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 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) [2021-09-13 14:19:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:19:11,242 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2021-09-13 14:19:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 434 transitions. [2021-09-13 14:19:11,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:19:11,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:19:11,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 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 359 states. [2021-09-13 14:19:11,244 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 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 359 states. [2021-09-13 14:19:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:19:11,252 INFO L93 Difference]: Finished difference Result 359 states and 434 transitions. [2021-09-13 14:19:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 434 transitions. [2021-09-13 14:19:11,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:19:11,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:19:11,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:19:11,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:19:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.2610169491525425) internal successors, (372), 299 states have internal predecessors, (372), 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) [2021-09-13 14:19:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 372 transitions. [2021-09-13 14:19:11,269 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 372 transitions. Word has length 34 [2021-09-13 14:19:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:19:11,269 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 372 transitions. [2021-09-13 14:19:11,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 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) [2021-09-13 14:19:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 372 transitions. [2021-09-13 14:19:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-09-13 14:19:11,270 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:19:11,270 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:19:11,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-09-13 14:19:11,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-09-13 14:19:11,489 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:19:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:19:11,489 INFO L82 PathProgramCache]: Analyzing trace with hash 142945620, now seen corresponding path program 1 times [2021-09-13 14:19:11,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:19:11,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671579731] [2021-09-13 14:19:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:19:11,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:19:11,495 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:19:11,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89414430] [2021-09-13 14:19:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:19:11,495 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:19:11,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:19:11,503 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:19:11,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-09-13 14:19:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:19:11,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 51 conjunts are in the unsatisfiable core [2021-09-13 14:19:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:19:11,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:19:13,439 INFO L281 TraceCheckUtils]: 0: Hoare triple {10156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {10156#true} is VALID [2021-09-13 14:19:13,439 INFO L281 TraceCheckUtils]: 1: Hoare triple {10156#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10164#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} is VALID [2021-09-13 14:19:13,440 INFO L281 TraceCheckUtils]: 2: Hoare triple {10164#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (<= 1 ULTIMATE.start_main_~x~0)) (and (< ULTIMATE.start_main_~x~0 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)))} assume !(0 == assume_abort_if_not_~cond); {10168#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:19:13,440 INFO L281 TraceCheckUtils]: 3: Hoare triple {10168#(<= 1 ULTIMATE.start_main_~x~0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10168#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:19:13,440 INFO L281 TraceCheckUtils]: 4: Hoare triple {10168#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {10168#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:19:13,441 INFO L281 TraceCheckUtils]: 5: Hoare triple {10168#(<= 1 ULTIMATE.start_main_~x~0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,443 INFO L281 TraceCheckUtils]: 6: Hoare triple {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,443 INFO L281 TraceCheckUtils]: 7: Hoare triple {10178#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10185#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (or (and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 2147483647 ULTIMATE.start_main_~yy~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,444 INFO L281 TraceCheckUtils]: 8: Hoare triple {10185#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (or (and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (and (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 2147483647 ULTIMATE.start_main_~yy~0))) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,444 INFO L281 TraceCheckUtils]: 9: Hoare triple {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,445 INFO L281 TraceCheckUtils]: 10: Hoare triple {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,445 INFO L281 TraceCheckUtils]: 11: Hoare triple {10189#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,446 INFO L281 TraceCheckUtils]: 12: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,446 INFO L281 TraceCheckUtils]: 13: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,447 INFO L281 TraceCheckUtils]: 14: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,447 INFO L281 TraceCheckUtils]: 15: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,448 INFO L281 TraceCheckUtils]: 16: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,449 INFO L281 TraceCheckUtils]: 17: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,449 INFO L281 TraceCheckUtils]: 18: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,450 INFO L281 TraceCheckUtils]: 19: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,450 INFO L281 TraceCheckUtils]: 20: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:19:13,451 INFO L281 TraceCheckUtils]: 21: Hoare triple {10199#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {10230#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,451 INFO L281 TraceCheckUtils]: 22: Hoare triple {10230#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~k~0 0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~p~0 1) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,452 INFO L281 TraceCheckUtils]: 23: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,452 INFO L281 TraceCheckUtils]: 24: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,453 INFO L281 TraceCheckUtils]: 25: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,453 INFO L281 TraceCheckUtils]: 26: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,454 INFO L281 TraceCheckUtils]: 27: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,454 INFO L281 TraceCheckUtils]: 28: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !(0 == __VERIFIER_assert_~cond); {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,454 INFO L281 TraceCheckUtils]: 29: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,455 INFO L281 TraceCheckUtils]: 30: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !(0 == __VERIFIER_assert_~cond); {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,455 INFO L281 TraceCheckUtils]: 31: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10262#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,456 INFO L281 TraceCheckUtils]: 32: Hoare triple {10262#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} assume !(0 == __VERIFIER_assert_~cond); {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} is VALID [2021-09-13 14:19:13,456 INFO L281 TraceCheckUtils]: 33: Hoare triple {10234#(and (< ULTIMATE.start_main_~yy~0 2147483647) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= (* ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~xy~0) (= ULTIMATE.start_main_~s~0 0) (< ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~q~0 1) (<= 1 ULTIMATE.start_main_~x~0) (<= (* ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~yy~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:19:13,457 INFO L281 TraceCheckUtils]: 34: Hoare triple {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {10157#false} is VALID [2021-09-13 14:19:13,457 INFO L281 TraceCheckUtils]: 35: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2021-09-13 14:19:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:19:13,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:19:15,239 INFO L281 TraceCheckUtils]: 35: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2021-09-13 14:19:15,240 INFO L281 TraceCheckUtils]: 34: Hoare triple {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {10157#false} is VALID [2021-09-13 14:19:15,240 INFO L281 TraceCheckUtils]: 33: Hoare triple {10282#(= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10269#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:19:15,241 INFO L281 TraceCheckUtils]: 32: Hoare triple {10286#(or (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {10282#(= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:19:15,241 INFO L281 TraceCheckUtils]: 31: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10286#(or (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:19:15,242 INFO L281 TraceCheckUtils]: 30: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} assume !(0 == __VERIFIER_assert_~cond); {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:19:15,242 INFO L281 TraceCheckUtils]: 29: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:19:15,243 INFO L281 TraceCheckUtils]: 28: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} assume !(0 == __VERIFIER_assert_~cond); {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:19:15,243 INFO L281 TraceCheckUtils]: 27: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:19:15,244 INFO L281 TraceCheckUtils]: 26: Hoare triple {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:19:15,244 INFO L281 TraceCheckUtils]: 25: Hoare triple {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~b~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10290#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))))} is VALID [2021-09-13 14:19:15,245 INFO L281 TraceCheckUtils]: 24: Hoare triple {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~b~0 0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:19:15,245 INFO L281 TraceCheckUtils]: 23: Hoare triple {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~b~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~b~0 0))} is VALID [2021-09-13 14:19:17,247 INFO L281 TraceCheckUtils]: 22: Hoare triple {10319#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {10309#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (= (+ ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~xy~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_main_~b~0 0))} is UNKNOWN [2021-09-13 14:19:17,248 INFO L281 TraceCheckUtils]: 21: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(main_~c~0 >= main_~b~0); {10319#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,249 INFO L281 TraceCheckUtils]: 20: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,249 INFO L281 TraceCheckUtils]: 19: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,249 INFO L281 TraceCheckUtils]: 18: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,249 INFO L281 TraceCheckUtils]: 17: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,250 INFO L281 TraceCheckUtils]: 16: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,250 INFO L281 TraceCheckUtils]: 15: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,250 INFO L281 TraceCheckUtils]: 14: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,251 INFO L281 TraceCheckUtils]: 13: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,251 INFO L281 TraceCheckUtils]: 12: Hoare triple {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,252 INFO L281 TraceCheckUtils]: 11: Hoare triple {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {10323#(or (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0)) (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,252 INFO L281 TraceCheckUtils]: 10: Hoare triple {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,253 INFO L281 TraceCheckUtils]: 9: Hoare triple {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,253 INFO L281 TraceCheckUtils]: 8: Hoare triple {10364#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == assume_abort_if_not_~cond); {10354#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,254 INFO L281 TraceCheckUtils]: 7: Hoare triple {10368#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10364#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond 0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,254 INFO L281 TraceCheckUtils]: 6: Hoare triple {10368#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == assume_abort_if_not_~cond); {10368#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,255 INFO L281 TraceCheckUtils]: 5: Hoare triple {10156#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10368#(or (<= ULTIMATE.start_main_~b~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0))) (<= 2147483647 ULTIMATE.start_main_~yy~0) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) 0) (= (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (+ (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~xy~0) (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~yy~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:19:17,255 INFO L281 TraceCheckUtils]: 4: Hoare triple {10156#true} assume !(0 == assume_abort_if_not_~cond); {10156#true} is VALID [2021-09-13 14:19:17,255 INFO L281 TraceCheckUtils]: 3: Hoare triple {10156#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10156#true} is VALID [2021-09-13 14:19:17,255 INFO L281 TraceCheckUtils]: 2: Hoare triple {10156#true} assume !(0 == assume_abort_if_not_~cond); {10156#true} is VALID [2021-09-13 14:19:17,255 INFO L281 TraceCheckUtils]: 1: Hoare triple {10156#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {10156#true} is VALID [2021-09-13 14:19:17,255 INFO L281 TraceCheckUtils]: 0: Hoare triple {10156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {10156#true} is VALID [2021-09-13 14:19:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:19:17,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:19:17,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671579731] [2021-09-13 14:19:17,256 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:19:17,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89414430] [2021-09-13 14:19:17,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89414430] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:19:17,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:19:17,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-09-13 14:19:17,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136233560] [2021-09-13 14:19:17,256 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) Word has length 36 [2021-09-13 14:19:17,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:19:17,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2021-09-13 14:19:19,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 68 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:19:19,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-09-13 14:19:19,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:19:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-09-13 14:19:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-09-13 14:19:19,332 INFO L87 Difference]: Start difference. First operand 300 states and 372 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2021-09-13 14:20:22,717 WARN L210 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2021-09-13 14:20:35,717 WARN L210 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2021-09-13 14:20:46,967 WARN L210 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2021-09-13 14:21:04,601 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:21:32,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-09-13 14:21:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:43,404 INFO L93 Difference]: Finished difference Result 537 states and 669 transitions. [2021-09-13 14:21:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-09-13 14:21:43,404 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) Word has length 36 [2021-09-13 14:21:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:21:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2021-09-13 14:21:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 246 transitions. [2021-09-13 14:21:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2021-09-13 14:21:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 246 transitions. [2021-09-13 14:21:43,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 246 transitions. [2021-09-13 14:21:48,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 244 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2021-09-13 14:21:48,151 INFO L225 Difference]: With dead ends: 537 [2021-09-13 14:21:48,152 INFO L226 Difference]: Without dead ends: 535 [2021-09-13 14:21:48,153 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 97982.89ms TimeCoverageRelationStatistics Valid=1065, Invalid=2967, Unknown=0, NotChecked=0, Total=4032 [2021-09-13 14:21:48,153 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 847 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 261 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20867.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.88ms SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20883.39ms IncrementalHoareTripleChecker+Time [2021-09-13 14:21:48,154 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [847 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 10.88ms Time], IncrementalHoareTripleChecker [261 Valid, 752 Invalid, 2 Unknown, 0 Unchecked, 20883.39ms Time] [2021-09-13 14:21:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-09-13 14:21:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 365. [2021-09-13 14:21:49,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:21:49,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 535 states. Second operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 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) [2021-09-13 14:21:49,540 INFO L74 IsIncluded]: Start isIncluded. First operand 535 states. Second operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 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) [2021-09-13 14:21:49,540 INFO L87 Difference]: Start difference. First operand 535 states. Second operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 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) [2021-09-13 14:21:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:49,554 INFO L93 Difference]: Finished difference Result 535 states and 656 transitions. [2021-09-13 14:21:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 656 transitions. [2021-09-13 14:21:49,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:49,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:49,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 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 535 states. [2021-09-13 14:21:49,556 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 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 535 states. [2021-09-13 14:21:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:21:49,571 INFO L93 Difference]: Finished difference Result 535 states and 656 transitions. [2021-09-13 14:21:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 656 transitions. [2021-09-13 14:21:49,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:21:49,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:21:49,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:21:49,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:21:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.2555555555555555) internal successors, (452), 364 states have internal predecessors, (452), 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) [2021-09-13 14:21:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 452 transitions. [2021-09-13 14:21:49,588 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 452 transitions. Word has length 36 [2021-09-13 14:21:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:21:49,588 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 452 transitions. [2021-09-13 14:21:49,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 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) [2021-09-13 14:21:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 452 transitions. [2021-09-13 14:21:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:21:49,589 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:21:49,589 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:21:49,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-09-13 14:21:49,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:49,803 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:21:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:21:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -947205511, now seen corresponding path program 1 times [2021-09-13 14:21:49,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:21:49,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314715221] [2021-09-13 14:21:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:49,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:21:49,817 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:21:49,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1044936577] [2021-09-13 14:21:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:21:49,817 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:21:49,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:21:49,819 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:21:49,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-09-13 14:21:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:49,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 47 conjunts are in the unsatisfiable core [2021-09-13 14:21:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:21:49,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:21:51,129 INFO L281 TraceCheckUtils]: 0: Hoare triple {12794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {12794#true} is VALID [2021-09-13 14:21:51,130 INFO L281 TraceCheckUtils]: 1: Hoare triple {12794#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:51,130 INFO L281 TraceCheckUtils]: 2: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:51,130 INFO L281 TraceCheckUtils]: 3: Hoare triple {12794#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:51,130 INFO L281 TraceCheckUtils]: 4: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:51,130 INFO L281 TraceCheckUtils]: 5: Hoare triple {12794#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,131 INFO L281 TraceCheckUtils]: 6: Hoare triple {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,131 INFO L281 TraceCheckUtils]: 7: Hoare triple {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,132 INFO L281 TraceCheckUtils]: 8: Hoare triple {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,132 INFO L281 TraceCheckUtils]: 9: Hoare triple {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,132 INFO L281 TraceCheckUtils]: 10: Hoare triple {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,133 INFO L281 TraceCheckUtils]: 11: Hoare triple {12814#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,133 INFO L281 TraceCheckUtils]: 12: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,134 INFO L281 TraceCheckUtils]: 13: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,134 INFO L281 TraceCheckUtils]: 14: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,135 INFO L281 TraceCheckUtils]: 15: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,135 INFO L281 TraceCheckUtils]: 16: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,135 INFO L281 TraceCheckUtils]: 17: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,136 INFO L281 TraceCheckUtils]: 18: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,136 INFO L281 TraceCheckUtils]: 19: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,137 INFO L281 TraceCheckUtils]: 20: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,137 INFO L281 TraceCheckUtils]: 21: Hoare triple {12833#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,138 INFO L281 TraceCheckUtils]: 22: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,138 INFO L281 TraceCheckUtils]: 23: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,139 INFO L281 TraceCheckUtils]: 24: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,140 INFO L281 TraceCheckUtils]: 25: Hoare triple {12864#(and (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12877#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,141 INFO L281 TraceCheckUtils]: 26: Hoare triple {12877#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {12881#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:21:51,142 INFO L281 TraceCheckUtils]: 27: Hoare triple {12881#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12885#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:51,143 INFO L281 TraceCheckUtils]: 28: Hoare triple {12885#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(0 == __VERIFIER_assert_~cond); {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:51,143 INFO L281 TraceCheckUtils]: 29: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:51,143 INFO L281 TraceCheckUtils]: 30: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(0 == __VERIFIER_assert_~cond); {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:51,144 INFO L281 TraceCheckUtils]: 31: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} assume !(main_~c~0 >= main_~b~0); {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} is VALID [2021-09-13 14:21:51,145 INFO L281 TraceCheckUtils]: 32: Hoare triple {12889#(and (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~y~0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~k~0 1))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:21:51,145 INFO L281 TraceCheckUtils]: 33: Hoare triple {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:21:51,145 INFO L281 TraceCheckUtils]: 34: Hoare triple {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:21:51,150 INFO L281 TraceCheckUtils]: 35: Hoare triple {12902#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} assume !(0 != main_~b~0); {12912#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:21:51,150 INFO L281 TraceCheckUtils]: 36: Hoare triple {12912#(and (= (+ ULTIMATE.start_main_~s~0 1) 0) (= ULTIMATE.start_main_~q~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:21:51,151 INFO L281 TraceCheckUtils]: 37: Hoare triple {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {12795#false} is VALID [2021-09-13 14:21:51,151 INFO L281 TraceCheckUtils]: 38: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2021-09-13 14:21:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:21:51,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:21:52,269 INFO L281 TraceCheckUtils]: 38: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2021-09-13 14:21:52,269 INFO L281 TraceCheckUtils]: 37: Hoare triple {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {12795#false} is VALID [2021-09-13 14:21:52,270 INFO L281 TraceCheckUtils]: 36: Hoare triple {12929#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12916#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:21:52,270 INFO L281 TraceCheckUtils]: 35: Hoare triple {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 != main_~b~0); {12929#(= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0)} is VALID [2021-09-13 14:21:52,271 INFO L281 TraceCheckUtils]: 34: Hoare triple {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:21:52,271 INFO L281 TraceCheckUtils]: 33: Hoare triple {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:21:53,236 INFO L281 TraceCheckUtils]: 32: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {12933#(or (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) 0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:21:53,236 INFO L281 TraceCheckUtils]: 31: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(main_~c~0 >= main_~b~0); {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,237 INFO L281 TraceCheckUtils]: 30: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,237 INFO L281 TraceCheckUtils]: 29: Hoare triple {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,238 INFO L281 TraceCheckUtils]: 28: Hoare triple {12956#(or (not (= ULTIMATE.start_main_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {12943#(or (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,238 INFO L281 TraceCheckUtils]: 27: Hoare triple {12960#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12956#(or (not (= ULTIMATE.start_main_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,239 INFO L281 TraceCheckUtils]: 26: Hoare triple {12964#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} assume !(0 == __VERIFIER_assert_~cond); {12960#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,239 INFO L281 TraceCheckUtils]: 25: Hoare triple {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12964#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))))} is VALID [2021-09-13 14:21:53,240 INFO L281 TraceCheckUtils]: 24: Hoare triple {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:53,241 INFO L281 TraceCheckUtils]: 23: Hoare triple {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:53,241 INFO L281 TraceCheckUtils]: 22: Hoare triple {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,100 INFO L281 TraceCheckUtils]: 21: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {12968#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,100 INFO L281 TraceCheckUtils]: 20: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,101 INFO L281 TraceCheckUtils]: 19: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,101 INFO L281 TraceCheckUtils]: 18: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,101 INFO L281 TraceCheckUtils]: 17: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,101 INFO L281 TraceCheckUtils]: 16: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,102 INFO L281 TraceCheckUtils]: 15: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,102 INFO L281 TraceCheckUtils]: 14: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !(0 == __VERIFIER_assert_~cond); {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,102 INFO L281 TraceCheckUtils]: 13: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,103 INFO L281 TraceCheckUtils]: 12: Hoare triple {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 11: Hoare triple {12794#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {12981#(or (not (= (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)) ULTIMATE.start_main_~b~0)) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~k~0) (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~k~0))) (not (= ULTIMATE.start_main_~a~0 (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)))))} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 10: Hoare triple {12794#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 9: Hoare triple {12794#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 8: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 7: Hoare triple {12794#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 6: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 5: Hoare triple {12794#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 4: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 3: Hoare triple {12794#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 2: Hoare triple {12794#true} assume !(0 == assume_abort_if_not_~cond); {12794#true} is VALID [2021-09-13 14:21:54,104 INFO L281 TraceCheckUtils]: 1: Hoare triple {12794#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {12794#true} is VALID [2021-09-13 14:21:54,105 INFO L281 TraceCheckUtils]: 0: Hoare triple {12794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {12794#true} is VALID [2021-09-13 14:21:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:21:54,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:21:54,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314715221] [2021-09-13 14:21:54,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:21:54,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044936577] [2021-09-13 14:21:54,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044936577] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:21:54,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:21:54,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-09-13 14:21:54,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932116138] [2021-09-13 14:21:54,106 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) Word has length 39 [2021-09-13 14:21:54,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:21:54,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) [2021-09-13 14:21:54,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:21:54,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 14:21:54,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:21:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 14:21:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:21:54,988 INFO L87 Difference]: Start difference. First operand 365 states and 452 transitions. Second operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) [2021-09-13 14:22:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:01,740 INFO L93 Difference]: Finished difference Result 454 states and 554 transitions. [2021-09-13 14:22:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-09-13 14:22:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) Word has length 39 [2021-09-13 14:22:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) [2021-09-13 14:22:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 181 transitions. [2021-09-13 14:22:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) [2021-09-13 14:22:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 181 transitions. [2021-09-13 14:22:01,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 181 transitions. [2021-09-13 14:22:04,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:04,275 INFO L225 Difference]: With dead ends: 454 [2021-09-13 14:22:04,275 INFO L226 Difference]: Without dead ends: 448 [2021-09-13 14:22:04,276 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2046.95ms TimeCoverageRelationStatistics Valid=657, Invalid=2205, Unknown=0, NotChecked=0, Total=2862 [2021-09-13 14:22:04,276 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1664.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.63ms SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1669.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:04,276 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 2.63ms Time], IncrementalHoareTripleChecker [105 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1669.32ms Time] [2021-09-13 14:22:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-09-13 14:22:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 413. [2021-09-13 14:22:06,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:06,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 448 states. Second operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 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) [2021-09-13 14:22:06,117 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 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) [2021-09-13 14:22:06,118 INFO L87 Difference]: Start difference. First operand 448 states. Second operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 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) [2021-09-13 14:22:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:06,129 INFO L93 Difference]: Finished difference Result 448 states and 542 transitions. [2021-09-13 14:22:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 542 transitions. [2021-09-13 14:22:06,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:06,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:06,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 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 448 states. [2021-09-13 14:22:06,132 INFO L87 Difference]: Start difference. First operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 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 448 states. [2021-09-13 14:22:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:06,144 INFO L93 Difference]: Finished difference Result 448 states and 542 transitions. [2021-09-13 14:22:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 542 transitions. [2021-09-13 14:22:06,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:06,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:06,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:06,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 408 states have (on average 1.2426470588235294) internal successors, (507), 412 states have internal predecessors, (507), 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) [2021-09-13 14:22:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 507 transitions. [2021-09-13 14:22:06,158 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 507 transitions. Word has length 39 [2021-09-13 14:22:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:06,158 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 507 transitions. [2021-09-13 14:22:06,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.55) internal successors, (71), 20 states have internal predecessors, (71), 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) [2021-09-13 14:22:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 507 transitions. [2021-09-13 14:22:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-09-13 14:22:06,160 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:06,160 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:06,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-09-13 14:22:06,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-09-13 14:22:06,380 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash -365269558, now seen corresponding path program 2 times [2021-09-13 14:22:06,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:22:06,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394628651] [2021-09-13 14:22:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:06,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:22:06,386 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:22:06,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642369961] [2021-09-13 14:22:06,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:22:06,387 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:22:06,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:06,387 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:22:06,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-09-13 14:22:06,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:22:06,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:22:06,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:22:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:06,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:06,685 INFO L281 TraceCheckUtils]: 0: Hoare triple {15226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {15226#true} is VALID [2021-09-13 14:22:06,685 INFO L281 TraceCheckUtils]: 1: Hoare triple {15226#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,685 INFO L281 TraceCheckUtils]: 2: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:22:06,685 INFO L281 TraceCheckUtils]: 3: Hoare triple {15226#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,685 INFO L281 TraceCheckUtils]: 4: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 5: Hoare triple {15226#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 6: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 7: Hoare triple {15226#true} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 8: Hoare triple {15226#true} assume !(0 == assume_abort_if_not_~cond); {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 9: Hoare triple {15226#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 10: Hoare triple {15226#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 11: Hoare triple {15226#true} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 12: Hoare triple {15226#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {15226#true} is VALID [2021-09-13 14:22:06,686 INFO L281 TraceCheckUtils]: 13: Hoare triple {15226#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 14: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 15: Hoare triple {15226#true} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 16: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 17: Hoare triple {15226#true} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 18: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 19: Hoare triple {15226#true} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15226#true} is VALID [2021-09-13 14:22:06,687 INFO L281 TraceCheckUtils]: 20: Hoare triple {15226#true} assume !(0 == __VERIFIER_assert_~cond); {15226#true} is VALID [2021-09-13 14:22:06,688 INFO L281 TraceCheckUtils]: 21: Hoare triple {15226#true} assume !(main_~c~0 >= main_~b~0); {15294#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:22:06,688 INFO L281 TraceCheckUtils]: 22: Hoare triple {15294#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:22:06,689 INFO L281 TraceCheckUtils]: 23: Hoare triple {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:22:06,689 INFO L281 TraceCheckUtils]: 24: Hoare triple {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:22:06,689 INFO L281 TraceCheckUtils]: 25: Hoare triple {15298#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,690 INFO L281 TraceCheckUtils]: 26: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,690 INFO L281 TraceCheckUtils]: 27: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,691 INFO L281 TraceCheckUtils]: 28: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,691 INFO L281 TraceCheckUtils]: 29: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,692 INFO L281 TraceCheckUtils]: 30: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,692 INFO L281 TraceCheckUtils]: 31: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,692 INFO L281 TraceCheckUtils]: 32: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,693 INFO L281 TraceCheckUtils]: 33: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,693 INFO L281 TraceCheckUtils]: 34: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:22:06,694 INFO L281 TraceCheckUtils]: 35: Hoare triple {15308#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {15227#false} is VALID [2021-09-13 14:22:06,694 INFO L281 TraceCheckUtils]: 36: Hoare triple {15227#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {15227#false} is VALID [2021-09-13 14:22:06,695 INFO L281 TraceCheckUtils]: 37: Hoare triple {15227#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15227#false} is VALID [2021-09-13 14:22:06,695 INFO L281 TraceCheckUtils]: 38: Hoare triple {15227#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {15227#false} is VALID [2021-09-13 14:22:06,695 INFO L281 TraceCheckUtils]: 39: Hoare triple {15227#false} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {15227#false} is VALID [2021-09-13 14:22:06,695 INFO L281 TraceCheckUtils]: 40: Hoare triple {15227#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {15227#false} is VALID [2021-09-13 14:22:06,695 INFO L281 TraceCheckUtils]: 41: Hoare triple {15227#false} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:22:06,695 INFO L281 TraceCheckUtils]: 42: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 43: Hoare triple {15227#false} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 44: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 45: Hoare triple {15227#false} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 46: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 47: Hoare triple {15227#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 48: Hoare triple {15227#false} assume !(0 == __VERIFIER_assert_~cond); {15227#false} is VALID [2021-09-13 14:22:06,696 INFO L281 TraceCheckUtils]: 49: Hoare triple {15227#false} assume !(main_~c~0 >= main_~b~0); {15227#false} is VALID [2021-09-13 14:22:06,697 INFO L281 TraceCheckUtils]: 50: Hoare triple {15227#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {15227#false} is VALID [2021-09-13 14:22:06,697 INFO L281 TraceCheckUtils]: 51: Hoare triple {15227#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {15227#false} is VALID [2021-09-13 14:22:06,697 INFO L281 TraceCheckUtils]: 52: Hoare triple {15227#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {15227#false} is VALID [2021-09-13 14:22:06,697 INFO L281 TraceCheckUtils]: 53: Hoare triple {15227#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15227#false} is VALID [2021-09-13 14:22:06,697 INFO L281 TraceCheckUtils]: 54: Hoare triple {15227#false} assume 0 == __VERIFIER_assert_~cond; {15227#false} is VALID [2021-09-13 14:22:06,697 INFO L281 TraceCheckUtils]: 55: Hoare triple {15227#false} assume !false; {15227#false} is VALID [2021-09-13 14:22:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:22:06,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:22:06,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:22:06,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394628651] [2021-09-13 14:22:06,698 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:22:06,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642369961] [2021-09-13 14:22:06,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642369961] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:06,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:06,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:22:06,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522068838] [2021-09-13 14:22:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 56 [2021-09-13 14:22:06,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:06,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2021-09-13 14:22:06,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:06,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:22:06,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:22:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:22:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:22:06,750 INFO L87 Difference]: Start difference. First operand 413 states and 507 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2021-09-13 14:22:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:09,179 INFO L93 Difference]: Finished difference Result 762 states and 950 transitions. [2021-09-13 14:22:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:22:09,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) Word has length 56 [2021-09-13 14:22:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2021-09-13 14:22:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2021-09-13 14:22:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2021-09-13 14:22:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2021-09-13 14:22:09,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2021-09-13 14:22:09,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:09,270 INFO L225 Difference]: With dead ends: 762 [2021-09-13 14:22:09,270 INFO L226 Difference]: Without dead ends: 475 [2021-09-13 14:22:09,271 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.32ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:22:09,272 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 148.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 148.82ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:09,272 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 148.82ms Time] [2021-09-13 14:22:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2021-09-13 14:22:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 424. [2021-09-13 14:22:11,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:11,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 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) [2021-09-13 14:22:11,284 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 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) [2021-09-13 14:22:11,285 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 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) [2021-09-13 14:22:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:11,293 INFO L93 Difference]: Finished difference Result 475 states and 577 transitions. [2021-09-13 14:22:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 577 transitions. [2021-09-13 14:22:11,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:11,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:11,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 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 475 states. [2021-09-13 14:22:11,295 INFO L87 Difference]: Start difference. First operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 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 475 states. [2021-09-13 14:22:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:11,306 INFO L93 Difference]: Finished difference Result 475 states and 577 transitions. [2021-09-13 14:22:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 577 transitions. [2021-09-13 14:22:11,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:11,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:11,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:11,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 419 states have (on average 1.2482100238663485) internal successors, (523), 423 states have internal predecessors, (523), 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) [2021-09-13 14:22:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 523 transitions. [2021-09-13 14:22:11,318 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 523 transitions. Word has length 56 [2021-09-13 14:22:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:11,318 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 523 transitions. [2021-09-13 14:22:11,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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) [2021-09-13 14:22:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 523 transitions. [2021-09-13 14:22:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-09-13 14:22:11,319 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:11,320 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:11,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-09-13 14:22:11,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-09-13 14:22:11,541 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:11,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash -859252433, now seen corresponding path program 1 times [2021-09-13 14:22:11,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:22:11,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268754844] [2021-09-13 14:22:11,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:11,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:22:11,548 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:22:11,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694011857] [2021-09-13 14:22:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:11,548 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:22:11,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:11,549 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:22:11,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-09-13 14:22:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:22:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:11,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:11,989 INFO L281 TraceCheckUtils]: 0: Hoare triple {18025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,990 INFO L281 TraceCheckUtils]: 1: Hoare triple {18030#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,990 INFO L281 TraceCheckUtils]: 2: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,991 INFO L281 TraceCheckUtils]: 3: Hoare triple {18030#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,991 INFO L281 TraceCheckUtils]: 4: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,991 INFO L281 TraceCheckUtils]: 5: Hoare triple {18030#(<= ~counter~0 0)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,991 INFO L281 TraceCheckUtils]: 6: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,992 INFO L281 TraceCheckUtils]: 7: Hoare triple {18030#(<= ~counter~0 0)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,992 INFO L281 TraceCheckUtils]: 8: Hoare triple {18030#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {18030#(<= ~counter~0 0)} is VALID [2021-09-13 14:22:11,993 INFO L281 TraceCheckUtils]: 9: Hoare triple {18030#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18058#(<= ~counter~0 1)} is VALID [2021-09-13 14:22:11,993 INFO L281 TraceCheckUtils]: 10: Hoare triple {18058#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18058#(<= ~counter~0 1)} is VALID [2021-09-13 14:22:11,993 INFO L281 TraceCheckUtils]: 11: Hoare triple {18058#(<= ~counter~0 1)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18058#(<= ~counter~0 1)} is VALID [2021-09-13 14:22:11,994 INFO L281 TraceCheckUtils]: 12: Hoare triple {18058#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,994 INFO L281 TraceCheckUtils]: 13: Hoare triple {18068#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,994 INFO L281 TraceCheckUtils]: 14: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,995 INFO L281 TraceCheckUtils]: 15: Hoare triple {18068#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,995 INFO L281 TraceCheckUtils]: 16: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,995 INFO L281 TraceCheckUtils]: 17: Hoare triple {18068#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,996 INFO L281 TraceCheckUtils]: 18: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,996 INFO L281 TraceCheckUtils]: 19: Hoare triple {18068#(<= ~counter~0 2)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,996 INFO L281 TraceCheckUtils]: 20: Hoare triple {18068#(<= ~counter~0 2)} assume !(0 == __VERIFIER_assert_~cond); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,996 INFO L281 TraceCheckUtils]: 21: Hoare triple {18068#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,997 INFO L281 TraceCheckUtils]: 22: Hoare triple {18068#(<= ~counter~0 2)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18068#(<= ~counter~0 2)} is VALID [2021-09-13 14:22:11,997 INFO L281 TraceCheckUtils]: 23: Hoare triple {18068#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18102#(<= ~counter~0 3)} is VALID [2021-09-13 14:22:11,998 INFO L281 TraceCheckUtils]: 24: Hoare triple {18102#(<= ~counter~0 3)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18102#(<= ~counter~0 3)} is VALID [2021-09-13 14:22:11,998 INFO L281 TraceCheckUtils]: 25: Hoare triple {18102#(<= ~counter~0 3)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18102#(<= ~counter~0 3)} is VALID [2021-09-13 14:22:11,998 INFO L281 TraceCheckUtils]: 26: Hoare triple {18102#(<= ~counter~0 3)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:11,999 INFO L281 TraceCheckUtils]: 27: Hoare triple {18112#(<= ~counter~0 4)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:11,999 INFO L281 TraceCheckUtils]: 28: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:11,999 INFO L281 TraceCheckUtils]: 29: Hoare triple {18112#(<= ~counter~0 4)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:11,999 INFO L281 TraceCheckUtils]: 30: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:12,000 INFO L281 TraceCheckUtils]: 31: Hoare triple {18112#(<= ~counter~0 4)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:12,000 INFO L281 TraceCheckUtils]: 32: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:12,000 INFO L281 TraceCheckUtils]: 33: Hoare triple {18112#(<= ~counter~0 4)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:12,001 INFO L281 TraceCheckUtils]: 34: Hoare triple {18112#(<= ~counter~0 4)} assume !(0 == __VERIFIER_assert_~cond); {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:12,001 INFO L281 TraceCheckUtils]: 35: Hoare triple {18112#(<= ~counter~0 4)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {18112#(<= ~counter~0 4)} is VALID [2021-09-13 14:22:12,001 INFO L281 TraceCheckUtils]: 36: Hoare triple {18112#(<= ~counter~0 4)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,002 INFO L281 TraceCheckUtils]: 37: Hoare triple {18143#(<= ~counter~0 5)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,002 INFO L281 TraceCheckUtils]: 38: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,002 INFO L281 TraceCheckUtils]: 39: Hoare triple {18143#(<= ~counter~0 5)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,003 INFO L281 TraceCheckUtils]: 40: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,003 INFO L281 TraceCheckUtils]: 41: Hoare triple {18143#(<= ~counter~0 5)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,003 INFO L281 TraceCheckUtils]: 42: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,003 INFO L281 TraceCheckUtils]: 43: Hoare triple {18143#(<= ~counter~0 5)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,004 INFO L281 TraceCheckUtils]: 44: Hoare triple {18143#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,004 INFO L281 TraceCheckUtils]: 45: Hoare triple {18143#(<= ~counter~0 5)} assume !(main_~c~0 >= main_~b~0); {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,004 INFO L281 TraceCheckUtils]: 46: Hoare triple {18143#(<= ~counter~0 5)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18143#(<= ~counter~0 5)} is VALID [2021-09-13 14:22:12,005 INFO L281 TraceCheckUtils]: 47: Hoare triple {18143#(<= ~counter~0 5)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18177#(<= ~counter~0 6)} is VALID [2021-09-13 14:22:12,005 INFO L281 TraceCheckUtils]: 48: Hoare triple {18177#(<= ~counter~0 6)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18177#(<= ~counter~0 6)} is VALID [2021-09-13 14:22:12,005 INFO L281 TraceCheckUtils]: 49: Hoare triple {18177#(<= ~counter~0 6)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18177#(<= ~counter~0 6)} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 50: Hoare triple {18177#(<= ~counter~0 6)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18187#(<= |ULTIMATE.start_main_#t~post10| 6)} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 51: Hoare triple {18187#(<= |ULTIMATE.start_main_#t~post10| 6)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {18026#false} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 52: Hoare triple {18026#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18026#false} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 53: Hoare triple {18026#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18026#false} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 54: Hoare triple {18026#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {18026#false} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 55: Hoare triple {18026#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18026#false} is VALID [2021-09-13 14:22:12,006 INFO L281 TraceCheckUtils]: 56: Hoare triple {18026#false} assume 0 == __VERIFIER_assert_~cond; {18026#false} is VALID [2021-09-13 14:22:12,007 INFO L281 TraceCheckUtils]: 57: Hoare triple {18026#false} assume !false; {18026#false} is VALID [2021-09-13 14:22:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:12,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 57: Hoare triple {18026#false} assume !false; {18026#false} is VALID [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 56: Hoare triple {18026#false} assume 0 == __VERIFIER_assert_~cond; {18026#false} is VALID [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 55: Hoare triple {18026#false} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~x~0 + main_~s~0 * main_~y~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18026#false} is VALID [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 54: Hoare triple {18026#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {18026#false} is VALID [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 53: Hoare triple {18026#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18026#false} is VALID [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 52: Hoare triple {18026#false} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18026#false} is VALID [2021-09-13 14:22:12,420 INFO L281 TraceCheckUtils]: 51: Hoare triple {18227#(< |ULTIMATE.start_main_#t~post10| 20)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {18026#false} is VALID [2021-09-13 14:22:12,421 INFO L281 TraceCheckUtils]: 50: Hoare triple {18231#(< ~counter~0 20)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18227#(< |ULTIMATE.start_main_#t~post10| 20)} is VALID [2021-09-13 14:22:12,421 INFO L281 TraceCheckUtils]: 49: Hoare triple {18231#(< ~counter~0 20)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18231#(< ~counter~0 20)} is VALID [2021-09-13 14:22:12,421 INFO L281 TraceCheckUtils]: 48: Hoare triple {18231#(< ~counter~0 20)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18231#(< ~counter~0 20)} is VALID [2021-09-13 14:22:12,422 INFO L281 TraceCheckUtils]: 47: Hoare triple {18241#(< ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18231#(< ~counter~0 20)} is VALID [2021-09-13 14:22:12,423 INFO L281 TraceCheckUtils]: 46: Hoare triple {18241#(< ~counter~0 19)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,423 INFO L281 TraceCheckUtils]: 45: Hoare triple {18241#(< ~counter~0 19)} assume !(main_~c~0 >= main_~b~0); {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,423 INFO L281 TraceCheckUtils]: 44: Hoare triple {18241#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,423 INFO L281 TraceCheckUtils]: 43: Hoare triple {18241#(< ~counter~0 19)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,424 INFO L281 TraceCheckUtils]: 42: Hoare triple {18241#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,424 INFO L281 TraceCheckUtils]: 41: Hoare triple {18241#(< ~counter~0 19)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,424 INFO L281 TraceCheckUtils]: 40: Hoare triple {18241#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,424 INFO L281 TraceCheckUtils]: 39: Hoare triple {18241#(< ~counter~0 19)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,425 INFO L281 TraceCheckUtils]: 38: Hoare triple {18241#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,425 INFO L281 TraceCheckUtils]: 37: Hoare triple {18241#(< ~counter~0 19)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,426 INFO L281 TraceCheckUtils]: 36: Hoare triple {18275#(< ~counter~0 18)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18241#(< ~counter~0 19)} is VALID [2021-09-13 14:22:12,426 INFO L281 TraceCheckUtils]: 35: Hoare triple {18275#(< ~counter~0 18)} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,426 INFO L281 TraceCheckUtils]: 34: Hoare triple {18275#(< ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,426 INFO L281 TraceCheckUtils]: 33: Hoare triple {18275#(< ~counter~0 18)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,427 INFO L281 TraceCheckUtils]: 32: Hoare triple {18275#(< ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,427 INFO L281 TraceCheckUtils]: 31: Hoare triple {18275#(< ~counter~0 18)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,449 INFO L281 TraceCheckUtils]: 30: Hoare triple {18275#(< ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,450 INFO L281 TraceCheckUtils]: 29: Hoare triple {18275#(< ~counter~0 18)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,450 INFO L281 TraceCheckUtils]: 28: Hoare triple {18275#(< ~counter~0 18)} assume !(0 == __VERIFIER_assert_~cond); {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,451 INFO L281 TraceCheckUtils]: 27: Hoare triple {18275#(< ~counter~0 18)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,452 INFO L281 TraceCheckUtils]: 26: Hoare triple {18306#(< ~counter~0 17)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18275#(< ~counter~0 18)} is VALID [2021-09-13 14:22:12,452 INFO L281 TraceCheckUtils]: 25: Hoare triple {18306#(< ~counter~0 17)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18306#(< ~counter~0 17)} is VALID [2021-09-13 14:22:12,452 INFO L281 TraceCheckUtils]: 24: Hoare triple {18306#(< ~counter~0 17)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18306#(< ~counter~0 17)} is VALID [2021-09-13 14:22:12,453 INFO L281 TraceCheckUtils]: 23: Hoare triple {18316#(< ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18306#(< ~counter~0 17)} is VALID [2021-09-13 14:22:12,454 INFO L281 TraceCheckUtils]: 22: Hoare triple {18316#(< ~counter~0 16)} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,454 INFO L281 TraceCheckUtils]: 21: Hoare triple {18316#(< ~counter~0 16)} assume !(main_~c~0 >= main_~b~0); {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,454 INFO L281 TraceCheckUtils]: 20: Hoare triple {18316#(< ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,455 INFO L281 TraceCheckUtils]: 19: Hoare triple {18316#(< ~counter~0 16)} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,455 INFO L281 TraceCheckUtils]: 18: Hoare triple {18316#(< ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,456 INFO L281 TraceCheckUtils]: 17: Hoare triple {18316#(< ~counter~0 16)} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,456 INFO L281 TraceCheckUtils]: 16: Hoare triple {18316#(< ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,457 INFO L281 TraceCheckUtils]: 15: Hoare triple {18316#(< ~counter~0 16)} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,457 INFO L281 TraceCheckUtils]: 14: Hoare triple {18316#(< ~counter~0 16)} assume !(0 == __VERIFIER_assert_~cond); {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,457 INFO L281 TraceCheckUtils]: 13: Hoare triple {18316#(< ~counter~0 16)} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,458 INFO L281 TraceCheckUtils]: 12: Hoare triple {18350#(< ~counter~0 15)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18316#(< ~counter~0 16)} is VALID [2021-09-13 14:22:12,459 INFO L281 TraceCheckUtils]: 11: Hoare triple {18350#(< ~counter~0 15)} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {18350#(< ~counter~0 15)} is VALID [2021-09-13 14:22:12,459 INFO L281 TraceCheckUtils]: 10: Hoare triple {18350#(< ~counter~0 15)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18350#(< ~counter~0 15)} is VALID [2021-09-13 14:22:12,460 INFO L281 TraceCheckUtils]: 9: Hoare triple {18360#(< ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18350#(< ~counter~0 15)} is VALID [2021-09-13 14:22:12,460 INFO L281 TraceCheckUtils]: 8: Hoare triple {18360#(< ~counter~0 14)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,460 INFO L281 TraceCheckUtils]: 7: Hoare triple {18360#(< ~counter~0 14)} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,460 INFO L281 TraceCheckUtils]: 6: Hoare triple {18360#(< ~counter~0 14)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,461 INFO L281 TraceCheckUtils]: 5: Hoare triple {18360#(< ~counter~0 14)} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,461 INFO L281 TraceCheckUtils]: 4: Hoare triple {18360#(< ~counter~0 14)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,461 INFO L281 TraceCheckUtils]: 3: Hoare triple {18360#(< ~counter~0 14)} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,462 INFO L281 TraceCheckUtils]: 2: Hoare triple {18360#(< ~counter~0 14)} assume !(0 == assume_abort_if_not_~cond); {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,465 INFO L281 TraceCheckUtils]: 1: Hoare triple {18360#(< ~counter~0 14)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,465 INFO L281 TraceCheckUtils]: 0: Hoare triple {18025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {18360#(< ~counter~0 14)} is VALID [2021-09-13 14:22:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:12,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:22:12,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268754844] [2021-09-13 14:22:12,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:22:12,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694011857] [2021-09-13 14:22:12,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694011857] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:22:12,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:22:12,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-09-13 14:22:12,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595135620] [2021-09-13 14:22:12,467 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) Word has length 58 [2021-09-13 14:22:12,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:12,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) [2021-09-13 14:22:12,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:12,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-09-13 14:22:12,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:22:12,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-09-13 14:22:12,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:22:12,543 INFO L87 Difference]: Start difference. First operand 424 states and 523 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) [2021-09-13 14:22:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:18,345 INFO L93 Difference]: Finished difference Result 1375 states and 1685 transitions. [2021-09-13 14:22:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-09-13 14:22:18,345 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) Word has length 58 [2021-09-13 14:22:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:22:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) [2021-09-13 14:22:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 325 transitions. [2021-09-13 14:22:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) [2021-09-13 14:22:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 325 transitions. [2021-09-13 14:22:18,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 325 transitions. [2021-09-13 14:22:18,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:18,663 INFO L225 Difference]: With dead ends: 1375 [2021-09-13 14:22:18,663 INFO L226 Difference]: Without dead ends: 1069 [2021-09-13 14:22:18,664 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 205.83ms TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2021-09-13 14:22:18,664 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 443 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 311.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.81ms SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 313.42ms IncrementalHoareTripleChecker+Time [2021-09-13 14:22:18,665 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 0 Invalid, 449 Unknown, 0 Unchecked, 1.81ms Time], IncrementalHoareTripleChecker [77 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 313.42ms Time] [2021-09-13 14:22:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2021-09-13 14:22:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 967. [2021-09-13 14:22:23,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:22:23,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1069 states. Second operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 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) [2021-09-13 14:22:23,277 INFO L74 IsIncluded]: Start isIncluded. First operand 1069 states. Second operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 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) [2021-09-13 14:22:23,277 INFO L87 Difference]: Start difference. First operand 1069 states. Second operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 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) [2021-09-13 14:22:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:23,308 INFO L93 Difference]: Finished difference Result 1069 states and 1232 transitions. [2021-09-13 14:22:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1232 transitions. [2021-09-13 14:22:23,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:23,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:23,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 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 1069 states. [2021-09-13 14:22:23,311 INFO L87 Difference]: Start difference. First operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 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 1069 states. [2021-09-13 14:22:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:22:23,356 INFO L93 Difference]: Finished difference Result 1069 states and 1232 transitions. [2021-09-13 14:22:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1232 transitions. [2021-09-13 14:22:23,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:22:23,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:22:23,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:22:23,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:22:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 962 states have (on average 1.183991683991684) internal successors, (1139), 966 states have internal predecessors, (1139), 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) [2021-09-13 14:22:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1139 transitions. [2021-09-13 14:22:23,412 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1139 transitions. Word has length 58 [2021-09-13 14:22:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:22:23,413 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1139 transitions. [2021-09-13 14:22:23,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 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) [2021-09-13 14:22:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1139 transitions. [2021-09-13 14:22:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-09-13 14:22:23,414 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:23,414 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:23,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-09-13 14:22:23,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-09-13 14:22:23,629 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:23,630 INFO L82 PathProgramCache]: Analyzing trace with hash -314259850, now seen corresponding path program 1 times [2021-09-13 14:22:23,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:22:23,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266741498] [2021-09-13 14:22:23,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:23,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:22:23,635 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:22:23,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270317520] [2021-09-13 14:22:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:23,636 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:22:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:23,641 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-09-13 14:22:23,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-09-13 14:22:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:23,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 82 conjunts are in the unsatisfiable core [2021-09-13 14:22:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:23,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:48,607 INFO L281 TraceCheckUtils]: 0: Hoare triple {23878#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~counter~0 := 0; {23878#true} is VALID [2021-09-13 14:22:48,607 INFO L281 TraceCheckUtils]: 1: Hoare triple {23878#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if main_~x~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23878#true} is VALID [2021-09-13 14:22:48,607 INFO L281 TraceCheckUtils]: 2: Hoare triple {23878#true} assume !(0 == assume_abort_if_not_~cond); {23878#true} is VALID [2021-09-13 14:22:48,607 INFO L281 TraceCheckUtils]: 3: Hoare triple {23878#true} assume_abort_if_not_#in~cond := (if main_~y~0 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23878#true} is VALID [2021-09-13 14:22:48,607 INFO L281 TraceCheckUtils]: 4: Hoare triple {23878#true} assume !(0 == assume_abort_if_not_~cond); {23878#true} is VALID [2021-09-13 14:22:48,608 INFO L281 TraceCheckUtils]: 5: Hoare triple {23878#true} main_~a~0 := main_~x~0;main_~b~0 := main_~y~0;main_~p~0 := 1;main_~q~0 := 0;main_~r~0 := 0;main_~s~0 := 1;main_~c~0 := 0;main_~k~0 := 0;main_~xy~0 := main_~x~0 * main_~y~0;main_~yy~0 := main_~y~0 * main_~y~0;assume_abort_if_not_#in~cond := (if main_~xy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,608 INFO L281 TraceCheckUtils]: 6: Hoare triple {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,608 INFO L281 TraceCheckUtils]: 7: Hoare triple {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume_abort_if_not_#in~cond := (if main_~yy~0 < 2147483647 then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,609 INFO L281 TraceCheckUtils]: 8: Hoare triple {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == assume_abort_if_not_~cond); {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,609 INFO L281 TraceCheckUtils]: 9: Hoare triple {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,609 INFO L281 TraceCheckUtils]: 10: Hoare triple {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,610 INFO L281 TraceCheckUtils]: 11: Hoare triple {23898#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,611 INFO L281 TraceCheckUtils]: 12: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,611 INFO L281 TraceCheckUtils]: 13: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,612 INFO L281 TraceCheckUtils]: 14: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,613 INFO L281 TraceCheckUtils]: 15: Hoare triple {23917#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23930#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,613 INFO L281 TraceCheckUtils]: 16: Hoare triple {23930#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,614 INFO L281 TraceCheckUtils]: 17: Hoare triple {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23930#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,614 INFO L281 TraceCheckUtils]: 18: Hoare triple {23930#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,615 INFO L281 TraceCheckUtils]: 19: Hoare triple {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,616 INFO L281 TraceCheckUtils]: 20: Hoare triple {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,616 INFO L281 TraceCheckUtils]: 21: Hoare triple {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,617 INFO L281 TraceCheckUtils]: 22: Hoare triple {23934#(and (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,618 INFO L281 TraceCheckUtils]: 23: Hoare triple {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,618 INFO L281 TraceCheckUtils]: 24: Hoare triple {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,619 INFO L281 TraceCheckUtils]: 25: Hoare triple {23953#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,619 INFO L281 TraceCheckUtils]: 26: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,620 INFO L281 TraceCheckUtils]: 27: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,621 INFO L281 TraceCheckUtils]: 28: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,621 INFO L281 TraceCheckUtils]: 29: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,622 INFO L281 TraceCheckUtils]: 30: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,622 INFO L281 TraceCheckUtils]: 31: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,623 INFO L281 TraceCheckUtils]: 32: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,624 INFO L281 TraceCheckUtils]: 33: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,624 INFO L281 TraceCheckUtils]: 34: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,625 INFO L281 TraceCheckUtils]: 35: Hoare triple {23963#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_~c~0 >= main_~b~0);main_~c~0 := main_~c~0 - main_~b~0;main_~k~0 := 1 + main_~k~0; {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,626 INFO L281 TraceCheckUtils]: 36: Hoare triple {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,627 INFO L281 TraceCheckUtils]: 37: Hoare triple {23994#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24001#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0))) (and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,628 INFO L281 TraceCheckUtils]: 38: Hoare triple {24001#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (or (and (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0))) (and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {24005#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:22:48,629 INFO L281 TraceCheckUtils]: 39: Hoare triple {24005#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24009#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,629 INFO L281 TraceCheckUtils]: 40: Hoare triple {24009#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,630 INFO L281 TraceCheckUtils]: 41: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,631 INFO L281 TraceCheckUtils]: 42: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,631 INFO L281 TraceCheckUtils]: 43: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if 0 == main_~q~0 * main_~xy~0 + main_~s~0 * main_~yy~0 - main_~q~0 * main_~x~0 - main_~b~0 * main_~y~0 - main_~s~0 * main_~y~0 + main_~b~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,632 INFO L281 TraceCheckUtils]: 44: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,633 INFO L281 TraceCheckUtils]: 45: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= main_~b~0); {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:22:48,635 INFO L281 TraceCheckUtils]: 46: Hoare triple {24013#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~q~0 1) (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~y~0))} main_~a~0 := main_~b~0;main_~b~0 := main_~c~0;havoc main_~temp~0;main_~temp~0 := main_~p~0;main_~p~0 := main_~q~0;main_~q~0 := main_~temp~0 - main_~q~0 * main_~k~0;main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := main_~temp~0 - main_~s~0 * main_~k~0; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,636 INFO L281 TraceCheckUtils]: 47: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,637 INFO L281 TraceCheckUtils]: 48: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,637 INFO L281 TraceCheckUtils]: 49: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(0 != main_~b~0);main_~c~0 := main_~a~0;main_~k~0 := 0; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,638 INFO L281 TraceCheckUtils]: 50: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,639 INFO L281 TraceCheckUtils]: 51: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == main_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,640 INFO L281 TraceCheckUtils]: 52: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} assume !(0 == __VERIFIER_assert_~cond); {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:22:48,641 INFO L281 TraceCheckUtils]: 53: Hoare triple {24032#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (or (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= (+ ULTIMATE.start_main_~s~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~r~0)) 1) (= (+ ULTIMATE.start_main_~q~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~p~0)) 0)) (= ULTIMATE.start_main_~x~0 0)) (= ULTIMATE.start_main_~p~0 1) (= ULTIMATE.start_main_~r~0 0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == main_~y~0 * main_~r~0 + main_~x~0 * main_~p~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24054#(and (or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2021-09-13 14:22:48,642 INFO L281 TraceCheckUtils]: 54: Hoare triple {24054#(and (or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {24058#(or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0)))} is VALID [2021-09-13 14:22:48,643 INFO L281 TraceCheckUtils]: 55: Hoare triple {24058#(or (= ULTIMATE.start_main_~x~0 0) (and (= ULTIMATE.start_main_~y~0 (+ ULTIMATE.start_main_~b~0 (* (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_main_~s~0 1) (= (+ (div ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~q~0) 0)))} __VERIFIER_assert_#in~cond := (if main_~b~0 == main_~x~0 * main_~q~0 + main_~y~0 * main_~s~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {24062#(<= 0 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:22:48,643 INFO L281 TraceCheckUtils]: 56: Hoare triple {24062#(<= 0 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {23878#true} is VALID [2021-09-13 14:22:48,644 INFO L281 TraceCheckUtils]: 57: Hoare triple {23878#true} assume !false; {23879#false} is INVALID [2021-09-13 14:22:48,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:22:48,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266741498] [2021-09-13 14:22:48,644 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:22:48,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270317520] [2021-09-13 14:22:48,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: invalid Hoare triple in FP [2021-09-13 14:22:48,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:48,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-09-13 14:22:48,645 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-09-13 14:22:48,645 INFO L627 BasicCegarLoop]: Counterexample might be feasible [2021-09-13 14:22:48,649 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-09-13 14:22:48,650 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-09-13 14:22:48,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2021-09-13 14:22:48,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2021-09-13 14:22:48,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2021-09-13 14:22:48,651 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-09-13 14:22:48,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-09-13 14:22:48,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:22:48,869 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-13 14:22:48,892 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2021-09-13 14:22:48,892 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2021-09-13 14:22:48,892 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:22:48,892 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2021-09-13 14:22:48,892 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2021-09-13 14:22:48,892 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L7-1 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2021-09-13 14:22:48,893 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L11-12 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L11-14 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L11-15 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L11-15 has no Hoare annotation [2021-09-13 14:22:48,894 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-17 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-5 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L11-6 has no Hoare annotation [2021-09-13 14:22:48,895 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L11-8 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L11-9 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:22:48,896 WARN L170 areAnnotationChecker]: L11-11 has no Hoare annotation [2021-09-13 14:22:48,897 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2021-09-13 14:22:48,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:22:48 BoogieIcfgContainer [2021-09-13 14:22:48,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-13 14:22:48,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-13 14:22:48,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-13 14:22:48,899 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-13 14:22:48,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:18:09" (3/4) ... [2021-09-13 14:22:48,901 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-09-13 14:22:48,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-13 14:22:48,903 INFO L158 Benchmark]: Toolchain (without parser) took 280206.76ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 42.2MB in the beginning and 73.1MB in the end (delta: -30.9MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2021-09-13 14:22:48,903 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 44.2MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:48,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.20ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 46.2MB in the end (delta: -4.3MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2021-09-13 14:22:48,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 62.9MB. Free memory was 46.2MB in the beginning and 44.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:22:48,903 INFO L158 Benchmark]: Boogie Preprocessor took 35.80ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 42.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:48,904 INFO L158 Benchmark]: RCFGBuilder took 362.07ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 31.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:22:48,904 INFO L158 Benchmark]: TraceAbstraction took 279521.81ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 30.8MB in the beginning and 73.1MB in the end (delta: -42.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-09-13 14:22:48,904 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 134.2MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:22:48,905 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.21ms. Allocated memory is still 62.9MB. Free memory was 44.2MB in the beginning and 44.2MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.20ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 46.2MB in the end (delta: -4.3MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 62.9MB. Free memory was 46.2MB in the beginning and 44.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.80ms. Allocated memory is still 62.9MB. Free memory was 44.1MB in the beginning and 42.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 362.07ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 31.3MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 279521.81ms. Allocated memory was 62.9MB in the beginning and 134.2MB in the end (delta: 71.3MB). Free memory was 30.8MB in the beginning and 73.1MB in the end (delta: -42.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 134.2MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L8] COND FALSE !(!cond) [L8] COND FALSE !(!cond) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y [L8] COND FALSE !(!cond) [L8] COND FALSE !(!cond) [L40] EXPR counter++ [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<20 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<20 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L51] COND FALSE !(!(c >= b)) [L53] c = c - b [L54] k = k + 1 [L46] EXPR counter++ [L46] COND TRUE counter++<20 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L51] COND TRUE !(c >= b) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND TRUE counter++<20 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND TRUE counter++<20 [L11] COND FALSE !(!(cond)) [L11] COND FALSE !(!(cond)) [L11] COND TRUE !(cond) [L13] reach_error() - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 279430.06ms, OverallIterations: 19, TraceHistogramMax: 4, EmptinessCheckTime: 20.17ms, AutomataDifference: 187373.30ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 9.41ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 3035 SdHoareTripleChecker+Valid, 29077.91ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3035 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 29013.28ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3006 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4631 IncrementalHoareTripleChecker+Invalid, 5306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 0 mSDtfsCounter, 4631 mSolverCounterSat, 47.90ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 946 GetRequests, 657 SyntacticMatches, 7 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2780 ImplicationChecksByTransitivity, 105808.46ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=967occurred in iteration=18, InterpolantAutomatonStates: 257, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 13103.43ms AutomataMinimizationTime, 18 MinimizatonAttempts, 707 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 128.40ms SsaConstructionTime, 348.59ms SatisfiabilityAnalysisTime, 44932.27ms InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 7228 SizeOfPredicates, 119 NumberOfNonLiveVariables, 2486 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 86/270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-09-13 14:22:48,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:22:50,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:22:50,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:22:50,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:22:50,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:22:50,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:22:50,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:22:50,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:22:50,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:22:50,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:22:50,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:22:50,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:22:50,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:22:50,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:22:50,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:22:50,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:22:50,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:22:50,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:22:50,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:22:50,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:22:50,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:22:50,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:22:50,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:22:50,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:22:50,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:22:50,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:22:50,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:22:50,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:22:50,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:22:50,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:22:50,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:22:50,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:22:50,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:22:50,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:22:50,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:22:50,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:22:50,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:22:50,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:22:50,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:22:50,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:22:50,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:22:50,903 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-09-13 14:22:50,942 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:22:50,943 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:22:50,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:22:50,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:22:50,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:22:50,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:22:50,946 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:22:50,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:22:50,946 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:22:50,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:22:50,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:22:50,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:22:50,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:22:50,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:22:50,948 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:22:50,948 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:22:50,948 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:22:50,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:22:50,949 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:22:50,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:22:50,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:22:50,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:22:50,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:22:50,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:22:50,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:22:50,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:22:50,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:22:50,950 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:22:50,950 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:22:50,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:22:50,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:22:50,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:22:50,951 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> e28dece7c557d04b250d1b8a0324022ff350e7d3 [2021-09-13 14:22:51,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:22:51,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:22:51,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:22:51,298 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:22:51,298 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:22:51,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2021-09-13 14:22:51,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26560f8d0/532a178f54fa4f7fa7d2e187327fc209/FLAGf300351eb [2021-09-13 14:22:51,739 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:22:51,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd2-ll_unwindbound20.c [2021-09-13 14:22:51,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26560f8d0/532a178f54fa4f7fa7d2e187327fc209/FLAGf300351eb [2021-09-13 14:22:52,170 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26560f8d0/532a178f54fa4f7fa7d2e187327fc209 [2021-09-13 14:22:52,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:22:52,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:22:52,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:22:52,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:22:52,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:22:52,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc588ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52, skipping insertion in model container [2021-09-13 14:22:52,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:22:52,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:22:52,334 WARN L228 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/egcd2-ll_unwindbound20.c[490,503] [2021-09-13 14:22:52,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:22:52,377 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:22:52,408 WARN L228 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/egcd2-ll_unwindbound20.c[490,503] [2021-09-13 14:22:52,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:22:52,435 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:22:52,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52 WrapperNode [2021-09-13 14:22:52,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:22:52,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:22:52,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:22:52,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:22:52,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:22:52,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:22:52,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:22:52,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:22:52,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:22:52,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:22:52,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:22:52,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:22:52,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (1/1) ... [2021-09-13 14:22:52,517 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:22:52,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:22:52,538 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) [2021-09-13 14:22:52,548 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 [2021-09-13 14:22:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:22:52,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:22:52,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:22:52,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:22:56,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:22:56,723 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-09-13 14:22:56,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:22:56 BoogieIcfgContainer [2021-09-13 14:22:56,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:22:56,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:22:56,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:22:56,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:22:56,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:22:52" (1/3) ... [2021-09-13 14:22:56,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cb66d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:22:56, skipping insertion in model container [2021-09-13 14:22:56,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:22:52" (2/3) ... [2021-09-13 14:22:56,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15cb66d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:22:56, skipping insertion in model container [2021-09-13 14:22:56,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:22:56" (3/3) ... [2021-09-13 14:22:56,732 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound20.c [2021-09-13 14:22:56,743 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:22:56,743 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-09-13 14:22:56,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:22:56,802 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-13 14:22:56,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-13 14:22:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 states have internal predecessors, (58), 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) [2021-09-13 14:22:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-13 14:22:56,833 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:22:56,833 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:22:56,835 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:22:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:22:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash -141782897, now seen corresponding path program 1 times [2021-09-13 14:22:56,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:22:56,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092009518] [2021-09-13 14:22:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:22:56,857 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:22:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:22:56,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:22:56,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 14:22:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:57,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:22:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:22:57,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:22:57,166 INFO L281 TraceCheckUtils]: 0: Hoare triple {46#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {46#true} is VALID [2021-09-13 14:22:57,166 INFO L281 TraceCheckUtils]: 1: Hoare triple {46#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {46#true} is VALID [2021-09-13 14:22:57,167 INFO L281 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,167 INFO L281 TraceCheckUtils]: 3: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,167 INFO L281 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,168 INFO L281 TraceCheckUtils]: 5: Hoare triple {47#false} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,168 INFO L281 TraceCheckUtils]: 6: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,168 INFO L281 TraceCheckUtils]: 7: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,169 INFO L281 TraceCheckUtils]: 8: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,169 INFO L281 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2021-09-13 14:22:57,169 INFO L281 TraceCheckUtils]: 10: Hoare triple {47#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,169 INFO L281 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0bv32 == __VERIFIER_assert_~cond; {47#false} is VALID [2021-09-13 14:22:57,170 INFO L281 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2021-09-13 14:22:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:57,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:22:57,229 INFO L281 TraceCheckUtils]: 12: Hoare triple {47#false} assume !false; {47#false} is VALID [2021-09-13 14:22:57,229 INFO L281 TraceCheckUtils]: 11: Hoare triple {47#false} assume 0bv32 == __VERIFIER_assert_~cond; {47#false} is VALID [2021-09-13 14:22:57,229 INFO L281 TraceCheckUtils]: 10: Hoare triple {47#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,229 INFO L281 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2021-09-13 14:22:57,230 INFO L281 TraceCheckUtils]: 8: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,230 INFO L281 TraceCheckUtils]: 7: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,230 INFO L281 TraceCheckUtils]: 6: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,230 INFO L281 TraceCheckUtils]: 5: Hoare triple {47#false} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,231 INFO L281 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,231 INFO L281 TraceCheckUtils]: 3: Hoare triple {47#false} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {47#false} is VALID [2021-09-13 14:22:57,232 INFO L281 TraceCheckUtils]: 2: Hoare triple {46#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {47#false} is VALID [2021-09-13 14:22:57,232 INFO L281 TraceCheckUtils]: 1: Hoare triple {46#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {46#true} is VALID [2021-09-13 14:22:57,232 INFO L281 TraceCheckUtils]: 0: Hoare triple {46#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {46#true} is VALID [2021-09-13 14:22:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:22:57,233 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:22:57,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092009518] [2021-09-13 14:22:57,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092009518] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:22:57,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:22:57,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:22:57,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603030987] [2021-09-13 14:22:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2021-09-13 14:22:57,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:22:57,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:22:57,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:22:57,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:22:57,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:22:57,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:22:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:22:57,376 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 42 states have internal predecessors, (58), 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 has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:23:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:01,309 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2021-09-13 14:23:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:23:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2021-09-13 14:23:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:23:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:23:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:23:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:23:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2021-09-13 14:23:01,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2021-09-13 14:23:02,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:02,090 INFO L225 Difference]: With dead ends: 83 [2021-09-13 14:23:02,090 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:23:02,093 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.14ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:23:02,096 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1801.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.20ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1803.32ms IncrementalHoareTripleChecker+Time [2021-09-13 14:23:02,096 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 1.20ms Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1803.32ms Time] [2021-09-13 14:23:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:23:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:23:02,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:23:02,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:23:02,123 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:23:02,123 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:23:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:02,126 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:23:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:23:02,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:02,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:02,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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 39 states. [2021-09-13 14:23:02,128 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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 39 states. [2021-09-13 14:23:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:02,130 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2021-09-13 14:23:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:23:02,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:02,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:02,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:23:02,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:23:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 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) [2021-09-13 14:23:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-09-13 14:23:02,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 13 [2021-09-13 14:23:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:23:02,135 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-09-13 14:23:02,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2021-09-13 14:23:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-09-13 14:23:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-13 14:23:02,136 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:23:02,136 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:23:02,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-09-13 14:23:02,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:23:02,351 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:23:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:23:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1057770534, now seen corresponding path program 1 times [2021-09-13 14:23:02,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:23:02,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174602809] [2021-09-13 14:23:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:23:02,353 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:23:02,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:23:02,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:23:02,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 14:23:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:02,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:23:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:02,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:23:02,725 INFO L281 TraceCheckUtils]: 0: Hoare triple {347#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,726 INFO L281 TraceCheckUtils]: 1: Hoare triple {352#(= ~counter~0 (_ bv0 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,726 INFO L281 TraceCheckUtils]: 2: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,727 INFO L281 TraceCheckUtils]: 3: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,727 INFO L281 TraceCheckUtils]: 4: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,728 INFO L281 TraceCheckUtils]: 5: Hoare triple {352#(= ~counter~0 (_ bv0 32))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,728 INFO L281 TraceCheckUtils]: 6: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,729 INFO L281 TraceCheckUtils]: 7: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,729 INFO L281 TraceCheckUtils]: 8: Hoare triple {352#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {352#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:23:02,730 INFO L281 TraceCheckUtils]: 9: Hoare triple {352#(= ~counter~0 (_ bv0 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {380#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} is VALID [2021-09-13 14:23:02,731 INFO L281 TraceCheckUtils]: 10: Hoare triple {380#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {348#false} is VALID [2021-09-13 14:23:02,731 INFO L281 TraceCheckUtils]: 11: Hoare triple {348#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {348#false} is VALID [2021-09-13 14:23:02,731 INFO L281 TraceCheckUtils]: 12: Hoare triple {348#false} assume 0bv32 == __VERIFIER_assert_~cond; {348#false} is VALID [2021-09-13 14:23:02,731 INFO L281 TraceCheckUtils]: 13: Hoare triple {348#false} assume !false; {348#false} is VALID [2021-09-13 14:23:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:23:02,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:23:02,920 INFO L281 TraceCheckUtils]: 13: Hoare triple {348#false} assume !false; {348#false} is VALID [2021-09-13 14:23:02,921 INFO L281 TraceCheckUtils]: 12: Hoare triple {348#false} assume 0bv32 == __VERIFIER_assert_~cond; {348#false} is VALID [2021-09-13 14:23:02,921 INFO L281 TraceCheckUtils]: 11: Hoare triple {348#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {348#false} is VALID [2021-09-13 14:23:02,922 INFO L281 TraceCheckUtils]: 10: Hoare triple {402#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv20 32))} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {348#false} is VALID [2021-09-13 14:23:02,922 INFO L281 TraceCheckUtils]: 9: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {402#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv20 32))} is VALID [2021-09-13 14:23:02,923 INFO L281 TraceCheckUtils]: 8: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,923 INFO L281 TraceCheckUtils]: 7: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,924 INFO L281 TraceCheckUtils]: 6: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,925 INFO L281 TraceCheckUtils]: 5: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,925 INFO L281 TraceCheckUtils]: 4: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,928 INFO L281 TraceCheckUtils]: 3: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,929 INFO L281 TraceCheckUtils]: 2: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,929 INFO L281 TraceCheckUtils]: 1: Hoare triple {406#(bvslt ~counter~0 (_ bv20 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,932 INFO L281 TraceCheckUtils]: 0: Hoare triple {347#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {406#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:23:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:23:02,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:23:02,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174602809] [2021-09-13 14:23:02,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174602809] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:23:02,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:23:02,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-09-13 14:23:02,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616482362] [2021-09-13 14:23:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 14 [2021-09-13 14:23:02,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:23:02,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-09-13 14:23:03,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:03,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:23:03,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:23:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:23:03,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:23:03,086 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-09-13 14:23:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:16,937 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2021-09-13 14:23:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:23:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 14 [2021-09-13 14:23:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:23:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-09-13 14:23:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2021-09-13 14:23:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-09-13 14:23:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2021-09-13 14:23:16,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2021-09-13 14:23:17,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:17,411 INFO L225 Difference]: With dead ends: 59 [2021-09-13 14:23:17,411 INFO L226 Difference]: Without dead ends: 51 [2021-09-13 14:23:17,412 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 103.55ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:23:17,413 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6407.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.20ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6413.49ms IncrementalHoareTripleChecker+Time [2021-09-13 14:23:17,413 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 4.20ms Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 6413.49ms Time] [2021-09-13 14:23:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-09-13 14:23:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2021-09-13 14:23:17,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:23:17,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:23:17,425 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:23:17,426 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:23:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:17,428 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-09-13 14:23:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-09-13 14:23:17,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:17,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:17,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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 51 states. [2021-09-13 14:23:17,429 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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 51 states. [2021-09-13 14:23:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:17,431 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2021-09-13 14:23:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-09-13 14:23:17,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:17,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:17,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:23:17,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:23:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 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) [2021-09-13 14:23:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-09-13 14:23:17,434 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 14 [2021-09-13 14:23:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:23:17,435 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-09-13 14:23:17,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) [2021-09-13 14:23:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-09-13 14:23:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-13 14:23:17,436 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:23:17,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:23:17,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-09-13 14:23:17,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:23:17,641 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:23:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:23:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1568670238, now seen corresponding path program 1 times [2021-09-13 14:23:17,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:23:17,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775520412] [2021-09-13 14:23:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:23:17,647 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:23:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:23:17,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:23:17,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 14:23:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:17,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:23:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:17,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:23:21,966 INFO L281 TraceCheckUtils]: 0: Hoare triple {656#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {656#true} is VALID [2021-09-13 14:23:21,966 INFO L281 TraceCheckUtils]: 1: Hoare triple {656#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {656#true} is VALID [2021-09-13 14:23:21,967 INFO L281 TraceCheckUtils]: 2: Hoare triple {656#true} assume !(0bv32 == assume_abort_if_not_~cond); {656#true} is VALID [2021-09-13 14:23:21,971 INFO L281 TraceCheckUtils]: 3: Hoare triple {656#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {670#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))))} is VALID [2021-09-13 14:23:21,971 INFO L281 TraceCheckUtils]: 4: Hoare triple {670#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {674#(bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))} is VALID [2021-09-13 14:23:23,996 INFO L281 TraceCheckUtils]: 5: Hoare triple {674#(bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} is UNKNOWN [2021-09-13 14:23:23,996 INFO L281 TraceCheckUtils]: 6: Hoare triple {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} assume !(0bv32 == assume_abort_if_not_~cond); {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} is VALID [2021-09-13 14:23:24,022 INFO L281 TraceCheckUtils]: 7: Hoare triple {678#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {685#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))))} is VALID [2021-09-13 14:23:24,039 INFO L281 TraceCheckUtils]: 8: Hoare triple {685#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))))))} assume !(0bv32 == assume_abort_if_not_~cond); {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:24,039 INFO L281 TraceCheckUtils]: 9: Hoare triple {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:24,040 INFO L281 TraceCheckUtils]: 10: Hoare triple {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:24,055 INFO L281 TraceCheckUtils]: 11: Hoare triple {689#(exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {657#false} is VALID [2021-09-13 14:23:24,055 INFO L281 TraceCheckUtils]: 12: Hoare triple {657#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {657#false} is VALID [2021-09-13 14:23:24,056 INFO L281 TraceCheckUtils]: 13: Hoare triple {657#false} assume 0bv32 == __VERIFIER_assert_~cond; {657#false} is VALID [2021-09-13 14:23:24,056 INFO L281 TraceCheckUtils]: 14: Hoare triple {657#false} assume !false; {657#false} is VALID [2021-09-13 14:23:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:23:24,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:23:25,478 INFO L281 TraceCheckUtils]: 14: Hoare triple {657#false} assume !false; {657#false} is VALID [2021-09-13 14:23:25,478 INFO L281 TraceCheckUtils]: 13: Hoare triple {657#false} assume 0bv32 == __VERIFIER_assert_~cond; {657#false} is VALID [2021-09-13 14:23:25,478 INFO L281 TraceCheckUtils]: 12: Hoare triple {657#false} __VERIFIER_assert_#in~cond := (if ~bvadd64(~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {657#false} is VALID [2021-09-13 14:23:25,478 INFO L281 TraceCheckUtils]: 11: Hoare triple {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {657#false} is VALID [2021-09-13 14:23:25,479 INFO L281 TraceCheckUtils]: 10: Hoare triple {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:23:25,479 INFO L281 TraceCheckUtils]: 9: Hoare triple {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:23:25,479 INFO L281 TraceCheckUtils]: 8: Hoare triple {727#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {717#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:23:25,480 INFO L281 TraceCheckUtils]: 7: Hoare triple {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {727#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2021-09-13 14:23:25,480 INFO L281 TraceCheckUtils]: 6: Hoare triple {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:25,482 INFO L281 TraceCheckUtils]: 5: Hoare triple {738#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {731#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0)) (not (bvslt ULTIMATE.start_main_~yy~0 ((_ sign_extend 32) (_ bv2147483647 32)))))} is VALID [2021-09-13 14:23:25,483 INFO L281 TraceCheckUtils]: 4: Hoare triple {742#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {738#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:23:25,483 INFO L281 TraceCheckUtils]: 3: Hoare triple {656#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {742#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2021-09-13 14:23:25,483 INFO L281 TraceCheckUtils]: 2: Hoare triple {656#true} assume !(0bv32 == assume_abort_if_not_~cond); {656#true} is VALID [2021-09-13 14:23:25,483 INFO L281 TraceCheckUtils]: 1: Hoare triple {656#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {656#true} is VALID [2021-09-13 14:23:25,484 INFO L281 TraceCheckUtils]: 0: Hoare triple {656#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {656#true} is VALID [2021-09-13 14:23:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:23:25,484 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:23:25,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775520412] [2021-09-13 14:23:25,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775520412] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:23:25,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:23:25,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-09-13 14:23:25,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294810335] [2021-09-13 14:23:25,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) Word has length 15 [2021-09-13 14:23:25,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:23:25,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) [2021-09-13 14:23:27,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:27,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:23:27,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:23:27,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:23:27,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:23:27,704 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) [2021-09-13 14:23:40,568 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:23:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:41,573 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-09-13 14:23:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:23:41,574 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) Word has length 15 [2021-09-13 14:23:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:23:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) [2021-09-13 14:23:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2021-09-13 14:23:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) [2021-09-13 14:23:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2021-09-13 14:23:41,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2021-09-13 14:23:44,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:23:44,214 INFO L225 Difference]: With dead ends: 50 [2021-09-13 14:23:44,214 INFO L226 Difference]: Without dead ends: 42 [2021-09-13 14:23:44,215 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2680.88ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:23:44,219 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6057.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.11ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 6062.12ms IncrementalHoareTripleChecker+Time [2021-09-13 14:23:44,221 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 3.11ms Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 113 Unchecked, 6062.12ms Time] [2021-09-13 14:23:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-09-13 14:23:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-09-13 14:23:44,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:23:44,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:23:44,229 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:23:44,229 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:23:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:44,231 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-09-13 14:23:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:23:44,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:44,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:44,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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 42 states. [2021-09-13 14:23:44,232 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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 42 states. [2021-09-13 14:23:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:23:44,234 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-09-13 14:23:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:23:44,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:23:44,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:23:44,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:23:44,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:23:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 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) [2021-09-13 14:23:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-09-13 14:23:44,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2021-09-13 14:23:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:23:44,236 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-09-13 14:23:44,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 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) [2021-09-13 14:23:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-09-13 14:23:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:23:44,237 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:23:44,238 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:23:44,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-09-13 14:23:44,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:23:44,450 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:23:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:23:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1384108475, now seen corresponding path program 1 times [2021-09-13 14:23:44,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:23:44,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745278069] [2021-09-13 14:23:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:23:44,451 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:23:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:23:44,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:23:44,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 14:23:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:44,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjunts are in the unsatisfiable core [2021-09-13 14:23:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:23:44,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:23:55,919 INFO L281 TraceCheckUtils]: 0: Hoare triple {951#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {951#true} is VALID [2021-09-13 14:23:55,921 INFO L281 TraceCheckUtils]: 1: Hoare triple {951#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {959#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))))} is VALID [2021-09-13 14:23:55,921 INFO L281 TraceCheckUtils]: 2: Hoare triple {959#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {963#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:23:55,922 INFO L281 TraceCheckUtils]: 3: Hoare triple {963#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {967#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} is VALID [2021-09-13 14:23:55,922 INFO L281 TraceCheckUtils]: 4: Hoare triple {967#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} assume !(0bv32 == assume_abort_if_not_~cond); {971#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:23:57,950 INFO L281 TraceCheckUtils]: 5: Hoare triple {971#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is UNKNOWN [2021-09-13 14:23:57,951 INFO L281 TraceCheckUtils]: 6: Hoare triple {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !(0bv32 == assume_abort_if_not_~cond); {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:57,998 INFO L281 TraceCheckUtils]: 7: Hoare triple {975#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~yy~0 (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0))) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {982#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))))))} is VALID [2021-09-13 14:23:58,037 INFO L281 TraceCheckUtils]: 8: Hoare triple {982#(and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (and (not (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32)))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))))))} assume !(0bv32 == assume_abort_if_not_~cond); {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:58,038 INFO L281 TraceCheckUtils]: 9: Hoare triple {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:58,039 INFO L281 TraceCheckUtils]: 10: Hoare triple {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:58,040 INFO L281 TraceCheckUtils]: 11: Hoare triple {986#(and (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:58,041 INFO L281 TraceCheckUtils]: 12: Hoare triple {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} is VALID [2021-09-13 14:23:58,042 INFO L281 TraceCheckUtils]: 13: Hoare triple {996#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~c~0) (exists ((ULTIMATE.start_main_~y~0 (_ BitVec 32))) (and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (bvslt (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)) ((_ sign_extend 32) (_ bv2147483647 32))))) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 32))) (and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0))))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(main_~k~0, main_~b~0), main_~c~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1003#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:23:58,042 INFO L281 TraceCheckUtils]: 14: Hoare triple {1003#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {952#false} is VALID [2021-09-13 14:23:58,042 INFO L281 TraceCheckUtils]: 15: Hoare triple {952#false} assume !false; {952#false} is VALID [2021-09-13 14:23:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:23:58,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:24:00,681 INFO L281 TraceCheckUtils]: 15: Hoare triple {952#false} assume !false; {952#false} is VALID [2021-09-13 14:24:00,681 INFO L281 TraceCheckUtils]: 14: Hoare triple {1013#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {952#false} is VALID [2021-09-13 14:24:00,682 INFO L281 TraceCheckUtils]: 13: Hoare triple {1017#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(main_~k~0, main_~b~0), main_~c~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1013#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:24:00,683 INFO L281 TraceCheckUtils]: 12: Hoare triple {1017#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1017#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:24:00,683 INFO L281 TraceCheckUtils]: 11: Hoare triple {951#true} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1017#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:24:00,683 INFO L281 TraceCheckUtils]: 10: Hoare triple {951#true} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {951#true} is VALID [2021-09-13 14:24:00,684 INFO L281 TraceCheckUtils]: 9: Hoare triple {951#true} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {951#true} is VALID [2021-09-13 14:24:00,684 INFO L281 TraceCheckUtils]: 8: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:24:00,684 INFO L281 TraceCheckUtils]: 7: Hoare triple {951#true} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {951#true} is VALID [2021-09-13 14:24:00,684 INFO L281 TraceCheckUtils]: 6: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:24:00,684 INFO L281 TraceCheckUtils]: 5: Hoare triple {951#true} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {951#true} is VALID [2021-09-13 14:24:00,685 INFO L281 TraceCheckUtils]: 4: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:24:00,685 INFO L281 TraceCheckUtils]: 3: Hoare triple {951#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {951#true} is VALID [2021-09-13 14:24:00,685 INFO L281 TraceCheckUtils]: 2: Hoare triple {951#true} assume !(0bv32 == assume_abort_if_not_~cond); {951#true} is VALID [2021-09-13 14:24:00,685 INFO L281 TraceCheckUtils]: 1: Hoare triple {951#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {951#true} is VALID [2021-09-13 14:24:00,685 INFO L281 TraceCheckUtils]: 0: Hoare triple {951#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {951#true} is VALID [2021-09-13 14:24:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:00,686 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:24:00,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745278069] [2021-09-13 14:24:00,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745278069] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:24:00,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:24:00,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 4] imperfect sequences [] total 13 [2021-09-13 14:24:00,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73388667] [2021-09-13 14:24:00,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) Word has length 16 [2021-09-13 14:24:00,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:24:00,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) [2021-09-13 14:24:03,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:03,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-09-13 14:24:03,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:24:03,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-09-13 14:24:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:24:03,407 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) [2021-09-13 14:24:32,875 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:24:36,554 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:24:38,682 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:24:41,739 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:24:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:51,147 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2021-09-13 14:24:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:24:51,147 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) Word has length 16 [2021-09-13 14:24:51,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:24:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) [2021-09-13 14:24:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2021-09-13 14:24:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) [2021-09-13 14:24:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2021-09-13 14:24:51,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 59 transitions. [2021-09-13 14:24:54,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:24:54,382 INFO L225 Difference]: With dead ends: 53 [2021-09-13 14:24:54,382 INFO L226 Difference]: Without dead ends: 51 [2021-09-13 14:24:54,383 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8434.51ms TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:24:54,384 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21213.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.37ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 21219.62ms IncrementalHoareTripleChecker+Time [2021-09-13 14:24:54,384 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 407 Unknown, 0 Unchecked, 4.37ms Time], IncrementalHoareTripleChecker [7 Valid, 275 Invalid, 0 Unknown, 125 Unchecked, 21219.62ms Time] [2021-09-13 14:24:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-09-13 14:24:54,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-09-13 14:24:54,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:24:54,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:24:54,399 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:24:54,399 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:24:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:54,401 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2021-09-13 14:24:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-09-13 14:24:54,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:54,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:54,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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 51 states. [2021-09-13 14:24:54,402 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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 51 states. [2021-09-13 14:24:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:24:54,404 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2021-09-13 14:24:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2021-09-13 14:24:54,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:24:54,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:24:54,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:24:54,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:24:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 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) [2021-09-13 14:24:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2021-09-13 14:24:54,407 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2021-09-13 14:24:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:24:54,407 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2021-09-13 14:24:54,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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) [2021-09-13 14:24:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2021-09-13 14:24:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:24:54,408 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:24:54,408 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:24:54,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 14:24:54,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:24:54,620 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2021-09-13 14:24:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:24:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1311460386, now seen corresponding path program 1 times [2021-09-13 14:24:54,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:24:54,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543912063] [2021-09-13 14:24:54,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:24:54,622 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:24:54,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:24:54,622 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:24:54,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-09-13 14:24:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:54,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:24:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:24:54,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:24:56,345 INFO L281 TraceCheckUtils]: 0: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {1283#true} is VALID [2021-09-13 14:24:56,358 INFO L281 TraceCheckUtils]: 1: Hoare triple {1283#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1291#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))))} is VALID [2021-09-13 14:24:56,358 INFO L281 TraceCheckUtils]: 2: Hoare triple {1291#(or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond); {1295#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:24:56,359 INFO L281 TraceCheckUtils]: 3: Hoare triple {1295#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1299#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} is VALID [2021-09-13 14:24:56,360 INFO L281 TraceCheckUtils]: 4: Hoare triple {1299#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (or (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))) (and (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))))))} assume !(0bv32 == assume_abort_if_not_~cond); {1303#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:24:56,361 INFO L281 TraceCheckUtils]: 5: Hoare triple {1303#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,361 INFO L281 TraceCheckUtils]: 6: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !(0bv32 == assume_abort_if_not_~cond); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,362 INFO L281 TraceCheckUtils]: 7: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,362 INFO L281 TraceCheckUtils]: 8: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !(0bv32 == assume_abort_if_not_~cond); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,363 INFO L281 TraceCheckUtils]: 9: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,363 INFO L281 TraceCheckUtils]: 10: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,364 INFO L281 TraceCheckUtils]: 11: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,365 INFO L281 TraceCheckUtils]: 12: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,365 INFO L281 TraceCheckUtils]: 13: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(main_~k~0, main_~b~0), main_~c~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,366 INFO L281 TraceCheckUtils]: 14: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} is VALID [2021-09-13 14:24:56,367 INFO L281 TraceCheckUtils]: 15: Hoare triple {1307#(and (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~r~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) ULTIMATE.start_main_~x~0) ULTIMATE.start_main_~a~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~p~0))} __VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1338#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:24:56,367 INFO L281 TraceCheckUtils]: 16: Hoare triple {1338#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {1284#false} is VALID [2021-09-13 14:24:56,367 INFO L281 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2021-09-13 14:24:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:24:56,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:05,414 INFO L281 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2021-09-13 14:25:05,415 INFO L281 TraceCheckUtils]: 16: Hoare triple {1348#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {1284#false} is VALID [2021-09-13 14:25:05,415 INFO L281 TraceCheckUtils]: 15: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} __VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~r~0), ~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~p~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1348#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:25:05,416 INFO L281 TraceCheckUtils]: 14: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,416 INFO L281 TraceCheckUtils]: 13: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10;__VERIFIER_assert_#in~cond := (if main_~a~0 == ~bvadd64(~bvmul64(main_~k~0, main_~b~0), main_~c~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,416 INFO L281 TraceCheckUtils]: 12: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,417 INFO L281 TraceCheckUtils]: 11: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,417 INFO L281 TraceCheckUtils]: 10: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,418 INFO L281 TraceCheckUtils]: 9: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,418 INFO L281 TraceCheckUtils]: 8: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !(0bv32 == assume_abort_if_not_~cond); {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,419 INFO L281 TraceCheckUtils]: 7: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume_abort_if_not_#in~cond := (if ~bvslt64(main_~yy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,419 INFO L281 TraceCheckUtils]: 6: Hoare triple {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} assume !(0bv32 == assume_abort_if_not_~cond); {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,420 INFO L281 TraceCheckUtils]: 5: Hoare triple {1283#true} main_~a~0 := ~sign_extendFrom32To64(main_~x~0);main_~b~0 := ~sign_extendFrom32To64(main_~y~0);main_~p~0 := ~sign_extendFrom32To64(1bv32);main_~q~0 := ~sign_extendFrom32To64(0bv32);main_~r~0 := ~sign_extendFrom32To64(0bv32);main_~s~0 := ~sign_extendFrom32To64(1bv32);main_~c~0 := ~sign_extendFrom32To64(0bv32);main_~k~0 := ~sign_extendFrom32To64(0bv32);main_~xy~0 := ~bvmul64(~sign_extendFrom32To64(main_~x~0), ~sign_extendFrom32To64(main_~y~0));main_~yy~0 := ~bvmul64(~sign_extendFrom32To64(main_~y~0), ~sign_extendFrom32To64(main_~y~0));assume_abort_if_not_#in~cond := (if ~bvslt64(main_~xy~0, ~sign_extendFrom32To64(2147483647bv32)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1352#(= (bvadd (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~r~0) (bvmul ULTIMATE.start_main_~p~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:05,420 INFO L281 TraceCheckUtils]: 4: Hoare triple {1283#true} assume !(0bv32 == assume_abort_if_not_~cond); {1283#true} is VALID [2021-09-13 14:25:05,420 INFO L281 TraceCheckUtils]: 3: Hoare triple {1283#true} assume_abort_if_not_#in~cond := (if ~bvsge32(main_~y~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1283#true} is VALID [2021-09-13 14:25:05,420 INFO L281 TraceCheckUtils]: 2: Hoare triple {1283#true} assume !(0bv32 == assume_abort_if_not_~cond); {1283#true} is VALID [2021-09-13 14:25:05,421 INFO L281 TraceCheckUtils]: 1: Hoare triple {1283#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post10, main_~temp~0, main_#t~post9, main_~x~0, main_~y~0, main_~a~0, main_~b~0, main_~p~0, main_~q~0, main_~r~0, main_~s~0, main_~c~0, main_~k~0, main_~xy~0, main_~yy~0;havoc main_~x~0;havoc main_~y~0;havoc main_~a~0;havoc main_~b~0;havoc main_~p~0;havoc main_~q~0;havoc main_~r~0;havoc main_~s~0;havoc main_~c~0;havoc main_~k~0;havoc main_~xy~0;havoc main_~yy~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := main_#t~nondet8;havoc main_#t~nondet8;assume_abort_if_not_#in~cond := (if ~bvsge32(main_~x~0, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1283#true} is VALID [2021-09-13 14:25:05,421 INFO L281 TraceCheckUtils]: 0: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2bv32);call write~init~intINTTYPE1(48bv8, #t~string4.base, #t~string4.offset, 1bv32);call write~init~intINTTYPE1(0bv8, #t~string4.base, ~bvadd32(1bv32, #t~string4.offset), 1bv32);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11bv32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12bv32);~counter~0 := 0bv32; {1283#true} is VALID [2021-09-13 14:25:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:05,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:25:05,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543912063] [2021-09-13 14:25:05,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543912063] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:05,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:05,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:25:05,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470484224] [2021-09-13 14:25:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) Word has length 18 [2021-09-13 14:25:05,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:05,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) [2021-09-13 14:25:06,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:06,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:25:06,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:25:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:25:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:25:06,237 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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) [2021-09-13 14:25:33,316 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:37,618 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:40,003 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:57,729 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:59,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:25:59,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:25:59,999 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 4471.00ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:25:59,999 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26779.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.85ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26785.51ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:59,999 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 5.85ms Time], IncrementalHoareTripleChecker [27 Valid, 256 Invalid, 1 Unknown, 0 Unchecked, 26785.51ms Time] [2021-09-13 14:26:00,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-09-13 14:26:00,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:26:00,201 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4f25ee8b at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveInternal(ChainingHoareTripleChecker.java:318) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:290) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-09-13 14:26:00,204 INFO L158 Benchmark]: Toolchain (without parser) took 188029.89ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.5MB in the beginning and 44.2MB in the end (delta: -6.7MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2021-09-13 14:26:00,204 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:26:00,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.60ms. Allocated memory is still 58.7MB. Free memory was 37.2MB in the beginning and 41.1MB in the end (delta: -3.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-09-13 14:26:00,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.31ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 39.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:26:00,205 INFO L158 Benchmark]: Boogie Preprocessor took 22.76ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 37.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:26:00,205 INFO L158 Benchmark]: RCFGBuilder took 4214.48ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 53.1MB in the end (delta: -15.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2021-09-13 14:26:00,205 INFO L158 Benchmark]: TraceAbstraction took 183476.03ms. Allocated memory is still 71.3MB. Free memory was 52.9MB in the beginning and 44.2MB in the end (delta: 8.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2021-09-13 14:26:00,206 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.18ms. Allocated memory is still 58.7MB. Free memory was 40.7MB in the beginning and 40.7MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.60ms. Allocated memory is still 58.7MB. Free memory was 37.2MB in the beginning and 41.1MB in the end (delta: -3.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.31ms. Allocated memory is still 58.7MB. Free memory was 41.1MB in the beginning and 39.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.76ms. Allocated memory is still 58.7MB. Free memory was 39.0MB in the beginning and 37.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4214.48ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 53.1MB in the end (delta: -15.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 183476.03ms. Allocated memory is still 71.3MB. Free memory was 52.9MB in the beginning and 44.2MB in the end (delta: 8.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4f25ee8b de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4f25ee8b: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 14:26:00,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...