./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/egcd3-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/egcd3-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 b4e7938b4423950851166e0ea8765de2619e9f00 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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/egcd3-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 b4e7938b4423950851166e0ea8765de2619e9f00 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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@63547c9a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 14:25:25,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:25:25,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:25:25,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:25:25,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:25:25,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:25:25,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:25:25,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:25:25,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:25:25,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:25:25,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:25:25,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:25:25,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:25:25,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:25:25,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:25:25,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:25:25,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:25:25,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:25:25,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:25:25,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:25:25,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:25:25,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:25:25,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:25:25,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:25:25,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:25:25,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:25:25,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:25:25,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:25:25,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:25:25,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:25:25,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:25:25,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:25:25,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:25:25,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:25:25,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:25:25,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:25:25,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:25:25,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:25:25,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:25:25,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:25:25,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:25:25,097 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:25:25,118 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:25:25,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:25:25,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:25:25,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:25:25,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:25:25,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:25:25,120 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:25:25,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:25:25,120 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:25:25,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 14:25:25,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:25:25,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:25:25,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:25:25,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:25:25,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:25:25,121 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:25:25,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:25:25,125 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:25:25,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:25:25,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:25:25,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:25:25,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:25:25,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:25:25,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:25:25,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:25:25,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:25:25,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 14:25:25,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 14:25:25,127 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:25:25,127 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:25:25,127 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 -> b4e7938b4423950851166e0ea8765de2619e9f00 [2021-09-13 14:25:25,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:25:25,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:25:25,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:25:25,391 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:25:25,392 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:25:25,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound20.c [2021-09-13 14:25:25,438 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71587b02a/b98ec3cbbdd94a7eb841060ef4776e3c/FLAG32eb0c257 [2021-09-13 14:25:25,791 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:25:25,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound20.c [2021-09-13 14:25:25,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71587b02a/b98ec3cbbdd94a7eb841060ef4776e3c/FLAG32eb0c257 [2021-09-13 14:25:25,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71587b02a/b98ec3cbbdd94a7eb841060ef4776e3c [2021-09-13 14:25:25,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:25:25,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:25:25,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:25:25,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:25:25,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:25:25,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:25" (1/1) ... [2021-09-13 14:25:25,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@479900af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:25, skipping insertion in model container [2021-09-13 14:25:25,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:25:25" (1/1) ... [2021-09-13 14:25:25,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:25:25,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:25:25,951 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/egcd3-ll_unwindbound20.c[490,503] [2021-09-13 14:25:25,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:25:25,980 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:25:26,023 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/egcd3-ll_unwindbound20.c[490,503] [2021-09-13 14:25:26,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:25:26,049 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:25:26,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26 WrapperNode [2021-09-13 14:25:26,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:25:26,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:25:26,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:25:26,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:25:26,057 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:25:26" (1/1) ... [2021-09-13 14:25:26,067 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:25:26" (1/1) ... [2021-09-13 14:25:26,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:25:26,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:25:26,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:25:26,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:25:26,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:25:26,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:25:26,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:25:26,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:25:26,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (1/1) ... [2021-09-13 14:25:26,139 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:25:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:26,167 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:25:26,191 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:25:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-13 14:25:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:25:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:25:26,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:25:26,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:25:26,430 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-09-13 14:25:26,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:25:26 BoogieIcfgContainer [2021-09-13 14:25:26,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:25:26,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:25:26,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:25:26,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:25:26,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:25:25" (1/3) ... [2021-09-13 14:25:26,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7647895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:25:26, skipping insertion in model container [2021-09-13 14:25:26,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:25:26" (2/3) ... [2021-09-13 14:25:26,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7647895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:25:26, skipping insertion in model container [2021-09-13 14:25:26,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:25:26" (3/3) ... [2021-09-13 14:25:26,442 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound20.c [2021-09-13 14:25:26,446 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:25:26,446 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:25:26,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:25:26,480 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:25:26,485 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:25:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 39 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:25:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:25:26,503 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:26,504 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:26,504 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:26,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1233339761, now seen corresponding path program 1 times [2021-09-13 14:25:26,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:26,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682916322] [2021-09-13 14:25:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:26,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:26,659 INFO L281 TraceCheckUtils]: 0: Hoare triple {43#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; {43#true} is VALID [2021-09-13 14:25:26,660 INFO L281 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {43#true} is VALID [2021-09-13 14:25:26,661 INFO L281 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0 == assume_abort_if_not_~cond;assume false; {44#false} is VALID [2021-09-13 14:25:26,661 INFO L281 TraceCheckUtils]: 3: Hoare triple {44#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; {44#false} is VALID [2021-09-13 14:25:26,661 INFO L281 TraceCheckUtils]: 4: Hoare triple {44#false} assume 0 == assume_abort_if_not_~cond;assume false; {44#false} is VALID [2021-09-13 14:25:26,662 INFO L281 TraceCheckUtils]: 5: Hoare triple {44#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; {44#false} is VALID [2021-09-13 14:25:26,662 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:25:26,663 INFO L281 TraceCheckUtils]: 7: Hoare triple {44#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {44#false} is VALID [2021-09-13 14:25:26,663 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:25:26,663 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:25:26,664 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:26,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:26,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682916322] [2021-09-13 14:25:26,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682916322] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:26,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:26,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-13 14:25:26,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298232093] [2021-09-13 14:25:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:25:26,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:26,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:26,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:26,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:25:26,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:25:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:25:26,716 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 39 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:26,836 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-09-13 14:25:26,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:25:26,838 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:25:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:25:26,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:25:26,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2021-09-13 14:25:26,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:26,998 INFO L225 Difference]: With dead ends: 77 [2021-09-13 14:25:26,998 INFO L226 Difference]: Without dead ends: 36 [2021-09-13 14:25:27,004 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:25:27,006 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.45ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:27,007 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.64ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 46.45ms Time] [2021-09-13 14:25:27,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-13 14:25:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-13 14:25:27,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:27,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27,027 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27,027 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:27,030 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:25:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:25:27,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:27,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:27,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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 36 states. [2021-09-13 14:25:27,031 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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 36 states. [2021-09-13 14:25:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:27,040 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:25:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:25:27,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:27,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:27,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:27,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-09-13 14:25:27,047 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2021-09-13 14:25:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:27,047 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-09-13 14:25:27,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:25:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:25:27,049 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:27,049 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:27,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-13 14:25:27,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1507359540, now seen corresponding path program 1 times [2021-09-13 14:25:27,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:27,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771271700] [2021-09-13 14:25:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:27,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:27,068 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:27,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437886187] [2021-09-13 14:25:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:27,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:27,071 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:25:27,096 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:25:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:27,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:25:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:27,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:27,224 INFO L281 TraceCheckUtils]: 0: Hoare triple {257#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; {262#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:27,225 INFO L281 TraceCheckUtils]: 1: Hoare triple {262#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {262#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:27,225 INFO L281 TraceCheckUtils]: 2: Hoare triple {262#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {262#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:27,225 INFO L281 TraceCheckUtils]: 3: Hoare triple {262#(<= ~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; {262#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:27,226 INFO L281 TraceCheckUtils]: 4: Hoare triple {262#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {262#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:27,230 INFO L281 TraceCheckUtils]: 5: Hoare triple {262#(<= ~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; {262#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:27,231 INFO L281 TraceCheckUtils]: 6: Hoare triple {262#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {281#(<= |ULTIMATE.start_main_#t~post9| 0)} is VALID [2021-09-13 14:25:27,231 INFO L281 TraceCheckUtils]: 7: Hoare triple {281#(<= |ULTIMATE.start_main_#t~post9| 0)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {258#false} is VALID [2021-09-13 14:25:27,232 INFO L281 TraceCheckUtils]: 8: Hoare triple {258#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {258#false} is VALID [2021-09-13 14:25:27,232 INFO L281 TraceCheckUtils]: 9: Hoare triple {258#false} assume 0 == __VERIFIER_assert_~cond; {258#false} is VALID [2021-09-13 14:25:27,232 INFO L281 TraceCheckUtils]: 10: Hoare triple {258#false} assume !false; {258#false} is VALID [2021-09-13 14:25:27,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:25:27,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:27,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:27,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771271700] [2021-09-13 14:25:27,233 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:27,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437886187] [2021-09-13 14:25:27,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437886187] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:27,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:27,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-13 14:25:27,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663632731] [2021-09-13 14:25:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-09-13 14:25:27,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:27,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:27,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:25:27,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:27,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:25:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:25:27,249 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:27,424 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2021-09-13 14:25:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:25:27,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-09-13 14:25:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-09-13 14:25:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2021-09-13 14:25:27,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2021-09-13 14:25:27,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:27,465 INFO L225 Difference]: With dead ends: 42 [2021-09-13 14:25:27,465 INFO L226 Difference]: Without dead ends: 38 [2021-09-13 14:25:27,466 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.97ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:25:27,468 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.38ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.42ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:27,468 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 2.38ms Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 91.42ms Time] [2021-09-13 14:25:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-09-13 14:25:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-09-13 14:25:27,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:27,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:27,478 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:27,479 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:27,485 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 14:25:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:25:27,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:27,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:27,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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 38 states. [2021-09-13 14:25:27,489 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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 38 states. [2021-09-13 14:25:27,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:27,494 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2021-09-13 14:25:27,494 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:25:27,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:27,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:27,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:27,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 14:25:27,498 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2021-09-13 14:25:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:27,498 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 14:25:27,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:25:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:25:27,499 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:27,499 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:27,519 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:25:27,717 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:25:27,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash 515746917, now seen corresponding path program 1 times [2021-09-13 14:25:27,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:27,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630517110] [2021-09-13 14:25:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:27,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:27,729 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:27,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476094466] [2021-09-13 14:25:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:27,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:27,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:27,734 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:25:27,754 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:25:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:27,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:25:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:27,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:27,913 INFO L281 TraceCheckUtils]: 0: Hoare triple {465#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; {465#true} is VALID [2021-09-13 14:25:27,913 INFO L281 TraceCheckUtils]: 1: Hoare triple {465#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {465#true} is VALID [2021-09-13 14:25:27,914 INFO L281 TraceCheckUtils]: 2: Hoare triple {465#true} assume !(0 == assume_abort_if_not_~cond); {465#true} is VALID [2021-09-13 14:25:27,914 INFO L281 TraceCheckUtils]: 3: Hoare triple {465#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; {479#(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:25:27,915 INFO L281 TraceCheckUtils]: 4: Hoare triple {479#(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); {483#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:25:27,916 INFO L281 TraceCheckUtils]: 5: Hoare triple {483#(<= 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; {487#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:27,916 INFO L281 TraceCheckUtils]: 6: Hoare triple {487#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {487#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:27,919 INFO L281 TraceCheckUtils]: 7: Hoare triple {487#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {487#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:27,920 INFO L281 TraceCheckUtils]: 8: Hoare triple {487#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {466#false} is VALID [2021-09-13 14:25:27,920 INFO L281 TraceCheckUtils]: 9: Hoare triple {466#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {466#false} is VALID [2021-09-13 14:25:27,920 INFO L281 TraceCheckUtils]: 10: Hoare triple {466#false} assume 0 == __VERIFIER_assert_~cond; {466#false} is VALID [2021-09-13 14:25:27,920 INFO L281 TraceCheckUtils]: 11: Hoare triple {466#false} assume !false; {466#false} is VALID [2021-09-13 14:25:27,920 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:27,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:27,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:27,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630517110] [2021-09-13 14:25:27,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:27,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476094466] [2021-09-13 14:25:27,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476094466] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:27,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:27,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:25:27,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011591503] [2021-09-13 14:25:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-09-13 14:25:27,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:27,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:27,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:27,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:25:27,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:27,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:25:27,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:27,936 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:28,149 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2021-09-13 14:25:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:25:28,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-09-13 14:25:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-09-13 14:25:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2021-09-13 14:25:28,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2021-09-13 14:25:28,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:28,207 INFO L225 Difference]: With dead ends: 66 [2021-09-13 14:25:28,207 INFO L226 Difference]: Without dead ends: 62 [2021-09-13 14:25:28,207 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.36ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:25:28,208 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.28ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.87ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:28,208 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 5.28ms Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 53.87ms Time] [2021-09-13 14:25:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-09-13 14:25:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 39. [2021-09-13 14:25:28,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:28,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:25:28,223 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:25:28,223 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:25:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:28,225 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:25:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-09-13 14:25:28,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:28,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:28,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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 62 states. [2021-09-13 14:25:28,226 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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 62 states. [2021-09-13 14:25:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:28,227 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:25:28,228 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2021-09-13 14:25:28,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:28,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:28,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:28,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:25:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-09-13 14:25:28,229 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2021-09-13 14:25:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:28,230 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-09-13 14:25:28,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:25:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:25:28,230 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:28,230 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:25:28,250 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:25:28,445 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:25:28,445 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:28,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:28,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1270616931, now seen corresponding path program 1 times [2021-09-13 14:25:28,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:28,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8310221] [2021-09-13 14:25:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:28,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:28,455 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:28,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420292469] [2021-09-13 14:25:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:28,456 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:28,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:28,456 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:25:28,463 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:25:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:28,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 14:25:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:28,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:28,825 INFO L281 TraceCheckUtils]: 0: Hoare triple {760#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; {760#true} is VALID [2021-09-13 14:25:28,825 INFO L281 TraceCheckUtils]: 1: Hoare triple {760#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {760#true} is VALID [2021-09-13 14:25:28,825 INFO L281 TraceCheckUtils]: 2: Hoare triple {760#true} assume !(0 == assume_abort_if_not_~cond); {760#true} is VALID [2021-09-13 14:25:28,826 INFO L281 TraceCheckUtils]: 3: Hoare triple {760#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; {774#(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:25:28,827 INFO L281 TraceCheckUtils]: 4: Hoare triple {774#(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); {778#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:25:28,827 INFO L281 TraceCheckUtils]: 5: Hoare triple {778#(<= 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; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,828 INFO L281 TraceCheckUtils]: 6: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,828 INFO L281 TraceCheckUtils]: 7: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,829 INFO L281 TraceCheckUtils]: 8: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,829 INFO L281 TraceCheckUtils]: 9: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,830 INFO L281 TraceCheckUtils]: 10: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,830 INFO L281 TraceCheckUtils]: 11: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,831 INFO L281 TraceCheckUtils]: 12: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} is VALID [2021-09-13 14:25:28,831 INFO L281 TraceCheckUtils]: 13: Hoare triple {782#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~p~0 1) (<= 1 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~r~0 0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {807#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:28,832 INFO L281 TraceCheckUtils]: 14: Hoare triple {807#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {761#false} is VALID [2021-09-13 14:25:28,832 INFO L281 TraceCheckUtils]: 15: Hoare triple {761#false} assume !false; {761#false} is VALID [2021-09-13 14:25:28,833 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:28,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:28,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:28,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8310221] [2021-09-13 14:25:28,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:28,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420292469] [2021-09-13 14:25:28,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420292469] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:28,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:28,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-13 14:25:28,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942142445] [2021-09-13 14:25:28,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:28,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:28,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:28,849 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:25:28,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:25:28,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:25:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:25:28,852 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:29,140 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2021-09-13 14:25:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:25:29,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:29,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2021-09-13 14:25:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2021-09-13 14:25:29,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2021-09-13 14:25:29,191 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:25:29,192 INFO L225 Difference]: With dead ends: 62 [2021-09-13 14:25:29,192 INFO L226 Difference]: Without dead ends: 60 [2021-09-13 14:25:29,193 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 76.71ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:25:29,193 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.82ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.36ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:29,193 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 1.82ms Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 86.36ms Time] [2021-09-13 14:25:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-09-13 14:25:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2021-09-13 14:25:29,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:29,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:25:29,225 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:25:29,225 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:25:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:29,226 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-09-13 14:25:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-09-13 14:25:29,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:29,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:29,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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) Second operand 60 states. [2021-09-13 14:25:29,227 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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) Second operand 60 states. [2021-09-13 14:25:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:29,228 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2021-09-13 14:25:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-09-13 14:25:29,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:29,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:29,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:29,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:25:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2021-09-13 14:25:29,230 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2021-09-13 14:25:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:29,230 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2021-09-13 14:25:29,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:25:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2021-09-13 14:25:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:25:29,230 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:29,230 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:29,251 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:25:29,448 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:25:29,448 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:29,448 INFO L82 PathProgramCache]: Analyzing trace with hash -648504839, now seen corresponding path program 1 times [2021-09-13 14:25:29,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:29,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707027628] [2021-09-13 14:25:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:29,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:29,463 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:29,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2125300516] [2021-09-13 14:25:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:29,464 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:29,465 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:25:29,466 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:25:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:29,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:25:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:29,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:29,618 INFO L281 TraceCheckUtils]: 0: Hoare triple {1082#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; {1087#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:29,621 INFO L281 TraceCheckUtils]: 1: Hoare triple {1087#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1087#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:29,622 INFO L281 TraceCheckUtils]: 2: Hoare triple {1087#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1087#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:29,622 INFO L281 TraceCheckUtils]: 3: Hoare triple {1087#(<= ~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; {1087#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:29,624 INFO L281 TraceCheckUtils]: 4: Hoare triple {1087#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1087#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:29,624 INFO L281 TraceCheckUtils]: 5: Hoare triple {1087#(<= ~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; {1087#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:29,624 INFO L281 TraceCheckUtils]: 6: Hoare triple {1087#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1106#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:29,625 INFO L281 TraceCheckUtils]: 7: Hoare triple {1106#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {1106#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:29,625 INFO L281 TraceCheckUtils]: 8: Hoare triple {1106#(<= ~counter~0 1)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {1106#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:29,625 INFO L281 TraceCheckUtils]: 9: Hoare triple {1106#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1116#(<= |ULTIMATE.start_main_#t~post10| 1)} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 10: Hoare triple {1116#(<= |ULTIMATE.start_main_#t~post10| 1)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {1083#false} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 11: Hoare triple {1083#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; {1083#false} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 12: Hoare triple {1083#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1083#false} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 13: Hoare triple {1083#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {1083#false} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 14: Hoare triple {1083#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1083#false} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 15: Hoare triple {1083#false} assume 0 == __VERIFIER_assert_~cond; {1083#false} is VALID [2021-09-13 14:25:29,626 INFO L281 TraceCheckUtils]: 16: Hoare triple {1083#false} assume !false; {1083#false} is VALID [2021-09-13 14:25:29,627 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:25:29,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:29,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:29,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707027628] [2021-09-13 14:25:29,627 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:29,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125300516] [2021-09-13 14:25:29,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125300516] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:29,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:29,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:25:29,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689782349] [2021-09-13 14:25:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-09-13 14:25:29,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:29,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:29,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:29,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:25:29,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:29,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:25:29,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:29,651 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:29,807 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2021-09-13 14:25:29,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:25:29,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-09-13 14:25:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-09-13 14:25:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2021-09-13 14:25:29,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2021-09-13 14:25:29,858 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:25:29,860 INFO L225 Difference]: With dead ends: 85 [2021-09-13 14:25:29,860 INFO L226 Difference]: Without dead ends: 55 [2021-09-13 14:25:29,861 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.79ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:29,862 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.94ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.63ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:29,863 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.94ms Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 62.63ms Time] [2021-09-13 14:25:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-09-13 14:25:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-09-13 14:25:29,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:29,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.34) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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:29,904 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.34) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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:29,904 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.34) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:29,905 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-09-13 14:25:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:25:29,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:29,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:29,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.34) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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:25:29,906 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.34) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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:25:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:29,907 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2021-09-13 14:25:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:25:29,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:29,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:29,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:29,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.34) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2021-09-13 14:25:29,908 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 17 [2021-09-13 14:25:29,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:29,908 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2021-09-13 14:25:29,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2021-09-13 14:25:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:25:29,909 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:29,909 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:29,929 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:25:30,109 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:25:30,110 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1354097033, now seen corresponding path program 1 times [2021-09-13 14:25:30,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:30,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122975082] [2021-09-13 14:25:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:30,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:30,119 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:30,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369282373] [2021-09-13 14:25:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:30,120 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:30,121 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:25:30,134 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:25:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:30,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:25:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:30,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:30,369 INFO L281 TraceCheckUtils]: 0: Hoare triple {1424#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; {1429#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:30,369 INFO L281 TraceCheckUtils]: 1: Hoare triple {1429#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1429#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:30,372 INFO L281 TraceCheckUtils]: 2: Hoare triple {1429#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1429#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:30,373 INFO L281 TraceCheckUtils]: 3: Hoare triple {1429#(<= ~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; {1429#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:30,373 INFO L281 TraceCheckUtils]: 4: Hoare triple {1429#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {1429#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:30,373 INFO L281 TraceCheckUtils]: 5: Hoare triple {1429#(<= ~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; {1429#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:30,374 INFO L281 TraceCheckUtils]: 6: Hoare triple {1429#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1448#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:30,375 INFO L281 TraceCheckUtils]: 7: Hoare triple {1448#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {1448#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:30,375 INFO L281 TraceCheckUtils]: 8: Hoare triple {1448#(<= ~counter~0 1)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {1448#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:30,375 INFO L281 TraceCheckUtils]: 9: Hoare triple {1448#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1458#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:30,376 INFO L281 TraceCheckUtils]: 10: Hoare triple {1458#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {1458#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:30,376 INFO L281 TraceCheckUtils]: 11: Hoare triple {1458#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {1458#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:30,376 INFO L281 TraceCheckUtils]: 12: Hoare triple {1458#(<= ~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; {1458#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:30,377 INFO L281 TraceCheckUtils]: 13: Hoare triple {1458#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1471#(<= |ULTIMATE.start_main_#t~post9| 2)} is VALID [2021-09-13 14:25:30,377 INFO L281 TraceCheckUtils]: 14: Hoare triple {1471#(<= |ULTIMATE.start_main_#t~post9| 2)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {1425#false} is VALID [2021-09-13 14:25:30,377 INFO L281 TraceCheckUtils]: 15: Hoare triple {1425#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1425#false} is VALID [2021-09-13 14:25:30,377 INFO L281 TraceCheckUtils]: 16: Hoare triple {1425#false} assume 0 == __VERIFIER_assert_~cond; {1425#false} is VALID [2021-09-13 14:25:30,377 INFO L281 TraceCheckUtils]: 17: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2021-09-13 14:25:30,377 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:25:30,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:30,537 INFO L281 TraceCheckUtils]: 17: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2021-09-13 14:25:30,537 INFO L281 TraceCheckUtils]: 16: Hoare triple {1425#false} assume 0 == __VERIFIER_assert_~cond; {1425#false} is VALID [2021-09-13 14:25:30,537 INFO L281 TraceCheckUtils]: 15: Hoare triple {1425#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1425#false} is VALID [2021-09-13 14:25:30,538 INFO L281 TraceCheckUtils]: 14: Hoare triple {1493#(< |ULTIMATE.start_main_#t~post9| 20)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {1425#false} is VALID [2021-09-13 14:25:30,538 INFO L281 TraceCheckUtils]: 13: Hoare triple {1497#(< ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1493#(< |ULTIMATE.start_main_#t~post9| 20)} is VALID [2021-09-13 14:25:30,538 INFO L281 TraceCheckUtils]: 12: Hoare triple {1497#(< ~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; {1497#(< ~counter~0 20)} is VALID [2021-09-13 14:25:30,539 INFO L281 TraceCheckUtils]: 11: Hoare triple {1497#(< ~counter~0 20)} assume !(main_~c~0 >= main_~b~0); {1497#(< ~counter~0 20)} is VALID [2021-09-13 14:25:30,539 INFO L281 TraceCheckUtils]: 10: Hoare triple {1497#(< ~counter~0 20)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {1497#(< ~counter~0 20)} is VALID [2021-09-13 14:25:30,540 INFO L281 TraceCheckUtils]: 9: Hoare triple {1510#(< ~counter~0 19)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {1497#(< ~counter~0 20)} is VALID [2021-09-13 14:25:30,540 INFO L281 TraceCheckUtils]: 8: Hoare triple {1510#(< ~counter~0 19)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {1510#(< ~counter~0 19)} is VALID [2021-09-13 14:25:30,540 INFO L281 TraceCheckUtils]: 7: Hoare triple {1510#(< ~counter~0 19)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {1510#(< ~counter~0 19)} is VALID [2021-09-13 14:25:30,541 INFO L281 TraceCheckUtils]: 6: Hoare triple {1520#(< ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {1510#(< ~counter~0 19)} is VALID [2021-09-13 14:25:30,541 INFO L281 TraceCheckUtils]: 5: Hoare triple {1520#(< ~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; {1520#(< ~counter~0 18)} is VALID [2021-09-13 14:25:30,541 INFO L281 TraceCheckUtils]: 4: Hoare triple {1520#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {1520#(< ~counter~0 18)} is VALID [2021-09-13 14:25:30,542 INFO L281 TraceCheckUtils]: 3: Hoare triple {1520#(< ~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; {1520#(< ~counter~0 18)} is VALID [2021-09-13 14:25:30,542 INFO L281 TraceCheckUtils]: 2: Hoare triple {1520#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond); {1520#(< ~counter~0 18)} is VALID [2021-09-13 14:25:30,543 INFO L281 TraceCheckUtils]: 1: Hoare triple {1520#(< ~counter~0 18)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1520#(< ~counter~0 18)} is VALID [2021-09-13 14:25:30,543 INFO L281 TraceCheckUtils]: 0: Hoare triple {1424#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; {1520#(< ~counter~0 18)} is VALID [2021-09-13 14:25:30,543 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:25:30,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:30,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122975082] [2021-09-13 14:25:30,544 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:30,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369282373] [2021-09-13 14:25:30,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369282373] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:30,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:30,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:25:30,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123409336] [2021-09-13 14:25:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:30,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:30,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:30,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:30,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:25:30,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:25:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:25:30,565 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:31,063 INFO L93 Difference]: Finished difference Result 156 states and 188 transitions. [2021-09-13 14:25:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:25:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2021-09-13 14:25:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2021-09-13 14:25:31,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 144 transitions. [2021-09-13 14:25:31,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:31,146 INFO L225 Difference]: With dead ends: 156 [2021-09-13 14:25:31,146 INFO L226 Difference]: Without dead ends: 152 [2021-09-13 14:25:31,146 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 53.61ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:25:31,147 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 183.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.32ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 185.77ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:31,147 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 2.32ms Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 185.77ms Time] [2021-09-13 14:25:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-09-13 14:25:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2021-09-13 14:25:31,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:31,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 90 states, 85 states have (on average 1.388235294117647) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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:31,254 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 90 states, 85 states have (on average 1.388235294117647) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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:31,254 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 90 states, 85 states have (on average 1.388235294117647) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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:31,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:31,257 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-09-13 14:25:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-09-13 14:25:31,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:31,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:31,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.388235294117647) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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 152 states. [2021-09-13 14:25:31,258 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.388235294117647) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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 152 states. [2021-09-13 14:25:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:31,261 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2021-09-13 14:25:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2021-09-13 14:25:31,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:31,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:31,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:31,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.388235294117647) internal successors, (118), 89 states have internal predecessors, (118), 0 states have call successors, (0), 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:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2021-09-13 14:25:31,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 18 [2021-09-13 14:25:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:31,263 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2021-09-13 14:25:31,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2021-09-13 14:25:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:25:31,264 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:31,264 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:25:31,285 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:25:31,476 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:25:31,477 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1292001664, now seen corresponding path program 1 times [2021-09-13 14:25:31,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:31,477 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633559256] [2021-09-13 14:25:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:31,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:31,486 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:31,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302420064] [2021-09-13 14:25:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:31,486 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:31,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:31,487 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:25:31,492 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:25:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:31,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2021-09-13 14:25:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:31,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:32,005 INFO L281 TraceCheckUtils]: 0: Hoare triple {2168#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; {2168#true} is VALID [2021-09-13 14:25:32,006 INFO L281 TraceCheckUtils]: 1: Hoare triple {2168#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {2168#true} is VALID [2021-09-13 14:25:32,006 INFO L281 TraceCheckUtils]: 2: Hoare triple {2168#true} assume !(0 == assume_abort_if_not_~cond); {2168#true} is VALID [2021-09-13 14:25:32,006 INFO L281 TraceCheckUtils]: 3: Hoare triple {2168#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; {2182#(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:25:32,009 INFO L281 TraceCheckUtils]: 4: Hoare triple {2182#(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); {2186#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:25:32,009 INFO L281 TraceCheckUtils]: 5: Hoare triple {2186#(<= 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; {2190#(and (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (<= 1 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:25:32,010 INFO L281 TraceCheckUtils]: 6: Hoare triple {2190#(and (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (<= 1 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; {2190#(and (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (<= 1 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:25:32,010 INFO L281 TraceCheckUtils]: 7: Hoare triple {2190#(and (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (<= 1 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; {2190#(and (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (<= 1 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:25:32,011 INFO L281 TraceCheckUtils]: 8: Hoare triple {2190#(and (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~x~0) (<= 1 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);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2200#(and (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 1 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:25:32,012 INFO L281 TraceCheckUtils]: 9: Hoare triple {2200#(and (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 1 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; {2200#(and (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 1 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:25:32,012 INFO L281 TraceCheckUtils]: 10: Hoare triple {2200#(and (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 1 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; {2200#(and (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 1 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:25:32,013 INFO L281 TraceCheckUtils]: 11: Hoare triple {2200#(and (<= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~x~0) (<= 1 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_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:25:32,014 INFO L281 TraceCheckUtils]: 12: Hoare triple {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:25:32,015 INFO L281 TraceCheckUtils]: 13: Hoare triple {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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~post11 < 20);havoc main_#t~post11;__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; {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:25:32,016 INFO L281 TraceCheckUtils]: 14: Hoare triple {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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); {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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:25:32,025 INFO L281 TraceCheckUtils]: 15: Hoare triple {2210#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~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; {2223#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:32,026 INFO L281 TraceCheckUtils]: 16: Hoare triple {2223#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {2169#false} is VALID [2021-09-13 14:25:32,026 INFO L281 TraceCheckUtils]: 17: Hoare triple {2169#false} assume !false; {2169#false} is VALID [2021-09-13 14:25:32,026 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:32,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:32,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:32,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633559256] [2021-09-13 14:25:32,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:32,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302420064] [2021-09-13 14:25:32,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302420064] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:32,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:32,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-09-13 14:25:32,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656505127] [2021-09-13 14:25:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:32,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,040 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:25:32,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:25:32,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:25:32,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:25:32,040 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:32,773 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2021-09-13 14:25:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:25:32,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2021-09-13 14:25:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 93 transitions. [2021-09-13 14:25:32,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 93 transitions. [2021-09-13 14:25:32,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:32,848 INFO L225 Difference]: With dead ends: 115 [2021-09-13 14:25:32,848 INFO L226 Difference]: Without dead ends: 113 [2021-09-13 14:25:32,848 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 257.51ms TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:25:32,849 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 162.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.35ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 164.03ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:32,849 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 2.35ms Time], IncrementalHoareTripleChecker [18 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 164.03ms Time] [2021-09-13 14:25:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-09-13 14:25:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2021-09-13 14:25:32,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:32,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 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:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 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:32,977 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 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:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:32,979 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2021-09-13 14:25:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-09-13 14:25:32,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:32,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:32,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 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 113 states. [2021-09-13 14:25:32,980 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 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 113 states. [2021-09-13 14:25:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:32,982 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2021-09-13 14:25:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-09-13 14:25:32,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:32,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:32,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:32,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 89 states have internal predecessors, (115), 0 states have call successors, (0), 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:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2021-09-13 14:25:32,984 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 115 transitions. Word has length 18 [2021-09-13 14:25:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:32,984 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 115 transitions. [2021-09-13 14:25:32,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:25:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 115 transitions. [2021-09-13 14:25:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:25:32,984 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:32,985 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:33,004 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:25:33,193 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:25:33,193 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash 971917338, now seen corresponding path program 1 times [2021-09-13 14:25:33,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:33,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587610090] [2021-09-13 14:25:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:33,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:33,207 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:33,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011227232] [2021-09-13 14:25:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:33,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:33,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:33,209 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:25:33,210 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:25:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:33,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:25:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:33,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:33,398 INFO L281 TraceCheckUtils]: 0: Hoare triple {2737#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; {2737#true} is VALID [2021-09-13 14:25:33,399 INFO L281 TraceCheckUtils]: 1: Hoare triple {2737#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {2745#(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:25:33,400 INFO L281 TraceCheckUtils]: 2: Hoare triple {2745#(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); {2749#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:33,400 INFO L281 TraceCheckUtils]: 3: Hoare triple {2749#(<= 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; {2749#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:33,401 INFO L281 TraceCheckUtils]: 4: Hoare triple {2749#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {2749#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:33,401 INFO L281 TraceCheckUtils]: 5: Hoare triple {2749#(<= 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; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:33,401 INFO L281 TraceCheckUtils]: 6: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:33,401 INFO L281 TraceCheckUtils]: 7: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:33,402 INFO L281 TraceCheckUtils]: 8: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,403 INFO L281 TraceCheckUtils]: 9: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,403 INFO L281 TraceCheckUtils]: 10: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,403 INFO L281 TraceCheckUtils]: 11: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,404 INFO L281 TraceCheckUtils]: 12: Hoare triple {2769#(<= 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; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:33,404 INFO L281 TraceCheckUtils]: 13: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:33,404 INFO L281 TraceCheckUtils]: 14: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:33,404 INFO L281 TraceCheckUtils]: 15: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {2738#false} is VALID [2021-09-13 14:25:33,405 INFO L281 TraceCheckUtils]: 16: Hoare triple {2738#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2738#false} is VALID [2021-09-13 14:25:33,405 INFO L281 TraceCheckUtils]: 17: Hoare triple {2738#false} assume 0 == __VERIFIER_assert_~cond; {2738#false} is VALID [2021-09-13 14:25:33,405 INFO L281 TraceCheckUtils]: 18: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2021-09-13 14:25:33,405 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:25:33,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:33,547 INFO L281 TraceCheckUtils]: 18: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2021-09-13 14:25:33,548 INFO L281 TraceCheckUtils]: 17: Hoare triple {2738#false} assume 0 == __VERIFIER_assert_~cond; {2738#false} is VALID [2021-09-13 14:25:33,548 INFO L281 TraceCheckUtils]: 16: Hoare triple {2738#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2738#false} is VALID [2021-09-13 14:25:33,553 INFO L281 TraceCheckUtils]: 15: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !(0 != main_~b~0); {2738#false} is VALID [2021-09-13 14:25:33,554 INFO L281 TraceCheckUtils]: 14: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:33,554 INFO L281 TraceCheckUtils]: 13: Hoare triple {2782#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:33,555 INFO L281 TraceCheckUtils]: 12: Hoare triple {2769#(<= 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; {2782#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:33,555 INFO L281 TraceCheckUtils]: 11: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,556 INFO L281 TraceCheckUtils]: 10: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,556 INFO L281 TraceCheckUtils]: 9: Hoare triple {2769#(<= 1 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,557 INFO L281 TraceCheckUtils]: 8: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {2769#(<= 1 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:33,557 INFO L281 TraceCheckUtils]: 7: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:33,557 INFO L281 TraceCheckUtils]: 6: Hoare triple {2759#(<= 1 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:33,558 INFO L281 TraceCheckUtils]: 5: Hoare triple {2749#(<= 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; {2759#(<= 1 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:33,558 INFO L281 TraceCheckUtils]: 4: Hoare triple {2749#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {2749#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:33,559 INFO L281 TraceCheckUtils]: 3: Hoare triple {2749#(<= 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; {2749#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:33,559 INFO L281 TraceCheckUtils]: 2: Hoare triple {2849#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} assume !(0 == assume_abort_if_not_~cond); {2749#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:33,560 INFO L281 TraceCheckUtils]: 1: Hoare triple {2737#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {2849#(or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:33,560 INFO L281 TraceCheckUtils]: 0: Hoare triple {2737#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; {2737#true} is VALID [2021-09-13 14:25:33,560 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:25:33,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:33,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587610090] [2021-09-13 14:25:33,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:33,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011227232] [2021-09-13 14:25:33,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011227232] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:33,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:33,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-09-13 14:25:33,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721476634] [2021-09-13 14:25:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 19 [2021-09-13 14:25:33,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:33,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:33,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:25:33,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:33,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:25:33,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:25:33,576 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:34,319 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2021-09-13 14:25:34,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 14:25:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 19 [2021-09-13 14:25:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2021-09-13 14:25:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2021-09-13 14:25:34,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2021-09-13 14:25:34,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:34,442 INFO L225 Difference]: With dead ends: 225 [2021-09-13 14:25:34,442 INFO L226 Difference]: Without dead ends: 221 [2021-09-13 14:25:34,442 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 84.50ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:25:34,443 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 360 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 202.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.46ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 205.36ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:34,443 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 5.46ms Time], IncrementalHoareTripleChecker [18 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 205.36ms Time] [2021-09-13 14:25:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-09-13 14:25:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 125. [2021-09-13 14:25:34,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:34,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 125 states, 120 states have (on average 1.375) internal successors, (165), 124 states have internal predecessors, (165), 0 states have call successors, (0), 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:34,612 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 125 states, 120 states have (on average 1.375) internal successors, (165), 124 states have internal predecessors, (165), 0 states have call successors, (0), 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:34,613 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 125 states, 120 states have (on average 1.375) internal successors, (165), 124 states have internal predecessors, (165), 0 states have call successors, (0), 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:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:34,628 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2021-09-13 14:25:34,628 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-09-13 14:25:34,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:34,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:34,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.375) internal successors, (165), 124 states have internal predecessors, (165), 0 states have call successors, (0), 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 221 states. [2021-09-13 14:25:34,630 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.375) internal successors, (165), 124 states have internal predecessors, (165), 0 states have call successors, (0), 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 221 states. [2021-09-13 14:25:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:34,637 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2021-09-13 14:25:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-09-13 14:25:34,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:34,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:34,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:34,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.375) internal successors, (165), 124 states have internal predecessors, (165), 0 states have call successors, (0), 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:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 165 transitions. [2021-09-13 14:25:34,642 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 165 transitions. Word has length 19 [2021-09-13 14:25:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:34,642 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 165 transitions. [2021-09-13 14:25:34,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 165 transitions. [2021-09-13 14:25:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:25:34,643 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:34,643 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:25:34,663 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:25:34,856 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:25:34,857 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -367893245, now seen corresponding path program 1 times [2021-09-13 14:25:34,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:34,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225565902] [2021-09-13 14:25:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:34,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:34,870 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:34,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254044609] [2021-09-13 14:25:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:34,870 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:34,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:34,871 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:25:34,880 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:25:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:34,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:25:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:34,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:35,191 INFO L281 TraceCheckUtils]: 0: Hoare triple {3765#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; {3765#true} is VALID [2021-09-13 14:25:35,191 INFO L281 TraceCheckUtils]: 1: Hoare triple {3765#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {3765#true} is VALID [2021-09-13 14:25:35,191 INFO L281 TraceCheckUtils]: 2: Hoare triple {3765#true} assume !(0 == assume_abort_if_not_~cond); {3765#true} is VALID [2021-09-13 14:25:35,192 INFO L281 TraceCheckUtils]: 3: Hoare triple {3765#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; {3779#(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:25:35,192 INFO L281 TraceCheckUtils]: 4: Hoare triple {3779#(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); {3783#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:25:35,193 INFO L281 TraceCheckUtils]: 5: Hoare triple {3783#(<= 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; {3787#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:35,193 INFO L281 TraceCheckUtils]: 6: Hoare triple {3787#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {3787#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:35,193 INFO L281 TraceCheckUtils]: 7: Hoare triple {3787#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {3787#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:35,194 INFO L281 TraceCheckUtils]: 8: Hoare triple {3787#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {3797#(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:25:35,194 INFO L281 TraceCheckUtils]: 9: Hoare triple {3797#(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; {3797#(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:25:35,194 INFO L281 TraceCheckUtils]: 10: Hoare triple {3797#(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; {3797#(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:25:35,195 INFO L281 TraceCheckUtils]: 11: Hoare triple {3797#(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_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {3797#(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:25:35,195 INFO L281 TraceCheckUtils]: 12: Hoare triple {3797#(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~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {3797#(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:25:35,196 INFO L281 TraceCheckUtils]: 13: Hoare triple {3797#(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~post11 < 20);havoc main_#t~post11;__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; {3797#(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:25:35,196 INFO L281 TraceCheckUtils]: 14: Hoare triple {3797#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {3797#(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:25:35,196 INFO L281 TraceCheckUtils]: 15: Hoare triple {3797#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~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; {3797#(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:25:35,197 INFO L281 TraceCheckUtils]: 16: Hoare triple {3797#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {3797#(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:25:35,197 INFO L281 TraceCheckUtils]: 17: Hoare triple {3797#(and (= ULTIMATE.start_main_~k~0 0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0))} __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; {3825#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:35,197 INFO L281 TraceCheckUtils]: 18: Hoare triple {3825#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {3766#false} is VALID [2021-09-13 14:25:35,198 INFO L281 TraceCheckUtils]: 19: Hoare triple {3766#false} assume !false; {3766#false} is VALID [2021-09-13 14:25:35,198 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:35,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:35,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:35,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225565902] [2021-09-13 14:25:35,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:35,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254044609] [2021-09-13 14:25:35,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254044609] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:35,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:35,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-13 14:25:35,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114719063] [2021-09-13 14:25:35,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:35,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,211 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:25:35,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 14:25:35,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 14:25:35,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:25:35,212 INFO L87 Difference]: Start difference. First operand 125 states and 165 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:35,689 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2021-09-13 14:25:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-13 14:25:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2021-09-13 14:25:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2021-09-13 14:25:35,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2021-09-13 14:25:35,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:35,752 INFO L225 Difference]: With dead ends: 145 [2021-09-13 14:25:35,752 INFO L226 Difference]: Without dead ends: 143 [2021-09-13 14:25:35,752 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 91.34ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:25:35,753 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 101.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.76ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.20ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:35,753 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 1.76ms Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 103.20ms Time] [2021-09-13 14:25:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-09-13 14:25:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2021-09-13 14:25:35,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:35,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 135 states, 130 states have (on average 1.353846153846154) internal successors, (176), 134 states have internal predecessors, (176), 0 states have call successors, (0), 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:35,930 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 135 states, 130 states have (on average 1.353846153846154) internal successors, (176), 134 states have internal predecessors, (176), 0 states have call successors, (0), 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:35,930 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 135 states, 130 states have (on average 1.353846153846154) internal successors, (176), 134 states have internal predecessors, (176), 0 states have call successors, (0), 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:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:35,932 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-09-13 14:25:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-09-13 14:25:35,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:35,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:35,933 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.353846153846154) internal successors, (176), 134 states have internal predecessors, (176), 0 states have call successors, (0), 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 143 states. [2021-09-13 14:25:35,933 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.353846153846154) internal successors, (176), 134 states have internal predecessors, (176), 0 states have call successors, (0), 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 143 states. [2021-09-13 14:25:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:35,935 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-09-13 14:25:35,935 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2021-09-13 14:25:35,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:35,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:35,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:35,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.353846153846154) internal successors, (176), 134 states have internal predecessors, (176), 0 states have call successors, (0), 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:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2021-09-13 14:25:35,937 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 20 [2021-09-13 14:25:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:35,937 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2021-09-13 14:25:35,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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:25:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2021-09-13 14:25:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:25:35,938 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:35,938 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:25:35,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-09-13 14:25:36,152 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:25:36,153 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1357932506, now seen corresponding path program 1 times [2021-09-13 14:25:36,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:36,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054263539] [2021-09-13 14:25:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:36,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:36,163 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:36,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426537531] [2021-09-13 14:25:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:36,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:36,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:36,168 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:25:36,170 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:25:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:36,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:25:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:36,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 0: Hoare triple {4497#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; {4497#true} is VALID [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 1: Hoare triple {4497#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {4497#true} is VALID [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 2: Hoare triple {4497#true} assume !(0 == assume_abort_if_not_~cond); {4497#true} is VALID [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 3: Hoare triple {4497#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; {4497#true} is VALID [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 4: Hoare triple {4497#true} assume !(0 == assume_abort_if_not_~cond); {4497#true} is VALID [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 5: Hoare triple {4497#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; {4497#true} is VALID [2021-09-13 14:25:36,364 INFO L281 TraceCheckUtils]: 6: Hoare triple {4497#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {4497#true} is VALID [2021-09-13 14:25:36,365 INFO L281 TraceCheckUtils]: 7: Hoare triple {4497#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {4497#true} is VALID [2021-09-13 14:25:36,365 INFO L281 TraceCheckUtils]: 8: Hoare triple {4497#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {4497#true} is VALID [2021-09-13 14:25:36,365 INFO L281 TraceCheckUtils]: 9: Hoare triple {4497#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {4497#true} is VALID [2021-09-13 14:25:36,365 INFO L281 TraceCheckUtils]: 10: Hoare triple {4497#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {4497#true} is VALID [2021-09-13 14:25:36,369 INFO L281 TraceCheckUtils]: 11: Hoare triple {4497#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,369 INFO L281 TraceCheckUtils]: 12: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,370 INFO L281 TraceCheckUtils]: 13: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,370 INFO L281 TraceCheckUtils]: 14: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,371 INFO L281 TraceCheckUtils]: 15: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~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; {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,371 INFO L281 TraceCheckUtils]: 16: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,372 INFO L281 TraceCheckUtils]: 17: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} __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; {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,372 INFO L281 TraceCheckUtils]: 18: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:25:36,372 INFO L281 TraceCheckUtils]: 19: Hoare triple {4535#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~d~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4560#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:36,373 INFO L281 TraceCheckUtils]: 20: Hoare triple {4560#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {4498#false} is VALID [2021-09-13 14:25:36,373 INFO L281 TraceCheckUtils]: 21: Hoare triple {4498#false} assume !false; {4498#false} is VALID [2021-09-13 14:25:36,373 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:36,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:36,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:36,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054263539] [2021-09-13 14:25:36,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:36,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426537531] [2021-09-13 14:25:36,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426537531] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:36,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:36,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:25:36,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133517250] [2021-09-13 14:25:36,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:36,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:36,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:36,387 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:25:36,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:25:36,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:25:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:25:36,388 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:36,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:36,922 INFO L93 Difference]: Finished difference Result 265 states and 358 transitions. [2021-09-13 14:25:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:25:36,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-09-13 14:25:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2021-09-13 14:25:36,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 94 transitions. [2021-09-13 14:25:36,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:36,980 INFO L225 Difference]: With dead ends: 265 [2021-09-13 14:25:36,981 INFO L226 Difference]: Without dead ends: 263 [2021-09-13 14:25:36,981 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.74ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:36,981 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.18ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.04ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:36,982 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 1.18ms Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 104.04ms Time] [2021-09-13 14:25:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-09-13 14:25:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 162. [2021-09-13 14:25:37,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:37,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 162 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 161 states have internal predecessors, (212), 0 states have call successors, (0), 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:37,270 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 162 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 161 states have internal predecessors, (212), 0 states have call successors, (0), 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:37,270 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 162 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 161 states have internal predecessors, (212), 0 states have call successors, (0), 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:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:37,274 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2021-09-13 14:25:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2021-09-13 14:25:37,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:37,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:37,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 161 states have internal predecessors, (212), 0 states have call successors, (0), 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 263 states. [2021-09-13 14:25:37,275 INFO L87 Difference]: Start difference. First operand has 162 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 161 states have internal predecessors, (212), 0 states have call successors, (0), 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 263 states. [2021-09-13 14:25:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:37,285 INFO L93 Difference]: Finished difference Result 263 states and 353 transitions. [2021-09-13 14:25:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 353 transitions. [2021-09-13 14:25:37,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:37,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:37,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:37,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 161 states have internal predecessors, (212), 0 states have call successors, (0), 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:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2021-09-13 14:25:37,289 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 22 [2021-09-13 14:25:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:37,289 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2021-09-13 14:25:37,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:25:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2021-09-13 14:25:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:25:37,290 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:37,290 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:37,309 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:25:37,496 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:25:37,497 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1235592658, now seen corresponding path program 1 times [2021-09-13 14:25:37,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:37,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569334830] [2021-09-13 14:25:37,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:37,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:37,519 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:37,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214854153] [2021-09-13 14:25:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:37,522 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:37,523 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:25:37,533 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:25:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:37,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 22 conjunts are in the unsatisfiable core [2021-09-13 14:25:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:37,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:38,039 INFO L281 TraceCheckUtils]: 0: Hoare triple {5666#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; {5666#true} is VALID [2021-09-13 14:25:38,040 INFO L281 TraceCheckUtils]: 1: Hoare triple {5666#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {5674#(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:25:38,041 INFO L281 TraceCheckUtils]: 2: Hoare triple {5674#(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); {5678#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:38,041 INFO L281 TraceCheckUtils]: 3: Hoare triple {5678#(<= 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; {5678#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:38,045 INFO L281 TraceCheckUtils]: 4: Hoare triple {5678#(<= 1 ULTIMATE.start_main_~x~0)} assume !(0 == assume_abort_if_not_~cond); {5678#(<= 1 ULTIMATE.start_main_~x~0)} is VALID [2021-09-13 14:25:38,045 INFO L281 TraceCheckUtils]: 5: Hoare triple {5678#(<= 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; {5688#(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:25:38,046 INFO L281 TraceCheckUtils]: 6: Hoare triple {5688#(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; {5688#(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:25:38,046 INFO L281 TraceCheckUtils]: 7: Hoare triple {5688#(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; {5688#(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:25:38,047 INFO L281 TraceCheckUtils]: 8: Hoare triple {5688#(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);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5688#(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:25:38,047 INFO L281 TraceCheckUtils]: 9: Hoare triple {5688#(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; {5688#(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:25:38,047 INFO L281 TraceCheckUtils]: 10: Hoare triple {5688#(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; {5688#(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:25:38,048 INFO L281 TraceCheckUtils]: 11: Hoare triple {5688#(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_~c~0 >= main_~b~0); {5688#(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:25:38,048 INFO L281 TraceCheckUtils]: 12: Hoare triple {5688#(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_~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; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,049 INFO L281 TraceCheckUtils]: 13: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,049 INFO L281 TraceCheckUtils]: 14: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,050 INFO L281 TraceCheckUtils]: 15: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,050 INFO L281 TraceCheckUtils]: 16: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,051 INFO L281 TraceCheckUtils]: 17: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,051 INFO L281 TraceCheckUtils]: 18: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,051 INFO L281 TraceCheckUtils]: 19: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:25:38,052 INFO L281 TraceCheckUtils]: 20: Hoare triple {5710#(and (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= ULTIMATE.start_main_~r~0 1) (<= 1 ULTIMATE.start_main_~x~0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {5735#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:38,052 INFO L281 TraceCheckUtils]: 21: Hoare triple {5735#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5667#false} is VALID [2021-09-13 14:25:38,052 INFO L281 TraceCheckUtils]: 22: Hoare triple {5667#false} assume !false; {5667#false} is VALID [2021-09-13 14:25:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:38,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:38,260 INFO L281 TraceCheckUtils]: 22: Hoare triple {5667#false} assume !false; {5667#false} is VALID [2021-09-13 14:25:38,261 INFO L281 TraceCheckUtils]: 21: Hoare triple {5735#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {5667#false} is VALID [2021-09-13 14:25:38,261 INFO L281 TraceCheckUtils]: 20: Hoare triple {5748#(= 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~post11 < 20);havoc main_#t~post11;__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; {5735#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:38,262 INFO L281 TraceCheckUtils]: 19: Hoare triple {5748#(= 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~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {5748#(= 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:25:38,262 INFO L281 TraceCheckUtils]: 18: Hoare triple {5748#(= 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);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {5748#(= 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:25:38,263 INFO L281 TraceCheckUtils]: 17: Hoare triple {5748#(= 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; {5748#(= 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:25:38,263 INFO L281 TraceCheckUtils]: 16: Hoare triple {5748#(= 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; {5748#(= 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:25:38,263 INFO L281 TraceCheckUtils]: 15: Hoare triple {5748#(= 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);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5748#(= 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:25:38,264 INFO L281 TraceCheckUtils]: 14: Hoare triple {5748#(= 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; {5748#(= 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:25:38,264 INFO L281 TraceCheckUtils]: 13: Hoare triple {5748#(= 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; {5748#(= 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:25:38,265 INFO L281 TraceCheckUtils]: 12: Hoare triple {5773#(= (+ (* 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; {5748#(= 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:25:38,265 INFO L281 TraceCheckUtils]: 11: Hoare triple {5773#(= (+ (* 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); {5773#(= (+ (* 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:25:38,265 INFO L281 TraceCheckUtils]: 10: Hoare triple {5773#(= (+ (* 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; {5773#(= (+ (* 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:25:38,266 INFO L281 TraceCheckUtils]: 9: Hoare triple {5773#(= (+ (* 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; {5773#(= (+ (* 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:25:38,266 INFO L281 TraceCheckUtils]: 8: Hoare triple {5773#(= (+ (* 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 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {5773#(= (+ (* 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:25:38,266 INFO L281 TraceCheckUtils]: 7: Hoare triple {5773#(= (+ (* 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~post9 < 20);havoc main_#t~post9; {5773#(= (+ (* 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:25:38,271 INFO L281 TraceCheckUtils]: 6: Hoare triple {5773#(= (+ (* 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~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {5773#(= (+ (* 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:25:38,272 INFO L281 TraceCheckUtils]: 5: Hoare triple {5666#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; {5773#(= (+ (* 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:25:38,272 INFO L281 TraceCheckUtils]: 4: Hoare triple {5666#true} assume !(0 == assume_abort_if_not_~cond); {5666#true} is VALID [2021-09-13 14:25:38,273 INFO L281 TraceCheckUtils]: 3: Hoare triple {5666#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; {5666#true} is VALID [2021-09-13 14:25:38,276 INFO L281 TraceCheckUtils]: 2: Hoare triple {5666#true} assume !(0 == assume_abort_if_not_~cond); {5666#true} is VALID [2021-09-13 14:25:38,278 INFO L281 TraceCheckUtils]: 1: Hoare triple {5666#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {5666#true} is VALID [2021-09-13 14:25:38,279 INFO L281 TraceCheckUtils]: 0: Hoare triple {5666#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; {5666#true} is VALID [2021-09-13 14:25:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:38,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:38,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569334830] [2021-09-13 14:25:38,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:38,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214854153] [2021-09-13 14:25:38,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214854153] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:38,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:38,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2021-09-13 14:25:38,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851638030] [2021-09-13 14:25:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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 23 [2021-09-13 14:25:38,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:38,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:38,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:38,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:25:38,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:25:38,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:25:38,310 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:39,195 INFO L93 Difference]: Finished difference Result 230 states and 299 transitions. [2021-09-13 14:25:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:25:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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 23 [2021-09-13 14:25:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2021-09-13 14:25:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2021-09-13 14:25:39,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 102 transitions. [2021-09-13 14:25:39,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:39,268 INFO L225 Difference]: With dead ends: 230 [2021-09-13 14:25:39,268 INFO L226 Difference]: Without dead ends: 228 [2021-09-13 14:25:39,269 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 113.17ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-09-13 14:25:39,269 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 230.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.76ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 232.83ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:39,270 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 374 Unknown, 0 Unchecked, 2.76ms Time], IncrementalHoareTripleChecker [9 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 232.83ms Time] [2021-09-13 14:25:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-09-13 14:25:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2021-09-13 14:25:39,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:39,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 212 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 211 states have internal predecessors, (284), 0 states have call successors, (0), 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:39,638 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 212 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 211 states have internal predecessors, (284), 0 states have call successors, (0), 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:39,638 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 212 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 211 states have internal predecessors, (284), 0 states have call successors, (0), 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:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:39,642 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2021-09-13 14:25:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-09-13 14:25:39,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:39,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:39,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 211 states have internal predecessors, (284), 0 states have call successors, (0), 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 228 states. [2021-09-13 14:25:39,644 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 211 states have internal predecessors, (284), 0 states have call successors, (0), 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 228 states. [2021-09-13 14:25:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:39,647 INFO L93 Difference]: Finished difference Result 228 states and 294 transitions. [2021-09-13 14:25:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2021-09-13 14:25:39,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:39,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:39,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:39,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 211 states have internal predecessors, (284), 0 states have call successors, (0), 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:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2021-09-13 14:25:39,651 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 23 [2021-09-13 14:25:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:39,651 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2021-09-13 14:25:39,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2021-09-13 14:25:39,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-13 14:25:39,653 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:39,653 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] [2021-09-13 14:25:39,673 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:25:39,869 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:25:39,869 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:39,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash 8471960, now seen corresponding path program 1 times [2021-09-13 14:25:39,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:39,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140212501] [2021-09-13 14:25:39,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:39,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:39,879 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:39,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576549717] [2021-09-13 14:25:39,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:39,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:39,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:39,888 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:25:39,889 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:25:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:39,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:25:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:39,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:40,079 INFO L281 TraceCheckUtils]: 0: Hoare triple {6873#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; {6878#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:40,080 INFO L281 TraceCheckUtils]: 1: Hoare triple {6878#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {6878#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:40,080 INFO L281 TraceCheckUtils]: 2: Hoare triple {6878#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {6878#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:40,081 INFO L281 TraceCheckUtils]: 3: Hoare triple {6878#(<= ~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; {6878#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:40,081 INFO L281 TraceCheckUtils]: 4: Hoare triple {6878#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {6878#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:40,081 INFO L281 TraceCheckUtils]: 5: Hoare triple {6878#(<= ~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; {6878#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:40,082 INFO L281 TraceCheckUtils]: 6: Hoare triple {6878#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6897#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:40,082 INFO L281 TraceCheckUtils]: 7: Hoare triple {6897#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {6897#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:40,083 INFO L281 TraceCheckUtils]: 8: Hoare triple {6897#(<= ~counter~0 1)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {6897#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:40,083 INFO L281 TraceCheckUtils]: 9: Hoare triple {6897#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:40,084 INFO L281 TraceCheckUtils]: 10: Hoare triple {6907#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {6907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:40,084 INFO L281 TraceCheckUtils]: 11: Hoare triple {6907#(<= ~counter~0 2)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {6907#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:40,085 INFO L281 TraceCheckUtils]: 12: Hoare triple {6907#(<= ~counter~0 2)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {6917#(<= |ULTIMATE.start_main_#t~post11| 2)} is VALID [2021-09-13 14:25:40,090 INFO L281 TraceCheckUtils]: 13: Hoare triple {6917#(<= |ULTIMATE.start_main_#t~post11| 2)} assume !(main_#t~post11 < 20);havoc main_#t~post11; {6874#false} is VALID [2021-09-13 14:25:40,090 INFO L281 TraceCheckUtils]: 14: Hoare triple {6874#false} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {6874#false} is VALID [2021-09-13 14:25:40,090 INFO L281 TraceCheckUtils]: 15: Hoare triple {6874#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {6874#false} is VALID [2021-09-13 14:25:40,090 INFO L281 TraceCheckUtils]: 16: Hoare triple {6874#false} assume !(main_#t~post10 < 20);havoc main_#t~post10; {6874#false} is VALID [2021-09-13 14:25:40,090 INFO L281 TraceCheckUtils]: 17: Hoare triple {6874#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; {6874#false} is VALID [2021-09-13 14:25:40,091 INFO L281 TraceCheckUtils]: 18: Hoare triple {6874#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {6874#false} is VALID [2021-09-13 14:25:40,091 INFO L281 TraceCheckUtils]: 19: Hoare triple {6874#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {6874#false} is VALID [2021-09-13 14:25:40,091 INFO L281 TraceCheckUtils]: 20: Hoare triple {6874#false} assume !(0 != main_~b~0); {6874#false} is VALID [2021-09-13 14:25:40,091 INFO L281 TraceCheckUtils]: 21: Hoare triple {6874#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {6874#false} is VALID [2021-09-13 14:25:40,091 INFO L281 TraceCheckUtils]: 22: Hoare triple {6874#false} assume 0 == __VERIFIER_assert_~cond; {6874#false} is VALID [2021-09-13 14:25:40,091 INFO L281 TraceCheckUtils]: 23: Hoare triple {6874#false} assume !false; {6874#false} is VALID [2021-09-13 14:25:40,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:40,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:40,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:40,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140212501] [2021-09-13 14:25:40,092 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:40,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576549717] [2021-09-13 14:25:40,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576549717] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:40,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:40,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:25:40,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605155099] [2021-09-13 14:25:40,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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 24 [2021-09-13 14:25:40,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:40,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:25:40,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:40,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:25:40,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:25:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:25:40,114 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:25:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:40,641 INFO L93 Difference]: Finished difference Result 308 states and 411 transitions. [2021-09-13 14:25:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:25:40,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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 24 [2021-09-13 14:25:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:25:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2021-09-13 14:25:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:25:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2021-09-13 14:25:40,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2021-09-13 14:25:40,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:40,701 INFO L225 Difference]: With dead ends: 308 [2021-09-13 14:25:40,701 INFO L226 Difference]: Without dead ends: 212 [2021-09-13 14:25:40,702 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 10.99ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:25:40,702 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.76ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.57ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:40,702 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.76ms Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 75.57ms Time] [2021-09-13 14:25:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-09-13 14:25:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2021-09-13 14:25:41,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:41,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 211 states have internal predecessors, (283), 0 states have call successors, (0), 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:41,081 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 211 states have internal predecessors, (283), 0 states have call successors, (0), 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:41,081 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 211 states have internal predecessors, (283), 0 states have call successors, (0), 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:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:41,084 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2021-09-13 14:25:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:25:41,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:41,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:41,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 211 states have internal predecessors, (283), 0 states have call successors, (0), 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 212 states. [2021-09-13 14:25:41,085 INFO L87 Difference]: Start difference. First operand has 212 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 211 states have internal predecessors, (283), 0 states have call successors, (0), 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 212 states. [2021-09-13 14:25:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:41,088 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2021-09-13 14:25:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:25:41,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:41,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:41,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:41,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 211 states have internal predecessors, (283), 0 states have call successors, (0), 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:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2021-09-13 14:25:41,092 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 24 [2021-09-13 14:25:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:41,092 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2021-09-13 14:25:41,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:25:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2021-09-13 14:25:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-09-13 14:25:41,093 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:41,093 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:41,110 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:25:41,310 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:25:41,310 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1993727605, now seen corresponding path program 1 times [2021-09-13 14:25:41,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:41,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037393773] [2021-09-13 14:25:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:41,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:41,316 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:41,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598447293] [2021-09-13 14:25:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:41,317 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:41,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:41,321 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:25:41,322 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:25:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:41,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2021-09-13 14:25:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:41,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:41,792 INFO L281 TraceCheckUtils]: 0: Hoare triple {8086#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; {8086#true} is VALID [2021-09-13 14:25:41,793 INFO L281 TraceCheckUtils]: 1: Hoare triple {8086#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {8086#true} is VALID [2021-09-13 14:25:41,793 INFO L281 TraceCheckUtils]: 2: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:25:41,793 INFO L281 TraceCheckUtils]: 3: Hoare triple {8086#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; {8086#true} is VALID [2021-09-13 14:25:41,793 INFO L281 TraceCheckUtils]: 4: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:25:41,793 INFO L281 TraceCheckUtils]: 5: Hoare triple {8086#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; {8106#(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))} is VALID [2021-09-13 14:25:41,794 INFO L281 TraceCheckUtils]: 6: Hoare triple {8106#(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))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8106#(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))} is VALID [2021-09-13 14:25:41,795 INFO L281 TraceCheckUtils]: 7: Hoare triple {8106#(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))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {8106#(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))} is VALID [2021-09-13 14:25:41,796 INFO L281 TraceCheckUtils]: 8: Hoare triple {8106#(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))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {8116#(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))} is VALID [2021-09-13 14:25:41,796 INFO L281 TraceCheckUtils]: 9: Hoare triple {8116#(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))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8116#(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))} is VALID [2021-09-13 14:25:41,796 INFO L281 TraceCheckUtils]: 10: Hoare triple {8116#(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))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {8116#(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))} is VALID [2021-09-13 14:25:41,797 INFO L281 TraceCheckUtils]: 11: Hoare triple {8116#(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))} assume !(main_~c~0 >= main_~b~0); {8116#(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))} is VALID [2021-09-13 14:25:41,797 INFO L281 TraceCheckUtils]: 12: Hoare triple {8116#(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))} 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; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,798 INFO L281 TraceCheckUtils]: 13: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,798 INFO L281 TraceCheckUtils]: 14: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,798 INFO L281 TraceCheckUtils]: 15: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,799 INFO L281 TraceCheckUtils]: 16: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,799 INFO L281 TraceCheckUtils]: 17: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,799 INFO L281 TraceCheckUtils]: 18: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,800 INFO L281 TraceCheckUtils]: 19: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,800 INFO L281 TraceCheckUtils]: 20: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,801 INFO L281 TraceCheckUtils]: 21: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} assume !(0 == __VERIFIER_assert_~cond); {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= ULTIMATE.start_main_~q~0 1))} is VALID [2021-09-13 14:25:41,801 INFO L281 TraceCheckUtils]: 22: Hoare triple {8129#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~s~0 0) (= 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; {8160#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:41,801 INFO L281 TraceCheckUtils]: 23: Hoare triple {8160#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {8087#false} is VALID [2021-09-13 14:25:41,801 INFO L281 TraceCheckUtils]: 24: Hoare triple {8087#false} assume !false; {8087#false} is VALID [2021-09-13 14:25:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:41,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:42,024 INFO L281 TraceCheckUtils]: 24: Hoare triple {8087#false} assume !false; {8087#false} is VALID [2021-09-13 14:25:42,025 INFO L281 TraceCheckUtils]: 23: Hoare triple {8160#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {8087#false} is VALID [2021-09-13 14:25:42,025 INFO L281 TraceCheckUtils]: 22: Hoare triple {8173#(= (+ (* 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; {8160#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:25:42,026 INFO L281 TraceCheckUtils]: 21: Hoare triple {8173#(= (+ (* 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); {8173#(= (+ (* 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:25:42,026 INFO L281 TraceCheckUtils]: 20: Hoare triple {8173#(= (+ (* 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~post11 < 20);havoc main_#t~post11;__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; {8173#(= (+ (* 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:25:42,026 INFO L281 TraceCheckUtils]: 19: Hoare triple {8173#(= (+ (* 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~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {8173#(= (+ (* 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:25:42,027 INFO L281 TraceCheckUtils]: 18: Hoare triple {8173#(= (+ (* 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);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {8173#(= (+ (* 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:25:42,027 INFO L281 TraceCheckUtils]: 17: Hoare triple {8173#(= (+ (* 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; {8173#(= (+ (* 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:25:42,027 INFO L281 TraceCheckUtils]: 16: Hoare triple {8173#(= (+ (* 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; {8173#(= (+ (* 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:25:42,027 INFO L281 TraceCheckUtils]: 15: Hoare triple {8173#(= (+ (* 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 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {8173#(= (+ (* 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:25:42,028 INFO L281 TraceCheckUtils]: 14: Hoare triple {8173#(= (+ (* 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~post9 < 20);havoc main_#t~post9; {8173#(= (+ (* 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:25:42,029 INFO L281 TraceCheckUtils]: 13: Hoare triple {8173#(= (+ (* 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~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {8173#(= (+ (* 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:25:43,198 INFO L281 TraceCheckUtils]: 12: Hoare triple {8204#(= (+ 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; {8173#(= (+ (* 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:25:43,201 INFO L281 TraceCheckUtils]: 11: Hoare triple {8204#(= (+ 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); {8204#(= (+ 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:25:43,201 INFO L281 TraceCheckUtils]: 10: Hoare triple {8204#(= (+ 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; {8204#(= (+ 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:25:43,201 INFO L281 TraceCheckUtils]: 9: Hoare triple {8204#(= (+ 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; {8204#(= (+ 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:25:43,202 INFO L281 TraceCheckUtils]: 8: Hoare triple {8217#(= 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);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {8204#(= (+ 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:25:43,202 INFO L281 TraceCheckUtils]: 7: Hoare triple {8217#(= 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; {8217#(= 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:25:43,202 INFO L281 TraceCheckUtils]: 6: Hoare triple {8217#(= 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; {8217#(= 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:25:43,203 INFO L281 TraceCheckUtils]: 5: Hoare triple {8086#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; {8217#(= 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:25:43,203 INFO L281 TraceCheckUtils]: 4: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:25:43,203 INFO L281 TraceCheckUtils]: 3: Hoare triple {8086#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; {8086#true} is VALID [2021-09-13 14:25:43,203 INFO L281 TraceCheckUtils]: 2: Hoare triple {8086#true} assume !(0 == assume_abort_if_not_~cond); {8086#true} is VALID [2021-09-13 14:25:43,203 INFO L281 TraceCheckUtils]: 1: Hoare triple {8086#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {8086#true} is VALID [2021-09-13 14:25:43,203 INFO L281 TraceCheckUtils]: 0: Hoare triple {8086#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; {8086#true} is VALID [2021-09-13 14:25:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:43,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:43,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037393773] [2021-09-13 14:25:43,204 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:43,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598447293] [2021-09-13 14:25:43,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598447293] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:43,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:43,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-09-13 14:25:43,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781961697] [2021-09-13 14:25:43,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2021-09-13 14:25:43,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:43,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:43,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:43,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:25:43,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:43,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:25:43,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:25:43,537 INFO L87 Difference]: Start difference. First operand 212 states and 283 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:45,872 INFO L93 Difference]: Finished difference Result 532 states and 707 transitions. [2021-09-13 14:25:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:25:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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 25 [2021-09-13 14:25:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 290 transitions. [2021-09-13 14:25:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 290 transitions. [2021-09-13 14:25:45,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 290 transitions. [2021-09-13 14:25:46,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:46,504 INFO L225 Difference]: With dead ends: 532 [2021-09-13 14:25:46,504 INFO L226 Difference]: Without dead ends: 526 [2021-09-13 14:25:46,505 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 304.68ms TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-09-13 14:25:46,505 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 397 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 610.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.15ms SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 614.70ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:46,505 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 5.15ms Time], IncrementalHoareTripleChecker [87 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 614.70ms Time] [2021-09-13 14:25:46,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-09-13 14:25:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 339. [2021-09-13 14:25:47,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:47,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 526 states. Second operand has 339 states, 334 states have (on average 1.377245508982036) internal successors, (460), 338 states have internal predecessors, (460), 0 states have call successors, (0), 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:47,101 INFO L74 IsIncluded]: Start isIncluded. First operand 526 states. Second operand has 339 states, 334 states have (on average 1.377245508982036) internal successors, (460), 338 states have internal predecessors, (460), 0 states have call successors, (0), 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:47,101 INFO L87 Difference]: Start difference. First operand 526 states. Second operand has 339 states, 334 states have (on average 1.377245508982036) internal successors, (460), 338 states have internal predecessors, (460), 0 states have call successors, (0), 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:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:47,111 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-09-13 14:25:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 676 transitions. [2021-09-13 14:25:47,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:47,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:47,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 334 states have (on average 1.377245508982036) internal successors, (460), 338 states have internal predecessors, (460), 0 states have call successors, (0), 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 526 states. [2021-09-13 14:25:47,113 INFO L87 Difference]: Start difference. First operand has 339 states, 334 states have (on average 1.377245508982036) internal successors, (460), 338 states have internal predecessors, (460), 0 states have call successors, (0), 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 526 states. [2021-09-13 14:25:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:47,123 INFO L93 Difference]: Finished difference Result 526 states and 676 transitions. [2021-09-13 14:25:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 676 transitions. [2021-09-13 14:25:47,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:47,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:47,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:47,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 334 states have (on average 1.377245508982036) internal successors, (460), 338 states have internal predecessors, (460), 0 states have call successors, (0), 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:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 460 transitions. [2021-09-13 14:25:47,130 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 460 transitions. Word has length 25 [2021-09-13 14:25:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:47,131 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 460 transitions. [2021-09-13 14:25:47,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 460 transitions. [2021-09-13 14:25:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-13 14:25:47,131 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:47,131 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:47,151 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:25:47,345 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:25:47,345 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:47,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:47,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1504234129, now seen corresponding path program 1 times [2021-09-13 14:25:47,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:47,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577615657] [2021-09-13 14:25:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:47,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:47,351 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:47,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1995293954] [2021-09-13 14:25:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:47,352 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:47,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:47,369 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:25:47,374 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:25:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:47,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:25:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:47,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:47,592 INFO L281 TraceCheckUtils]: 0: Hoare triple {10512#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; {10517#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:47,593 INFO L281 TraceCheckUtils]: 1: Hoare triple {10517#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {10517#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:47,593 INFO L281 TraceCheckUtils]: 2: Hoare triple {10517#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {10517#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:47,593 INFO L281 TraceCheckUtils]: 3: Hoare triple {10517#(<= ~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; {10517#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:47,597 INFO L281 TraceCheckUtils]: 4: Hoare triple {10517#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {10517#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:47,597 INFO L281 TraceCheckUtils]: 5: Hoare triple {10517#(<= ~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; {10517#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:47,598 INFO L281 TraceCheckUtils]: 6: Hoare triple {10517#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10536#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:47,598 INFO L281 TraceCheckUtils]: 7: Hoare triple {10536#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10536#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:47,599 INFO L281 TraceCheckUtils]: 8: Hoare triple {10536#(<= ~counter~0 1)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {10536#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:47,599 INFO L281 TraceCheckUtils]: 9: Hoare triple {10536#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10546#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:47,599 INFO L281 TraceCheckUtils]: 10: Hoare triple {10546#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {10546#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:47,600 INFO L281 TraceCheckUtils]: 11: Hoare triple {10546#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {10546#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:47,600 INFO L281 TraceCheckUtils]: 12: Hoare triple {10546#(<= ~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; {10546#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:47,600 INFO L281 TraceCheckUtils]: 13: Hoare triple {10546#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10559#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:47,601 INFO L281 TraceCheckUtils]: 14: Hoare triple {10559#(<= ~counter~0 3)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10559#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:47,601 INFO L281 TraceCheckUtils]: 15: Hoare triple {10559#(<= ~counter~0 3)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {10559#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:47,601 INFO L281 TraceCheckUtils]: 16: Hoare triple {10559#(<= ~counter~0 3)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10569#(<= |ULTIMATE.start_main_#t~post10| 3)} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 17: Hoare triple {10569#(<= |ULTIMATE.start_main_#t~post10| 3)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 18: Hoare triple {10513#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; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 19: Hoare triple {10513#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 20: Hoare triple {10513#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 21: Hoare triple {10513#false} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 22: Hoare triple {10513#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 23: Hoare triple {10513#false} assume !(main_#t~post10 < 20);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 24: Hoare triple {10513#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; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 25: Hoare triple {10513#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 26: Hoare triple {10513#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 27: Hoare triple {10513#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 28: Hoare triple {10513#false} assume 0 == __VERIFIER_assert_~cond; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L281 TraceCheckUtils]: 29: Hoare triple {10513#false} assume !false; {10513#false} is VALID [2021-09-13 14:25:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:25:47,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:47,789 INFO L281 TraceCheckUtils]: 29: Hoare triple {10513#false} assume !false; {10513#false} is VALID [2021-09-13 14:25:47,789 INFO L281 TraceCheckUtils]: 28: Hoare triple {10513#false} assume 0 == __VERIFIER_assert_~cond; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 27: Hoare triple {10513#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 26: Hoare triple {10513#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 25: Hoare triple {10513#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 24: Hoare triple {10513#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; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 23: Hoare triple {10513#false} assume !(main_#t~post10 < 20);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 22: Hoare triple {10513#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 21: Hoare triple {10513#false} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {10513#false} is VALID [2021-09-13 14:25:47,790 INFO L281 TraceCheckUtils]: 20: Hoare triple {10513#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,791 INFO L281 TraceCheckUtils]: 19: Hoare triple {10513#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10513#false} is VALID [2021-09-13 14:25:47,791 INFO L281 TraceCheckUtils]: 18: Hoare triple {10513#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; {10513#false} is VALID [2021-09-13 14:25:47,792 INFO L281 TraceCheckUtils]: 17: Hoare triple {10645#(< |ULTIMATE.start_main_#t~post10| 20)} assume !(main_#t~post10 < 20);havoc main_#t~post10; {10513#false} is VALID [2021-09-13 14:25:47,792 INFO L281 TraceCheckUtils]: 16: Hoare triple {10649#(< ~counter~0 20)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10645#(< |ULTIMATE.start_main_#t~post10| 20)} is VALID [2021-09-13 14:25:47,792 INFO L281 TraceCheckUtils]: 15: Hoare triple {10649#(< ~counter~0 20)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {10649#(< ~counter~0 20)} is VALID [2021-09-13 14:25:47,793 INFO L281 TraceCheckUtils]: 14: Hoare triple {10649#(< ~counter~0 20)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10649#(< ~counter~0 20)} is VALID [2021-09-13 14:25:47,793 INFO L281 TraceCheckUtils]: 13: Hoare triple {10659#(< ~counter~0 19)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10649#(< ~counter~0 20)} is VALID [2021-09-13 14:25:47,794 INFO L281 TraceCheckUtils]: 12: Hoare triple {10659#(< ~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; {10659#(< ~counter~0 19)} is VALID [2021-09-13 14:25:47,795 INFO L281 TraceCheckUtils]: 11: Hoare triple {10659#(< ~counter~0 19)} assume !(main_~c~0 >= main_~b~0); {10659#(< ~counter~0 19)} is VALID [2021-09-13 14:25:47,795 INFO L281 TraceCheckUtils]: 10: Hoare triple {10659#(< ~counter~0 19)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {10659#(< ~counter~0 19)} is VALID [2021-09-13 14:25:47,796 INFO L281 TraceCheckUtils]: 9: Hoare triple {10672#(< ~counter~0 18)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {10659#(< ~counter~0 19)} is VALID [2021-09-13 14:25:47,798 INFO L281 TraceCheckUtils]: 8: Hoare triple {10672#(< ~counter~0 18)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {10672#(< ~counter~0 18)} is VALID [2021-09-13 14:25:47,799 INFO L281 TraceCheckUtils]: 7: Hoare triple {10672#(< ~counter~0 18)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {10672#(< ~counter~0 18)} is VALID [2021-09-13 14:25:47,799 INFO L281 TraceCheckUtils]: 6: Hoare triple {10682#(< ~counter~0 17)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {10672#(< ~counter~0 18)} is VALID [2021-09-13 14:25:47,800 INFO L281 TraceCheckUtils]: 5: Hoare triple {10682#(< ~counter~0 17)} 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; {10682#(< ~counter~0 17)} is VALID [2021-09-13 14:25:47,800 INFO L281 TraceCheckUtils]: 4: Hoare triple {10682#(< ~counter~0 17)} assume !(0 == assume_abort_if_not_~cond); {10682#(< ~counter~0 17)} is VALID [2021-09-13 14:25:47,800 INFO L281 TraceCheckUtils]: 3: Hoare triple {10682#(< ~counter~0 17)} 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; {10682#(< ~counter~0 17)} is VALID [2021-09-13 14:25:47,800 INFO L281 TraceCheckUtils]: 2: Hoare triple {10682#(< ~counter~0 17)} assume !(0 == assume_abort_if_not_~cond); {10682#(< ~counter~0 17)} is VALID [2021-09-13 14:25:47,801 INFO L281 TraceCheckUtils]: 1: Hoare triple {10682#(< ~counter~0 17)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {10682#(< ~counter~0 17)} is VALID [2021-09-13 14:25:47,801 INFO L281 TraceCheckUtils]: 0: Hoare triple {10512#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; {10682#(< ~counter~0 17)} is VALID [2021-09-13 14:25:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:25:47,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:47,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577615657] [2021-09-13 14:25:47,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:47,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995293954] [2021-09-13 14:25:47,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995293954] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:47,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:47,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-09-13 14:25:47,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434796748] [2021-09-13 14:25:47,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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 30 [2021-09-13 14:25:47,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:47,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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:47,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:47,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:25:47,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:47,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:25:47,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:25:47,832 INFO L87 Difference]: Start difference. First operand 339 states and 460 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:49,656 INFO L93 Difference]: Finished difference Result 849 states and 1132 transitions. [2021-09-13 14:25:49,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-09-13 14:25:49,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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 30 [2021-09-13 14:25:49,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2021-09-13 14:25:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 218 transitions. [2021-09-13 14:25:49,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 218 transitions. [2021-09-13 14:25:49,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:49,800 INFO L225 Difference]: With dead ends: 849 [2021-09-13 14:25:49,801 INFO L226 Difference]: Without dead ends: 586 [2021-09-13 14:25:49,805 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 69.87ms TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-09-13 14:25:49,806 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 185 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 207.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.36ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 209.25ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:49,806 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 0 Invalid, 388 Unknown, 0 Unchecked, 2.36ms Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 209.25ms Time] [2021-09-13 14:25:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-09-13 14:25:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 532. [2021-09-13 14:25:50,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:50,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand has 532 states, 527 states have (on average 1.3358633776091082) internal successors, (704), 531 states have internal predecessors, (704), 0 states have call successors, (0), 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:50,929 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand has 532 states, 527 states have (on average 1.3358633776091082) internal successors, (704), 531 states have internal predecessors, (704), 0 states have call successors, (0), 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:50,929 INFO L87 Difference]: Start difference. First operand 586 states. Second operand has 532 states, 527 states have (on average 1.3358633776091082) internal successors, (704), 531 states have internal predecessors, (704), 0 states have call successors, (0), 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:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:50,941 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2021-09-13 14:25:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 751 transitions. [2021-09-13 14:25:50,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:50,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:50,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 527 states have (on average 1.3358633776091082) internal successors, (704), 531 states have internal predecessors, (704), 0 states have call successors, (0), 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 586 states. [2021-09-13 14:25:50,943 INFO L87 Difference]: Start difference. First operand has 532 states, 527 states have (on average 1.3358633776091082) internal successors, (704), 531 states have internal predecessors, (704), 0 states have call successors, (0), 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 586 states. [2021-09-13 14:25:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:50,954 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2021-09-13 14:25:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 751 transitions. [2021-09-13 14:25:50,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:50,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:50,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:50,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 527 states have (on average 1.3358633776091082) internal successors, (704), 531 states have internal predecessors, (704), 0 states have call successors, (0), 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:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 704 transitions. [2021-09-13 14:25:50,969 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 704 transitions. Word has length 30 [2021-09-13 14:25:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:50,969 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 704 transitions. [2021-09-13 14:25:50,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 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:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 704 transitions. [2021-09-13 14:25:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-09-13 14:25:50,970 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:50,970 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:50,996 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:25:51,176 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:25:51,177 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 685759340, now seen corresponding path program 1 times [2021-09-13 14:25:51,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:51,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145571169] [2021-09-13 14:25:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:51,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:51,183 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:51,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896587268] [2021-09-13 14:25:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:51,184 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:51,190 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:25:51,191 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:25:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:51,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2021-09-13 14:25:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:51,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:51,433 INFO L281 TraceCheckUtils]: 0: Hoare triple {13802#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; {13807#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:51,434 INFO L281 TraceCheckUtils]: 1: Hoare triple {13807#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {13807#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:51,434 INFO L281 TraceCheckUtils]: 2: Hoare triple {13807#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {13807#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:51,434 INFO L281 TraceCheckUtils]: 3: Hoare triple {13807#(<= ~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; {13807#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:51,435 INFO L281 TraceCheckUtils]: 4: Hoare triple {13807#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {13807#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:51,435 INFO L281 TraceCheckUtils]: 5: Hoare triple {13807#(<= ~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; {13807#(<= ~counter~0 0)} is VALID [2021-09-13 14:25:51,435 INFO L281 TraceCheckUtils]: 6: Hoare triple {13807#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13826#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:51,437 INFO L281 TraceCheckUtils]: 7: Hoare triple {13826#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {13826#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:51,437 INFO L281 TraceCheckUtils]: 8: Hoare triple {13826#(<= ~counter~0 1)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {13826#(<= ~counter~0 1)} is VALID [2021-09-13 14:25:51,437 INFO L281 TraceCheckUtils]: 9: Hoare triple {13826#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13836#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:51,438 INFO L281 TraceCheckUtils]: 10: Hoare triple {13836#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {13836#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:51,438 INFO L281 TraceCheckUtils]: 11: Hoare triple {13836#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {13836#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:51,438 INFO L281 TraceCheckUtils]: 12: Hoare triple {13836#(<= ~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; {13836#(<= ~counter~0 2)} is VALID [2021-09-13 14:25:51,438 INFO L281 TraceCheckUtils]: 13: Hoare triple {13836#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13849#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:51,439 INFO L281 TraceCheckUtils]: 14: Hoare triple {13849#(<= ~counter~0 3)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {13849#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:51,439 INFO L281 TraceCheckUtils]: 15: Hoare triple {13849#(<= ~counter~0 3)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {13849#(<= ~counter~0 3)} is VALID [2021-09-13 14:25:51,439 INFO L281 TraceCheckUtils]: 16: Hoare triple {13849#(<= ~counter~0 3)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13859#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:51,440 INFO L281 TraceCheckUtils]: 17: Hoare triple {13859#(<= ~counter~0 4)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {13859#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:51,440 INFO L281 TraceCheckUtils]: 18: Hoare triple {13859#(<= ~counter~0 4)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {13859#(<= ~counter~0 4)} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 19: Hoare triple {13859#(<= ~counter~0 4)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {13869#(<= |ULTIMATE.start_main_#t~post11| 4)} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 20: Hoare triple {13869#(<= |ULTIMATE.start_main_#t~post11| 4)} assume !(main_#t~post11 < 20);havoc main_#t~post11; {13803#false} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 21: Hoare triple {13803#false} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {13803#false} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 22: Hoare triple {13803#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13803#false} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 23: Hoare triple {13803#false} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {13803#false} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 24: Hoare triple {13803#false} assume !(main_~c~0 >= main_~b~0); {13803#false} is VALID [2021-09-13 14:25:51,447 INFO L281 TraceCheckUtils]: 25: Hoare triple {13803#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; {13803#false} is VALID [2021-09-13 14:25:51,448 INFO L281 TraceCheckUtils]: 26: Hoare triple {13803#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13803#false} is VALID [2021-09-13 14:25:51,448 INFO L281 TraceCheckUtils]: 27: Hoare triple {13803#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {13803#false} is VALID [2021-09-13 14:25:51,448 INFO L281 TraceCheckUtils]: 28: Hoare triple {13803#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13803#false} is VALID [2021-09-13 14:25:51,448 INFO L281 TraceCheckUtils]: 29: Hoare triple {13803#false} assume 0 == __VERIFIER_assert_~cond; {13803#false} is VALID [2021-09-13 14:25:51,448 INFO L281 TraceCheckUtils]: 30: Hoare triple {13803#false} assume !false; {13803#false} is VALID [2021-09-13 14:25:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:51,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 30: Hoare triple {13803#false} assume !false; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 29: Hoare triple {13803#false} assume 0 == __VERIFIER_assert_~cond; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 28: Hoare triple {13803#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 27: Hoare triple {13803#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 26: Hoare triple {13803#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 25: Hoare triple {13803#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; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 24: Hoare triple {13803#false} assume !(main_~c~0 >= main_~b~0); {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 23: Hoare triple {13803#false} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {13803#false} is VALID [2021-09-13 14:25:51,653 INFO L281 TraceCheckUtils]: 22: Hoare triple {13803#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13803#false} is VALID [2021-09-13 14:25:51,654 INFO L281 TraceCheckUtils]: 21: Hoare triple {13803#false} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {13803#false} is VALID [2021-09-13 14:25:51,657 INFO L281 TraceCheckUtils]: 20: Hoare triple {13933#(< |ULTIMATE.start_main_#t~post11| 20)} assume !(main_#t~post11 < 20);havoc main_#t~post11; {13803#false} is VALID [2021-09-13 14:25:51,657 INFO L281 TraceCheckUtils]: 19: Hoare triple {13937#(< ~counter~0 20)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {13933#(< |ULTIMATE.start_main_#t~post11| 20)} is VALID [2021-09-13 14:25:51,658 INFO L281 TraceCheckUtils]: 18: Hoare triple {13937#(< ~counter~0 20)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {13937#(< ~counter~0 20)} is VALID [2021-09-13 14:25:51,658 INFO L281 TraceCheckUtils]: 17: Hoare triple {13937#(< ~counter~0 20)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {13937#(< ~counter~0 20)} is VALID [2021-09-13 14:25:51,659 INFO L281 TraceCheckUtils]: 16: Hoare triple {13947#(< ~counter~0 19)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13937#(< ~counter~0 20)} is VALID [2021-09-13 14:25:51,659 INFO L281 TraceCheckUtils]: 15: Hoare triple {13947#(< ~counter~0 19)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {13947#(< ~counter~0 19)} is VALID [2021-09-13 14:25:51,659 INFO L281 TraceCheckUtils]: 14: Hoare triple {13947#(< ~counter~0 19)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {13947#(< ~counter~0 19)} is VALID [2021-09-13 14:25:51,660 INFO L281 TraceCheckUtils]: 13: Hoare triple {13957#(< ~counter~0 18)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13947#(< ~counter~0 19)} is VALID [2021-09-13 14:25:51,660 INFO L281 TraceCheckUtils]: 12: Hoare triple {13957#(< ~counter~0 18)} 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; {13957#(< ~counter~0 18)} is VALID [2021-09-13 14:25:51,661 INFO L281 TraceCheckUtils]: 11: Hoare triple {13957#(< ~counter~0 18)} assume !(main_~c~0 >= main_~b~0); {13957#(< ~counter~0 18)} is VALID [2021-09-13 14:25:51,661 INFO L281 TraceCheckUtils]: 10: Hoare triple {13957#(< ~counter~0 18)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {13957#(< ~counter~0 18)} is VALID [2021-09-13 14:25:51,661 INFO L281 TraceCheckUtils]: 9: Hoare triple {13970#(< ~counter~0 17)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {13957#(< ~counter~0 18)} is VALID [2021-09-13 14:25:51,662 INFO L281 TraceCheckUtils]: 8: Hoare triple {13970#(< ~counter~0 17)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {13970#(< ~counter~0 17)} is VALID [2021-09-13 14:25:51,662 INFO L281 TraceCheckUtils]: 7: Hoare triple {13970#(< ~counter~0 17)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {13970#(< ~counter~0 17)} is VALID [2021-09-13 14:25:51,663 INFO L281 TraceCheckUtils]: 6: Hoare triple {13980#(< ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {13970#(< ~counter~0 17)} is VALID [2021-09-13 14:25:51,663 INFO L281 TraceCheckUtils]: 5: Hoare triple {13980#(< ~counter~0 16)} 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; {13980#(< ~counter~0 16)} is VALID [2021-09-13 14:25:51,663 INFO L281 TraceCheckUtils]: 4: Hoare triple {13980#(< ~counter~0 16)} assume !(0 == assume_abort_if_not_~cond); {13980#(< ~counter~0 16)} is VALID [2021-09-13 14:25:51,664 INFO L281 TraceCheckUtils]: 3: Hoare triple {13980#(< ~counter~0 16)} 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; {13980#(< ~counter~0 16)} is VALID [2021-09-13 14:25:51,664 INFO L281 TraceCheckUtils]: 2: Hoare triple {13980#(< ~counter~0 16)} assume !(0 == assume_abort_if_not_~cond); {13980#(< ~counter~0 16)} is VALID [2021-09-13 14:25:51,664 INFO L281 TraceCheckUtils]: 1: Hoare triple {13980#(< ~counter~0 16)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {13980#(< ~counter~0 16)} is VALID [2021-09-13 14:25:51,665 INFO L281 TraceCheckUtils]: 0: Hoare triple {13802#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; {13980#(< ~counter~0 16)} is VALID [2021-09-13 14:25:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:25:51,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:51,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145571169] [2021-09-13 14:25:51,666 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:51,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896587268] [2021-09-13 14:25:51,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896587268] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:25:51,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:25:51,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-09-13 14:25:51,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69840720] [2021-09-13 14:25:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:25:51,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:51,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:51,702 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:25:51,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 14:25:51,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 14:25:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:25:51,702 INFO L87 Difference]: Start difference. First operand 532 states and 704 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:54,101 INFO L93 Difference]: Finished difference Result 1205 states and 1584 transitions. [2021-09-13 14:25:54,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-09-13 14:25:54,101 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:25:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2021-09-13 14:25:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2021-09-13 14:25:54,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 281 transitions. [2021-09-13 14:25:54,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:54,337 INFO L225 Difference]: With dead ends: 1205 [2021-09-13 14:25:54,337 INFO L226 Difference]: Without dead ends: 876 [2021-09-13 14:25:54,339 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 94.95ms TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2021-09-13 14:25:54,340 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 246.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.08ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 247.92ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:54,340 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 456 Unknown, 0 Unchecked, 2.08ms Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 247.92ms Time] [2021-09-13 14:25:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-09-13 14:25:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 777. [2021-09-13 14:25:56,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:25:56,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 876 states. Second operand has 777 states, 772 states have (on average 1.2979274611398963) internal successors, (1002), 776 states have internal predecessors, (1002), 0 states have call successors, (0), 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:56,065 INFO L74 IsIncluded]: Start isIncluded. First operand 876 states. Second operand has 777 states, 772 states have (on average 1.2979274611398963) internal successors, (1002), 776 states have internal predecessors, (1002), 0 states have call successors, (0), 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:56,066 INFO L87 Difference]: Start difference. First operand 876 states. Second operand has 777 states, 772 states have (on average 1.2979274611398963) internal successors, (1002), 776 states have internal predecessors, (1002), 0 states have call successors, (0), 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:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,089 INFO L93 Difference]: Finished difference Result 876 states and 1091 transitions. [2021-09-13 14:25:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1091 transitions. [2021-09-13 14:25:56,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 772 states have (on average 1.2979274611398963) internal successors, (1002), 776 states have internal predecessors, (1002), 0 states have call successors, (0), 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 876 states. [2021-09-13 14:25:56,092 INFO L87 Difference]: Start difference. First operand has 777 states, 772 states have (on average 1.2979274611398963) internal successors, (1002), 776 states have internal predecessors, (1002), 0 states have call successors, (0), 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 876 states. [2021-09-13 14:25:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:56,118 INFO L93 Difference]: Finished difference Result 876 states and 1091 transitions. [2021-09-13 14:25:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1091 transitions. [2021-09-13 14:25:56,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:25:56,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:25:56,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:25:56,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:25:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 772 states have (on average 1.2979274611398963) internal successors, (1002), 776 states have internal predecessors, (1002), 0 states have call successors, (0), 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:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1002 transitions. [2021-09-13 14:25:56,163 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1002 transitions. Word has length 31 [2021-09-13 14:25:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:25:56,164 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1002 transitions. [2021-09-13 14:25:56,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1002 transitions. [2021-09-13 14:25:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:25:56,165 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:25:56,165 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:25:56,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-09-13 14:25:56,380 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:25:56,381 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:25:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:25:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 13971671, now seen corresponding path program 2 times [2021-09-13 14:25:56,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:25:56,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938706664] [2021-09-13 14:25:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:25:56,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:25:56,389 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:25:56,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787016361] [2021-09-13 14:25:56,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:25:56,390 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:25:56,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:25:56,393 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:25:56,397 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:25:56,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-09-13 14:25:56,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:25:56,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:25:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:25:56,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:25:56,553 INFO L281 TraceCheckUtils]: 0: Hoare triple {18529#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; {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 1: Hoare triple {18529#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 2: Hoare triple {18529#true} assume !(0 == assume_abort_if_not_~cond); {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 3: Hoare triple {18529#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; {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 4: Hoare triple {18529#true} assume !(0 == assume_abort_if_not_~cond); {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 5: Hoare triple {18529#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; {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 6: Hoare triple {18529#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 7: Hoare triple {18529#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18529#true} is VALID [2021-09-13 14:25:56,554 INFO L281 TraceCheckUtils]: 8: Hoare triple {18529#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18529#true} is VALID [2021-09-13 14:25:56,555 INFO L281 TraceCheckUtils]: 9: Hoare triple {18529#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18529#true} is VALID [2021-09-13 14:25:56,555 INFO L281 TraceCheckUtils]: 10: Hoare triple {18529#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {18529#true} is VALID [2021-09-13 14:25:56,555 INFO L281 TraceCheckUtils]: 11: Hoare triple {18529#true} assume !(main_~c~0 >= main_~b~0); {18567#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:25:56,556 INFO L281 TraceCheckUtils]: 12: Hoare triple {18567#(< 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; {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:56,556 INFO L281 TraceCheckUtils]: 13: Hoare triple {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:56,556 INFO L281 TraceCheckUtils]: 14: Hoare triple {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} is VALID [2021-09-13 14:25:56,557 INFO L281 TraceCheckUtils]: 15: Hoare triple {18571#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~a~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:56,557 INFO L281 TraceCheckUtils]: 16: Hoare triple {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:56,557 INFO L281 TraceCheckUtils]: 17: Hoare triple {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} is VALID [2021-09-13 14:25:56,558 INFO L281 TraceCheckUtils]: 18: Hoare triple {18581#(< ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~c~0)} assume !(main_~c~0 >= main_~b~0); {18530#false} is VALID [2021-09-13 14:25:56,558 INFO L281 TraceCheckUtils]: 19: Hoare triple {18530#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; {18530#false} is VALID [2021-09-13 14:25:56,558 INFO L281 TraceCheckUtils]: 20: Hoare triple {18530#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18530#false} is VALID [2021-09-13 14:25:56,558 INFO L281 TraceCheckUtils]: 21: Hoare triple {18530#false} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {18530#false} is VALID [2021-09-13 14:25:56,558 INFO L281 TraceCheckUtils]: 22: Hoare triple {18530#false} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 23: Hoare triple {18530#false} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 24: Hoare triple {18530#false} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 25: Hoare triple {18530#false} assume !(main_~c~0 >= main_~b~0); {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 26: Hoare triple {18530#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; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 27: Hoare triple {18530#false} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 28: Hoare triple {18530#false} assume !(main_#t~post9 < 20);havoc main_#t~post9; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 29: Hoare triple {18530#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {18530#false} is VALID [2021-09-13 14:25:56,559 INFO L281 TraceCheckUtils]: 30: Hoare triple {18530#false} assume 0 == __VERIFIER_assert_~cond; {18530#false} is VALID [2021-09-13 14:25:56,560 INFO L281 TraceCheckUtils]: 31: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2021-09-13 14:25:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-09-13 14:25:56,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:25:56,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:25:56,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938706664] [2021-09-13 14:25:56,560 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:25:56,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787016361] [2021-09-13 14:25:56,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787016361] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:25:56,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:25:56,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:25:56,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109568832] [2021-09-13 14:25:56,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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:25:56,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:25:56,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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:56,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:56,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:25:56,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:25:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:25:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:25:56,583 INFO L87 Difference]: Start difference. First operand 777 states and 1002 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:25:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:25:59,124 INFO L93 Difference]: Finished difference Result 1430 states and 1901 transitions. [2021-09-13 14:25:59,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:25:59,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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:25:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:25:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2021-09-13 14:25:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2021-09-13 14:25:59,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2021-09-13 14:25:59,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:25:59,254 INFO L225 Difference]: With dead ends: 1430 [2021-09-13 14:25:59,254 INFO L226 Difference]: Without dead ends: 1068 [2021-09-13 14:25:59,254 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.38ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:25:59,255 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 143.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 144.30ms IncrementalHoareTripleChecker+Time [2021-09-13 14:25:59,255 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 144.30ms Time] [2021-09-13 14:25:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-09-13 14:26:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 747. [2021-09-13 14:26:00,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:00,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1068 states. Second operand has 747 states, 742 states have (on average 1.303234501347709) internal successors, (967), 746 states have internal predecessors, (967), 0 states have call successors, (0), 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:26:00,999 INFO L74 IsIncluded]: Start isIncluded. First operand 1068 states. Second operand has 747 states, 742 states have (on average 1.303234501347709) internal successors, (967), 746 states have internal predecessors, (967), 0 states have call successors, (0), 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:26:00,999 INFO L87 Difference]: Start difference. First operand 1068 states. Second operand has 747 states, 742 states have (on average 1.303234501347709) internal successors, (967), 746 states have internal predecessors, (967), 0 states have call successors, (0), 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:26:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:01,043 INFO L93 Difference]: Finished difference Result 1068 states and 1400 transitions. [2021-09-13 14:26:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2021-09-13 14:26:01,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:01,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:01,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 747 states, 742 states have (on average 1.303234501347709) internal successors, (967), 746 states have internal predecessors, (967), 0 states have call successors, (0), 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 1068 states. [2021-09-13 14:26:01,046 INFO L87 Difference]: Start difference. First operand has 747 states, 742 states have (on average 1.303234501347709) internal successors, (967), 746 states have internal predecessors, (967), 0 states have call successors, (0), 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 1068 states. [2021-09-13 14:26:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:01,078 INFO L93 Difference]: Finished difference Result 1068 states and 1400 transitions. [2021-09-13 14:26:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1400 transitions. [2021-09-13 14:26:01,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:01,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:01,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:01,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 742 states have (on average 1.303234501347709) internal successors, (967), 746 states have internal predecessors, (967), 0 states have call successors, (0), 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:26:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 967 transitions. [2021-09-13 14:26:01,102 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 967 transitions. Word has length 32 [2021-09-13 14:26:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:01,102 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 967 transitions. [2021-09-13 14:26:01,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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:26:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 967 transitions. [2021-09-13 14:26:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-09-13 14:26:01,102 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:01,103 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:01,125 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:26:01,313 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:26:01,313 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1302269029, now seen corresponding path program 1 times [2021-09-13 14:26:01,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:01,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955909862] [2021-09-13 14:26:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:01,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:01,319 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:01,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375446056] [2021-09-13 14:26:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:01,320 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:01,324 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:26:01,325 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:26:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:01,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2021-09-13 14:26:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:01,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:01,784 INFO L281 TraceCheckUtils]: 0: Hoare triple {23817#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; {23817#true} is VALID [2021-09-13 14:26:01,785 INFO L281 TraceCheckUtils]: 1: Hoare triple {23817#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {23817#true} is VALID [2021-09-13 14:26:01,785 INFO L281 TraceCheckUtils]: 2: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:26:01,785 INFO L281 TraceCheckUtils]: 3: Hoare triple {23817#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; {23831#(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:26:01,786 INFO L281 TraceCheckUtils]: 4: Hoare triple {23831#(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); {23835#(<= 1 ULTIMATE.start_main_~y~0)} is VALID [2021-09-13 14:26:01,786 INFO L281 TraceCheckUtils]: 5: Hoare triple {23835#(<= 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; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:01,787 INFO L281 TraceCheckUtils]: 6: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:01,787 INFO L281 TraceCheckUtils]: 7: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:01,787 INFO L281 TraceCheckUtils]: 8: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:01,788 INFO L281 TraceCheckUtils]: 9: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:01,788 INFO L281 TraceCheckUtils]: 10: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {23839#(<= 1 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:01,788 INFO L281 TraceCheckUtils]: 11: Hoare triple {23839#(<= 1 ULTIMATE.start_main_~b~0)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,789 INFO L281 TraceCheckUtils]: 12: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,789 INFO L281 TraceCheckUtils]: 13: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,790 INFO L281 TraceCheckUtils]: 14: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,790 INFO L281 TraceCheckUtils]: 15: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~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; {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,790 INFO L281 TraceCheckUtils]: 16: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,791 INFO L281 TraceCheckUtils]: 17: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} __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; {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,791 INFO L281 TraceCheckUtils]: 18: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,791 INFO L281 TraceCheckUtils]: 19: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,792 INFO L281 TraceCheckUtils]: 20: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} assume !(0 == __VERIFIER_assert_~cond); {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} is VALID [2021-09-13 14:26:01,792 INFO L281 TraceCheckUtils]: 21: Hoare triple {23858#(and (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (<= 1 ULTIMATE.start_main_~b~0) (= ULTIMATE.start_main_~d~0 1))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,793 INFO L281 TraceCheckUtils]: 22: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,793 INFO L281 TraceCheckUtils]: 23: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,793 INFO L281 TraceCheckUtils]: 24: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} assume !(0 == __VERIFIER_assert_~cond); {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,794 INFO L281 TraceCheckUtils]: 25: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 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; {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,794 INFO L281 TraceCheckUtils]: 26: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} assume !(0 == __VERIFIER_assert_~cond); {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,794 INFO L281 TraceCheckUtils]: 27: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} __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; {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,795 INFO L281 TraceCheckUtils]: 28: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} assume !(0 == __VERIFIER_assert_~cond); {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:26:01,795 INFO L281 TraceCheckUtils]: 29: Hoare triple {23889#(and (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~d~0 2) (<= 1 ULTIMATE.start_main_~b~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23914#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:01,795 INFO L281 TraceCheckUtils]: 30: Hoare triple {23914#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {23818#false} is VALID [2021-09-13 14:26:01,795 INFO L281 TraceCheckUtils]: 31: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2021-09-13 14:26:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:01,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:01,993 INFO L281 TraceCheckUtils]: 31: Hoare triple {23818#false} assume !false; {23818#false} is VALID [2021-09-13 14:26:01,994 INFO L281 TraceCheckUtils]: 30: Hoare triple {23914#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {23818#false} is VALID [2021-09-13 14:26:01,994 INFO L281 TraceCheckUtils]: 29: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23914#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:01,994 INFO L281 TraceCheckUtils]: 28: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:01,995 INFO L281 TraceCheckUtils]: 27: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __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; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:01,995 INFO L281 TraceCheckUtils]: 26: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:01,996 INFO L281 TraceCheckUtils]: 25: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~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; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:01,996 INFO L281 TraceCheckUtils]: 24: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:01,998 INFO L281 TraceCheckUtils]: 23: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:01,998 INFO L281 TraceCheckUtils]: 22: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,000 INFO L281 TraceCheckUtils]: 21: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,000 INFO L281 TraceCheckUtils]: 20: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,001 INFO L281 TraceCheckUtils]: 19: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,001 INFO L281 TraceCheckUtils]: 18: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,001 INFO L281 TraceCheckUtils]: 17: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __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; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,001 INFO L281 TraceCheckUtils]: 16: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,002 INFO L281 TraceCheckUtils]: 15: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~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; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,008 INFO L281 TraceCheckUtils]: 14: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0 == __VERIFIER_assert_~cond); {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,009 INFO L281 TraceCheckUtils]: 13: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,009 INFO L281 TraceCheckUtils]: 12: Hoare triple {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 11: Hoare triple {23817#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {23927#(= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 10: Hoare triple {23817#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {23817#true} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 9: Hoare triple {23817#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {23817#true} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 8: Hoare triple {23817#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {23817#true} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 7: Hoare triple {23817#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {23817#true} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 6: Hoare triple {23817#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {23817#true} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 5: Hoare triple {23817#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; {23817#true} is VALID [2021-09-13 14:26:02,010 INFO L281 TraceCheckUtils]: 4: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:26:02,011 INFO L281 TraceCheckUtils]: 3: Hoare triple {23817#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; {23817#true} is VALID [2021-09-13 14:26:02,011 INFO L281 TraceCheckUtils]: 2: Hoare triple {23817#true} assume !(0 == assume_abort_if_not_~cond); {23817#true} is VALID [2021-09-13 14:26:02,011 INFO L281 TraceCheckUtils]: 1: Hoare triple {23817#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {23817#true} is VALID [2021-09-13 14:26:02,011 INFO L281 TraceCheckUtils]: 0: Hoare triple {23817#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; {23817#true} is VALID [2021-09-13 14:26:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-09-13 14:26:02,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:02,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955909862] [2021-09-13 14:26:02,012 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:02,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375446056] [2021-09-13 14:26:02,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375446056] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:02,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:02,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 9 [2021-09-13 14:26:02,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787378682] [2021-09-13 14:26:02,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:02,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:02,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:02,050 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:26:02,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:26:02,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:26:02,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:26:02,051 INFO L87 Difference]: Start difference. First operand 747 states and 967 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:04,829 INFO L93 Difference]: Finished difference Result 866 states and 1122 transitions. [2021-09-13 14:26:04,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-09-13 14:26:04,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2021-09-13 14:26:04,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2021-09-13 14:26:04,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 130 transitions. [2021-09-13 14:26:04,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:04,958 INFO L225 Difference]: With dead ends: 866 [2021-09-13 14:26:04,958 INFO L226 Difference]: Without dead ends: 864 [2021-09-13 14:26:04,958 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 240.19ms TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:26:04,959 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 198 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 203.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.78ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 204.84ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:04,959 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 1.78ms Time], IncrementalHoareTripleChecker [21 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 204.84ms Time] [2021-09-13 14:26:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2021-09-13 14:26:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 595. [2021-09-13 14:26:06,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:06,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 864 states. Second operand has 595 states, 591 states have (on average 1.27580372250423) internal successors, (754), 594 states have internal predecessors, (754), 0 states have call successors, (0), 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:26:06,418 INFO L74 IsIncluded]: Start isIncluded. First operand 864 states. Second operand has 595 states, 591 states have (on average 1.27580372250423) internal successors, (754), 594 states have internal predecessors, (754), 0 states have call successors, (0), 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:26:06,418 INFO L87 Difference]: Start difference. First operand 864 states. Second operand has 595 states, 591 states have (on average 1.27580372250423) internal successors, (754), 594 states have internal predecessors, (754), 0 states have call successors, (0), 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:26:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:06,441 INFO L93 Difference]: Finished difference Result 864 states and 1089 transitions. [2021-09-13 14:26:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2021-09-13 14:26:06,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:06,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:06,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 591 states have (on average 1.27580372250423) internal successors, (754), 594 states have internal predecessors, (754), 0 states have call successors, (0), 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 864 states. [2021-09-13 14:26:06,443 INFO L87 Difference]: Start difference. First operand has 595 states, 591 states have (on average 1.27580372250423) internal successors, (754), 594 states have internal predecessors, (754), 0 states have call successors, (0), 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 864 states. [2021-09-13 14:26:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:06,465 INFO L93 Difference]: Finished difference Result 864 states and 1089 transitions. [2021-09-13 14:26:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1089 transitions. [2021-09-13 14:26:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:06,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:06,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:06,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 591 states have (on average 1.27580372250423) internal successors, (754), 594 states have internal predecessors, (754), 0 states have call successors, (0), 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:26:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 754 transitions. [2021-09-13 14:26:06,480 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 754 transitions. Word has length 32 [2021-09-13 14:26:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:06,480 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 754 transitions. [2021-09-13 14:26:06,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 754 transitions. [2021-09-13 14:26:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-09-13 14:26:06,480 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:06,481 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:06,497 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:26:06,688 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:26:06,688 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash 885134474, now seen corresponding path program 1 times [2021-09-13 14:26:06,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:06,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082790860] [2021-09-13 14:26:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:06,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:06,694 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:06,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [193797045] [2021-09-13 14:26:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:06,694 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:06,696 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:26:06,697 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:26:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:06,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2021-09-13 14:26:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:06,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:07,890 INFO L281 TraceCheckUtils]: 0: Hoare triple {27810#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; {27810#true} is VALID [2021-09-13 14:26:07,890 INFO L281 TraceCheckUtils]: 1: Hoare triple {27810#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {27810#true} is VALID [2021-09-13 14:26:07,890 INFO L281 TraceCheckUtils]: 2: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:07,890 INFO L281 TraceCheckUtils]: 3: Hoare triple {27810#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; {27810#true} is VALID [2021-09-13 14:26:07,890 INFO L281 TraceCheckUtils]: 4: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:07,891 INFO L281 TraceCheckUtils]: 5: Hoare triple {27810#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; {27830#(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:26:07,891 INFO L281 TraceCheckUtils]: 6: Hoare triple {27830#(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; {27830#(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:26:07,891 INFO L281 TraceCheckUtils]: 7: Hoare triple {27830#(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; {27830#(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:26:07,892 INFO L281 TraceCheckUtils]: 8: Hoare triple {27830#(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);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {27840#(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:26:07,892 INFO L281 TraceCheckUtils]: 9: Hoare triple {27840#(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; {27840#(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:26:07,893 INFO L281 TraceCheckUtils]: 10: Hoare triple {27840#(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; {27840#(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:26:07,893 INFO L281 TraceCheckUtils]: 11: Hoare triple {27840#(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);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {27850#(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_~v~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_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,894 INFO L281 TraceCheckUtils]: 12: Hoare triple {27850#(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_~v~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_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {27850#(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_~v~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_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,894 INFO L281 TraceCheckUtils]: 13: Hoare triple {27850#(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_~v~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_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {27857#(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_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,894 INFO L281 TraceCheckUtils]: 14: Hoare triple {27857#(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_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,895 INFO L281 TraceCheckUtils]: 15: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= 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; {27857#(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_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,897 INFO L281 TraceCheckUtils]: 16: Hoare triple {27857#(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_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,897 INFO L281 TraceCheckUtils]: 17: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= 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_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,898 INFO L281 TraceCheckUtils]: 18: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,898 INFO L281 TraceCheckUtils]: 19: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,898 INFO L281 TraceCheckUtils]: 20: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,899 INFO L281 TraceCheckUtils]: 21: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= 2 * main_~v~0); {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:26:07,900 INFO L281 TraceCheckUtils]: 22: Hoare triple {27861#(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_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~r~0 0) (= ULTIMATE.start_main_~d~0 1) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {27886#(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:26:07,900 INFO L281 TraceCheckUtils]: 23: Hoare triple {27886#(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))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {27886#(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:26:07,900 INFO L281 TraceCheckUtils]: 24: Hoare triple {27886#(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))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {27886#(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:26:07,901 INFO L281 TraceCheckUtils]: 25: Hoare triple {27886#(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))} assume !(main_~c~0 >= main_~b~0); {27886#(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:26:07,901 INFO L281 TraceCheckUtils]: 26: Hoare triple {27886#(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))} 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; {27899#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:26:07,902 INFO L281 TraceCheckUtils]: 27: Hoare triple {27899#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~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; {27899#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:26:07,902 INFO L281 TraceCheckUtils]: 28: Hoare triple {27899#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~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; {27899#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:26:07,904 INFO L281 TraceCheckUtils]: 29: Hoare triple {27899#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~x~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0)))} assume !(0 != main_~b~0); {27909#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} is VALID [2021-09-13 14:26:07,904 INFO L281 TraceCheckUtils]: 30: Hoare triple {27909#(and (= (+ ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~p~0) 1) (= ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~p~0 0) (= (+ ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~r~0) 0) (= ULTIMATE.start_main_~r~0 1) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27913#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:07,905 INFO L281 TraceCheckUtils]: 31: Hoare triple {27913#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {27811#false} is VALID [2021-09-13 14:26:07,905 INFO L281 TraceCheckUtils]: 32: Hoare triple {27811#false} assume !false; {27811#false} is VALID [2021-09-13 14:26:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:07,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:08,810 INFO L281 TraceCheckUtils]: 32: Hoare triple {27811#false} assume !false; {27811#false} is VALID [2021-09-13 14:26:08,810 INFO L281 TraceCheckUtils]: 31: Hoare triple {27913#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {27811#false} is VALID [2021-09-13 14:26:08,811 INFO L281 TraceCheckUtils]: 30: Hoare triple {27926#(= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)))} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27913#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:08,811 INFO L281 TraceCheckUtils]: 29: Hoare triple {27930#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 != main_~b~0); {27926#(= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:26:08,811 INFO L281 TraceCheckUtils]: 28: Hoare triple {27930#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {27930#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:08,812 INFO L281 TraceCheckUtils]: 27: Hoare triple {27930#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {27930#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:09,820 INFO L281 TraceCheckUtils]: 26: Hoare triple {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} 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; {27930#(or (= (+ (* ULTIMATE.start_main_~r~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~p~0 ULTIMATE.start_main_~x~0)) (+ ULTIMATE.start_main_~a~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0) (* ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~0))) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:09,820 INFO L281 TraceCheckUtils]: 25: Hoare triple {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} assume !(main_~c~0 >= main_~b~0); {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} is VALID [2021-09-13 14:26:09,821 INFO L281 TraceCheckUtils]: 24: Hoare triple {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} is VALID [2021-09-13 14:26:09,821 INFO L281 TraceCheckUtils]: 23: Hoare triple {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} is VALID [2021-09-13 14:26:09,855 INFO L281 TraceCheckUtils]: 22: Hoare triple {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {27940#(or (not (= ULTIMATE.start_main_~c~0 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)) (+ 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))))} is VALID [2021-09-13 14:26:09,855 INFO L281 TraceCheckUtils]: 21: Hoare triple {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(main_~c~0 >= 2 * main_~v~0); {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,856 INFO L281 TraceCheckUtils]: 20: Hoare triple {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,856 INFO L281 TraceCheckUtils]: 19: Hoare triple {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,856 INFO L281 TraceCheckUtils]: 18: Hoare triple {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,856 INFO L281 TraceCheckUtils]: 17: Hoare triple {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} __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; {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,857 INFO L281 TraceCheckUtils]: 16: Hoare triple {27972#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {27953#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,857 INFO L281 TraceCheckUtils]: 15: Hoare triple {27976#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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_~v~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; {27972#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,858 INFO L281 TraceCheckUtils]: 14: Hoare triple {27980#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {27976#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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_~v~0)))} is VALID [2021-09-13 14:26:09,859 INFO L281 TraceCheckUtils]: 13: Hoare triple {27984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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_~v~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~post11 < 20);havoc main_#t~post11;__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; {27980#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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) (not (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:09,859 INFO L281 TraceCheckUtils]: 12: Hoare triple {27984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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_~v~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~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {27984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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_~v~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:26:09,859 INFO L281 TraceCheckUtils]: 11: Hoare triple {27991#(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)) (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)))) (= (+ (* 2 (* 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) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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))))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {27984#(or (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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) (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~q~0 ULTIMATE.start_main_~x~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))) (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_~v~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:26:09,860 INFO L281 TraceCheckUtils]: 10: Hoare triple {27991#(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)) (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)))) (= (+ (* 2 (* 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) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {27991#(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)) (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)))) (= (+ (* 2 (* 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) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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))))} is VALID [2021-09-13 14:26:09,860 INFO L281 TraceCheckUtils]: 9: Hoare triple {27991#(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)) (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)))) (= (+ (* 2 (* 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) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {27991#(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)) (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)))) (= (+ (* 2 (* 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) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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))))} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 8: Hoare triple {27810#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {27991#(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)) (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)))) (= (+ (* 2 (* 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) (* 2 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~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))))} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 7: Hoare triple {27810#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 6: Hoare triple {27810#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 5: Hoare triple {27810#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; {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 4: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 3: Hoare triple {27810#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; {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 2: Hoare triple {27810#true} assume !(0 == assume_abort_if_not_~cond); {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 1: Hoare triple {27810#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {27810#true} is VALID [2021-09-13 14:26:09,861 INFO L281 TraceCheckUtils]: 0: Hoare triple {27810#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; {27810#true} is VALID [2021-09-13 14:26:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:09,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:09,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082790860] [2021-09-13 14:26:09,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:09,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193797045] [2021-09-13 14:26:09,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193797045] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:09,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:09,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-09-13 14:26:09,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379987969] [2021-09-13 14:26:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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 33 [2021-09-13 14:26:09,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:09,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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:26:09,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:09,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-09-13 14:26:09,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-09-13 14:26:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-09-13 14:26:09,970 INFO L87 Difference]: Start difference. First operand 595 states and 754 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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:26:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:24,052 INFO L93 Difference]: Finished difference Result 1157 states and 1472 transitions. [2021-09-13 14:26:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-09-13 14:26:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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 33 [2021-09-13 14:26:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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:26:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 324 transitions. [2021-09-13 14:26:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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:26:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 324 transitions. [2021-09-13 14:26:24,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 324 transitions. [2021-09-13 14:26:25,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:25,412 INFO L225 Difference]: With dead ends: 1157 [2021-09-13 14:26:25,412 INFO L226 Difference]: Without dead ends: 1147 [2021-09-13 14:26:25,413 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 2656.77ms TimeCoverageRelationStatistics Valid=692, Invalid=3090, Unknown=0, NotChecked=0, Total=3782 [2021-09-13 14:26:25,413 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 467 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3187.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.61ms SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3198.08ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:25,413 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 0 Invalid, 1294 Unknown, 0 Unchecked, 5.61ms Time], IncrementalHoareTripleChecker [167 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 3198.08ms Time] [2021-09-13 14:26:25,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-09-13 14:26:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 785. [2021-09-13 14:26:27,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:27,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1147 states. Second operand has 785 states, 781 states have (on average 1.2970550576184379) internal successors, (1013), 784 states have internal predecessors, (1013), 0 states have call successors, (0), 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:26:27,971 INFO L74 IsIncluded]: Start isIncluded. First operand 1147 states. Second operand has 785 states, 781 states have (on average 1.2970550576184379) internal successors, (1013), 784 states have internal predecessors, (1013), 0 states have call successors, (0), 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:26:27,972 INFO L87 Difference]: Start difference. First operand 1147 states. Second operand has 785 states, 781 states have (on average 1.2970550576184379) internal successors, (1013), 784 states have internal predecessors, (1013), 0 states have call successors, (0), 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:26:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:28,019 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2021-09-13 14:26:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1440 transitions. [2021-09-13 14:26:28,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:28,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:28,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 785 states, 781 states have (on average 1.2970550576184379) internal successors, (1013), 784 states have internal predecessors, (1013), 0 states have call successors, (0), 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 1147 states. [2021-09-13 14:26:28,022 INFO L87 Difference]: Start difference. First operand has 785 states, 781 states have (on average 1.2970550576184379) internal successors, (1013), 784 states have internal predecessors, (1013), 0 states have call successors, (0), 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 1147 states. [2021-09-13 14:26:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:28,059 INFO L93 Difference]: Finished difference Result 1147 states and 1440 transitions. [2021-09-13 14:26:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1440 transitions. [2021-09-13 14:26:28,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:28,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:28,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:28,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 781 states have (on average 1.2970550576184379) internal successors, (1013), 784 states have internal predecessors, (1013), 0 states have call successors, (0), 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:26:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1013 transitions. [2021-09-13 14:26:28,085 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1013 transitions. Word has length 33 [2021-09-13 14:26:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:28,086 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1013 transitions. [2021-09-13 14:26:28,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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:26:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1013 transitions. [2021-09-13 14:26:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-09-13 14:26:28,086 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:28,086 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:26:28,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-09-13 14:26:28,300 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:26:28,301 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:28,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:28,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1517440196, now seen corresponding path program 1 times [2021-09-13 14:26:28,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:28,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217770205] [2021-09-13 14:26:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:28,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:28,307 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:28,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712309137] [2021-09-13 14:26:28,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:28,307 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:28,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:28,310 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:26:28,311 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:26:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:28,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:26:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:28,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:28,590 INFO L281 TraceCheckUtils]: 0: Hoare triple {33102#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; {33107#(<= ~counter~0 0)} is VALID [2021-09-13 14:26:28,590 INFO L281 TraceCheckUtils]: 1: Hoare triple {33107#(<= ~counter~0 0)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {33107#(<= ~counter~0 0)} is VALID [2021-09-13 14:26:28,590 INFO L281 TraceCheckUtils]: 2: Hoare triple {33107#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {33107#(<= ~counter~0 0)} is VALID [2021-09-13 14:26:28,591 INFO L281 TraceCheckUtils]: 3: Hoare triple {33107#(<= ~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; {33107#(<= ~counter~0 0)} is VALID [2021-09-13 14:26:28,591 INFO L281 TraceCheckUtils]: 4: Hoare triple {33107#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond); {33107#(<= ~counter~0 0)} is VALID [2021-09-13 14:26:28,591 INFO L281 TraceCheckUtils]: 5: Hoare triple {33107#(<= ~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; {33107#(<= ~counter~0 0)} is VALID [2021-09-13 14:26:28,592 INFO L281 TraceCheckUtils]: 6: Hoare triple {33107#(<= ~counter~0 0)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33126#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:28,592 INFO L281 TraceCheckUtils]: 7: Hoare triple {33126#(<= ~counter~0 1)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {33126#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:28,593 INFO L281 TraceCheckUtils]: 8: Hoare triple {33126#(<= ~counter~0 1)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {33126#(<= ~counter~0 1)} is VALID [2021-09-13 14:26:28,593 INFO L281 TraceCheckUtils]: 9: Hoare triple {33126#(<= ~counter~0 1)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33136#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:28,593 INFO L281 TraceCheckUtils]: 10: Hoare triple {33136#(<= ~counter~0 2)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {33136#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:28,594 INFO L281 TraceCheckUtils]: 11: Hoare triple {33136#(<= ~counter~0 2)} assume !(main_~c~0 >= main_~b~0); {33136#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:28,594 INFO L281 TraceCheckUtils]: 12: Hoare triple {33136#(<= ~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; {33136#(<= ~counter~0 2)} is VALID [2021-09-13 14:26:28,595 INFO L281 TraceCheckUtils]: 13: Hoare triple {33136#(<= ~counter~0 2)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33149#(<= ~counter~0 3)} is VALID [2021-09-13 14:26:28,595 INFO L281 TraceCheckUtils]: 14: Hoare triple {33149#(<= ~counter~0 3)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {33149#(<= ~counter~0 3)} is VALID [2021-09-13 14:26:28,595 INFO L281 TraceCheckUtils]: 15: Hoare triple {33149#(<= ~counter~0 3)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {33149#(<= ~counter~0 3)} is VALID [2021-09-13 14:26:28,596 INFO L281 TraceCheckUtils]: 16: Hoare triple {33149#(<= ~counter~0 3)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33159#(<= ~counter~0 4)} is VALID [2021-09-13 14:26:28,596 INFO L281 TraceCheckUtils]: 17: Hoare triple {33159#(<= ~counter~0 4)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {33159#(<= ~counter~0 4)} is VALID [2021-09-13 14:26:28,596 INFO L281 TraceCheckUtils]: 18: Hoare triple {33159#(<= ~counter~0 4)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {33159#(<= ~counter~0 4)} is VALID [2021-09-13 14:26:28,597 INFO L281 TraceCheckUtils]: 19: Hoare triple {33159#(<= ~counter~0 4)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,597 INFO L281 TraceCheckUtils]: 20: Hoare triple {33169#(<= ~counter~0 5)} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,597 INFO L281 TraceCheckUtils]: 21: Hoare triple {33169#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,597 INFO L281 TraceCheckUtils]: 22: Hoare triple {33169#(<= ~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; {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,598 INFO L281 TraceCheckUtils]: 23: Hoare triple {33169#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,598 INFO L281 TraceCheckUtils]: 24: Hoare triple {33169#(<= ~counter~0 5)} __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; {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,598 INFO L281 TraceCheckUtils]: 25: Hoare triple {33169#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,599 INFO L281 TraceCheckUtils]: 26: Hoare triple {33169#(<= ~counter~0 5)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,599 INFO L281 TraceCheckUtils]: 27: Hoare triple {33169#(<= ~counter~0 5)} assume !(0 == __VERIFIER_assert_~cond); {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,599 INFO L281 TraceCheckUtils]: 28: Hoare triple {33169#(<= ~counter~0 5)} assume !(main_~c~0 >= 2 * main_~v~0); {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,599 INFO L281 TraceCheckUtils]: 29: Hoare triple {33169#(<= ~counter~0 5)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {33169#(<= ~counter~0 5)} is VALID [2021-09-13 14:26:28,600 INFO L281 TraceCheckUtils]: 30: Hoare triple {33169#(<= ~counter~0 5)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33203#(<= ~counter~0 6)} is VALID [2021-09-13 14:26:28,600 INFO L281 TraceCheckUtils]: 31: Hoare triple {33203#(<= ~counter~0 6)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {33203#(<= ~counter~0 6)} is VALID [2021-09-13 14:26:28,600 INFO L281 TraceCheckUtils]: 32: Hoare triple {33203#(<= ~counter~0 6)} assume !(main_~c~0 >= main_~b~0); {33203#(<= ~counter~0 6)} is VALID [2021-09-13 14:26:28,601 INFO L281 TraceCheckUtils]: 33: Hoare triple {33203#(<= ~counter~0 6)} 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; {33203#(<= ~counter~0 6)} is VALID [2021-09-13 14:26:28,601 INFO L281 TraceCheckUtils]: 34: Hoare triple {33203#(<= ~counter~0 6)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33216#(<= |ULTIMATE.start_main_#t~post9| 6)} is VALID [2021-09-13 14:26:28,601 INFO L281 TraceCheckUtils]: 35: Hoare triple {33216#(<= |ULTIMATE.start_main_#t~post9| 6)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {33103#false} is VALID [2021-09-13 14:26:28,601 INFO L281 TraceCheckUtils]: 36: Hoare triple {33103#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {33103#false} is VALID [2021-09-13 14:26:28,602 INFO L281 TraceCheckUtils]: 37: Hoare triple {33103#false} assume 0 == __VERIFIER_assert_~cond; {33103#false} is VALID [2021-09-13 14:26:28,602 INFO L281 TraceCheckUtils]: 38: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2021-09-13 14:26:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:28,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:26:28,977 INFO L281 TraceCheckUtils]: 38: Hoare triple {33103#false} assume !false; {33103#false} is VALID [2021-09-13 14:26:28,978 INFO L281 TraceCheckUtils]: 37: Hoare triple {33103#false} assume 0 == __VERIFIER_assert_~cond; {33103#false} is VALID [2021-09-13 14:26:28,978 INFO L281 TraceCheckUtils]: 36: Hoare triple {33103#false} __VERIFIER_assert_#in~cond := (if main_~p~0 * main_~x~0 - main_~q~0 * main_~x~0 + main_~r~0 * main_~y~0 - main_~s~0 * main_~y~0 == main_~a~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {33103#false} is VALID [2021-09-13 14:26:28,978 INFO L281 TraceCheckUtils]: 35: Hoare triple {33238#(< |ULTIMATE.start_main_#t~post9| 20)} assume !(main_#t~post9 < 20);havoc main_#t~post9; {33103#false} is VALID [2021-09-13 14:26:28,979 INFO L281 TraceCheckUtils]: 34: Hoare triple {33242#(< ~counter~0 20)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33238#(< |ULTIMATE.start_main_#t~post9| 20)} is VALID [2021-09-13 14:26:28,979 INFO L281 TraceCheckUtils]: 33: Hoare triple {33242#(< ~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; {33242#(< ~counter~0 20)} is VALID [2021-09-13 14:26:28,979 INFO L281 TraceCheckUtils]: 32: Hoare triple {33242#(< ~counter~0 20)} assume !(main_~c~0 >= main_~b~0); {33242#(< ~counter~0 20)} is VALID [2021-09-13 14:26:28,980 INFO L281 TraceCheckUtils]: 31: Hoare triple {33242#(< ~counter~0 20)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {33242#(< ~counter~0 20)} is VALID [2021-09-13 14:26:28,980 INFO L281 TraceCheckUtils]: 30: Hoare triple {33255#(< ~counter~0 19)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33242#(< ~counter~0 20)} is VALID [2021-09-13 14:26:28,981 INFO L281 TraceCheckUtils]: 29: Hoare triple {33255#(< ~counter~0 19)} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,981 INFO L281 TraceCheckUtils]: 28: Hoare triple {33255#(< ~counter~0 19)} assume !(main_~c~0 >= 2 * main_~v~0); {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,981 INFO L281 TraceCheckUtils]: 27: Hoare triple {33255#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,982 INFO L281 TraceCheckUtils]: 26: Hoare triple {33255#(< ~counter~0 19)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,982 INFO L281 TraceCheckUtils]: 25: Hoare triple {33255#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,982 INFO L281 TraceCheckUtils]: 24: Hoare triple {33255#(< ~counter~0 19)} __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; {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,983 INFO L281 TraceCheckUtils]: 23: Hoare triple {33255#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,983 INFO L281 TraceCheckUtils]: 22: Hoare triple {33255#(< ~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; {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,983 INFO L281 TraceCheckUtils]: 21: Hoare triple {33255#(< ~counter~0 19)} assume !(0 == __VERIFIER_assert_~cond); {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,984 INFO L281 TraceCheckUtils]: 20: Hoare triple {33255#(< ~counter~0 19)} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,985 INFO L281 TraceCheckUtils]: 19: Hoare triple {33289#(< ~counter~0 18)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {33255#(< ~counter~0 19)} is VALID [2021-09-13 14:26:28,985 INFO L281 TraceCheckUtils]: 18: Hoare triple {33289#(< ~counter~0 18)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {33289#(< ~counter~0 18)} is VALID [2021-09-13 14:26:28,985 INFO L281 TraceCheckUtils]: 17: Hoare triple {33289#(< ~counter~0 18)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {33289#(< ~counter~0 18)} is VALID [2021-09-13 14:26:28,986 INFO L281 TraceCheckUtils]: 16: Hoare triple {33299#(< ~counter~0 17)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33289#(< ~counter~0 18)} is VALID [2021-09-13 14:26:28,986 INFO L281 TraceCheckUtils]: 15: Hoare triple {33299#(< ~counter~0 17)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {33299#(< ~counter~0 17)} is VALID [2021-09-13 14:26:28,987 INFO L281 TraceCheckUtils]: 14: Hoare triple {33299#(< ~counter~0 17)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {33299#(< ~counter~0 17)} is VALID [2021-09-13 14:26:28,987 INFO L281 TraceCheckUtils]: 13: Hoare triple {33309#(< ~counter~0 16)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33299#(< ~counter~0 17)} is VALID [2021-09-13 14:26:28,988 INFO L281 TraceCheckUtils]: 12: Hoare triple {33309#(< ~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; {33309#(< ~counter~0 16)} is VALID [2021-09-13 14:26:28,988 INFO L281 TraceCheckUtils]: 11: Hoare triple {33309#(< ~counter~0 16)} assume !(main_~c~0 >= main_~b~0); {33309#(< ~counter~0 16)} is VALID [2021-09-13 14:26:28,988 INFO L281 TraceCheckUtils]: 10: Hoare triple {33309#(< ~counter~0 16)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {33309#(< ~counter~0 16)} is VALID [2021-09-13 14:26:28,989 INFO L281 TraceCheckUtils]: 9: Hoare triple {33322#(< ~counter~0 15)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {33309#(< ~counter~0 16)} is VALID [2021-09-13 14:26:28,989 INFO L281 TraceCheckUtils]: 8: Hoare triple {33322#(< ~counter~0 15)} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {33322#(< ~counter~0 15)} is VALID [2021-09-13 14:26:28,990 INFO L281 TraceCheckUtils]: 7: Hoare triple {33322#(< ~counter~0 15)} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {33322#(< ~counter~0 15)} is VALID [2021-09-13 14:26:28,990 INFO L281 TraceCheckUtils]: 6: Hoare triple {33332#(< ~counter~0 14)} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {33322#(< ~counter~0 15)} is VALID [2021-09-13 14:26:28,991 INFO L281 TraceCheckUtils]: 5: Hoare triple {33332#(< ~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; {33332#(< ~counter~0 14)} is VALID [2021-09-13 14:26:28,991 INFO L281 TraceCheckUtils]: 4: Hoare triple {33332#(< ~counter~0 14)} assume !(0 == assume_abort_if_not_~cond); {33332#(< ~counter~0 14)} is VALID [2021-09-13 14:26:28,991 INFO L281 TraceCheckUtils]: 3: Hoare triple {33332#(< ~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; {33332#(< ~counter~0 14)} is VALID [2021-09-13 14:26:28,992 INFO L281 TraceCheckUtils]: 2: Hoare triple {33332#(< ~counter~0 14)} assume !(0 == assume_abort_if_not_~cond); {33332#(< ~counter~0 14)} is VALID [2021-09-13 14:26:28,992 INFO L281 TraceCheckUtils]: 1: Hoare triple {33332#(< ~counter~0 14)} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {33332#(< ~counter~0 14)} is VALID [2021-09-13 14:26:28,993 INFO L281 TraceCheckUtils]: 0: Hoare triple {33102#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; {33332#(< ~counter~0 14)} is VALID [2021-09-13 14:26:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:26:28,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:28,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217770205] [2021-09-13 14:26:28,994 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:28,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712309137] [2021-09-13 14:26:28,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712309137] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:26:28,995 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:26:28,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-09-13 14:26:28,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421416632] [2021-09-13 14:26:28,997 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:28,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:28,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:29,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:29,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-09-13 14:26:29,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-09-13 14:26:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2021-09-13 14:26:29,049 INFO L87 Difference]: Start difference. First operand 785 states and 1013 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:35,244 INFO L93 Difference]: Finished difference Result 1756 states and 2299 transitions. [2021-09-13 14:26:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-09-13 14:26:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:35,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 340 transitions. [2021-09-13 14:26:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 340 transitions. [2021-09-13 14:26:35,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 340 transitions. [2021-09-13 14:26:35,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 340 edges. 340 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:35,577 INFO L225 Difference]: With dead ends: 1756 [2021-09-13 14:26:35,577 INFO L226 Difference]: Without dead ends: 1752 [2021-09-13 14:26:35,577 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 183.24ms TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2021-09-13 14:26:35,578 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 336.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.93ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 338.79ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:35,578 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 600 Unknown, 0 Unchecked, 1.93ms Time], IncrementalHoareTripleChecker [78 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 338.79ms Time] [2021-09-13 14:26:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-09-13 14:26:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1354. [2021-09-13 14:26:39,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:39,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1752 states. Second operand has 1354 states, 1350 states have (on average 1.2985185185185186) internal successors, (1753), 1353 states have internal predecessors, (1753), 0 states have call successors, (0), 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:26:39,829 INFO L74 IsIncluded]: Start isIncluded. First operand 1752 states. Second operand has 1354 states, 1350 states have (on average 1.2985185185185186) internal successors, (1753), 1353 states have internal predecessors, (1753), 0 states have call successors, (0), 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:26:39,830 INFO L87 Difference]: Start difference. First operand 1752 states. Second operand has 1354 states, 1350 states have (on average 1.2985185185185186) internal successors, (1753), 1353 states have internal predecessors, (1753), 0 states have call successors, (0), 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:26:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:39,917 INFO L93 Difference]: Finished difference Result 1752 states and 2219 transitions. [2021-09-13 14:26:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2219 transitions. [2021-09-13 14:26:39,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:39,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:39,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 1354 states, 1350 states have (on average 1.2985185185185186) internal successors, (1753), 1353 states have internal predecessors, (1753), 0 states have call successors, (0), 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 1752 states. [2021-09-13 14:26:39,921 INFO L87 Difference]: Start difference. First operand has 1354 states, 1350 states have (on average 1.2985185185185186) internal successors, (1753), 1353 states have internal predecessors, (1753), 0 states have call successors, (0), 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 1752 states. [2021-09-13 14:26:40,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:40,012 INFO L93 Difference]: Finished difference Result 1752 states and 2219 transitions. [2021-09-13 14:26:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2219 transitions. [2021-09-13 14:26:40,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:40,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:40,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:40,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1350 states have (on average 1.2985185185185186) internal successors, (1753), 1353 states have internal predecessors, (1753), 0 states have call successors, (0), 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:26:40,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1753 transitions. [2021-09-13 14:26:40,082 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1753 transitions. Word has length 39 [2021-09-13 14:26:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:40,083 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 1753 transitions. [2021-09-13 14:26:40,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 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:26:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1753 transitions. [2021-09-13 14:26:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:26:40,083 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:40,083 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-09-13 14:26:40,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-09-13 14:26:40,302 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:26:40,303 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:40,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1573117064, now seen corresponding path program 1 times [2021-09-13 14:26:40,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:40,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613590301] [2021-09-13 14:26:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:40,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:40,308 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:40,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596254348] [2021-09-13 14:26:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:40,308 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:40,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:40,311 INFO L229 MonitoredProcess]: Starting monitored process 20 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:26:40,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-09-13 14:26:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:40,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2021-09-13 14:26:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:40,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:40,531 INFO L281 TraceCheckUtils]: 0: Hoare triple {41174#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; {41174#true} is VALID [2021-09-13 14:26:40,531 INFO L281 TraceCheckUtils]: 1: Hoare triple {41174#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {41174#true} is VALID [2021-09-13 14:26:40,531 INFO L281 TraceCheckUtils]: 2: Hoare triple {41174#true} assume !(0 == assume_abort_if_not_~cond); {41174#true} is VALID [2021-09-13 14:26:40,531 INFO L281 TraceCheckUtils]: 3: Hoare triple {41174#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; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 4: Hoare triple {41174#true} assume !(0 == assume_abort_if_not_~cond); {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 5: Hoare triple {41174#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; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 6: Hoare triple {41174#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 7: Hoare triple {41174#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 8: Hoare triple {41174#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 9: Hoare triple {41174#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 10: Hoare triple {41174#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 11: Hoare triple {41174#true} assume !(main_~c~0 >= main_~b~0); {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 12: Hoare triple {41174#true} 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; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 13: Hoare triple {41174#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 14: Hoare triple {41174#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 15: Hoare triple {41174#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 16: Hoare triple {41174#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {41174#true} is VALID [2021-09-13 14:26:40,532 INFO L281 TraceCheckUtils]: 17: Hoare triple {41174#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {41174#true} is VALID [2021-09-13 14:26:40,533 INFO L281 TraceCheckUtils]: 18: Hoare triple {41174#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,533 INFO L281 TraceCheckUtils]: 19: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,533 INFO L281 TraceCheckUtils]: 20: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,533 INFO L281 TraceCheckUtils]: 21: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,534 INFO L281 TraceCheckUtils]: 22: Hoare triple {41233#(<= ULTIMATE.start_main_~v~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; {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,534 INFO L281 TraceCheckUtils]: 23: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,534 INFO L281 TraceCheckUtils]: 24: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} __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; {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,534 INFO L281 TraceCheckUtils]: 25: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,535 INFO L281 TraceCheckUtils]: 26: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,535 INFO L281 TraceCheckUtils]: 27: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(0 == __VERIFIER_assert_~cond); {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,535 INFO L281 TraceCheckUtils]: 28: Hoare triple {41233#(<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0)} assume !(main_~c~0 >= 2 * main_~v~0); {41264#(and (<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:26:40,536 INFO L281 TraceCheckUtils]: 29: Hoare triple {41264#(and (<= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,536 INFO L281 TraceCheckUtils]: 30: Hoare triple {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,536 INFO L281 TraceCheckUtils]: 31: Hoare triple {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 32: Hoare triple {41268#(< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0)} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 33: Hoare triple {41175#false} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 34: Hoare triple {41175#false} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 35: Hoare triple {41175#false} assume !(0 == __VERIFIER_assert_~cond); {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 36: Hoare triple {41175#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; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 37: Hoare triple {41175#false} assume !(0 == __VERIFIER_assert_~cond); {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 38: Hoare triple {41175#false} __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; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 39: Hoare triple {41175#false} assume 0 == __VERIFIER_assert_~cond; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L281 TraceCheckUtils]: 40: Hoare triple {41175#false} assume !false; {41175#false} is VALID [2021-09-13 14:26:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-09-13 14:26:40,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:40,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:40,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613590301] [2021-09-13 14:26:40,538 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:40,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596254348] [2021-09-13 14:26:40,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596254348] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:40,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:40,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-13 14:26:40,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023252077] [2021-09-13 14:26:40,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 41 [2021-09-13 14:26:40,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:40,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:26:40,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:40,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 14:26:40,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:40,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 14:26:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:26:40,561 INFO L87 Difference]: Start difference. First operand 1354 states and 1753 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:26:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:46,785 INFO L93 Difference]: Finished difference Result 2784 states and 3644 transitions. [2021-09-13 14:26:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:26:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 41 [2021-09-13 14:26:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:26:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2021-09-13 14:26:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:26:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2021-09-13 14:26:46,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2021-09-13 14:26:46,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:46,973 INFO L225 Difference]: With dead ends: 2784 [2021-09-13 14:26:46,973 INFO L226 Difference]: Without dead ends: 1767 [2021-09-13 14:26:46,974 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 19.37ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:26:46,974 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.40ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 95.97ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:46,974 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.40ms Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 95.97ms Time] [2021-09-13 14:26:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2021-09-13 14:26:52,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1620. [2021-09-13 14:26:52,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:26:52,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1767 states. Second operand has 1620 states, 1616 states have (on average 1.2889851485148516) internal successors, (2083), 1619 states have internal predecessors, (2083), 0 states have call successors, (0), 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:26:52,479 INFO L74 IsIncluded]: Start isIncluded. First operand 1767 states. Second operand has 1620 states, 1616 states have (on average 1.2889851485148516) internal successors, (2083), 1619 states have internal predecessors, (2083), 0 states have call successors, (0), 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:26:52,479 INFO L87 Difference]: Start difference. First operand 1767 states. Second operand has 1620 states, 1616 states have (on average 1.2889851485148516) internal successors, (2083), 1619 states have internal predecessors, (2083), 0 states have call successors, (0), 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:26:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:52,564 INFO L93 Difference]: Finished difference Result 1767 states and 2267 transitions. [2021-09-13 14:26:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2267 transitions. [2021-09-13 14:26:52,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:52,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:52,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 1620 states, 1616 states have (on average 1.2889851485148516) internal successors, (2083), 1619 states have internal predecessors, (2083), 0 states have call successors, (0), 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 1767 states. [2021-09-13 14:26:52,567 INFO L87 Difference]: Start difference. First operand has 1620 states, 1616 states have (on average 1.2889851485148516) internal successors, (2083), 1619 states have internal predecessors, (2083), 0 states have call successors, (0), 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 1767 states. [2021-09-13 14:26:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:52,653 INFO L93 Difference]: Finished difference Result 1767 states and 2267 transitions. [2021-09-13 14:26:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2267 transitions. [2021-09-13 14:26:52,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:26:52,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:26:52,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:26:52,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:26:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1616 states have (on average 1.2889851485148516) internal successors, (2083), 1619 states have internal predecessors, (2083), 0 states have call successors, (0), 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:26:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2083 transitions. [2021-09-13 14:26:52,752 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2083 transitions. Word has length 41 [2021-09-13 14:26:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:26:52,752 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 2083 transitions. [2021-09-13 14:26:52,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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:26:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2083 transitions. [2021-09-13 14:26:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-09-13 14:26:52,753 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:26:52,753 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-09-13 14:26:52,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-09-13 14:26:52,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:52,953 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:26:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:26:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash -149759960, now seen corresponding path program 2 times [2021-09-13 14:26:52,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:26:52,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163232023] [2021-09-13 14:26:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:26:52,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:26:52,959 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:26:52,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378661625] [2021-09-13 14:26:52,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-09-13 14:26:52,960 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:26:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:26:52,970 INFO L229 MonitoredProcess]: Starting monitored process 21 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:26:52,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-09-13 14:26:52,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-09-13 14:26:52,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-09-13 14:26:52,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2021-09-13 14:26:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:26:53,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 0: Hoare triple {50949#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; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 1: Hoare triple {50949#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 2: Hoare triple {50949#true} assume !(0 == assume_abort_if_not_~cond); {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 3: Hoare triple {50949#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; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 4: Hoare triple {50949#true} assume !(0 == assume_abort_if_not_~cond); {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 5: Hoare triple {50949#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; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 6: Hoare triple {50949#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 7: Hoare triple {50949#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 8: Hoare triple {50949#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 9: Hoare triple {50949#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 10: Hoare triple {50949#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 11: Hoare triple {50949#true} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {50949#true} is VALID [2021-09-13 14:26:53,237 INFO L281 TraceCheckUtils]: 12: Hoare triple {50949#true} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 13: Hoare triple {50949#true} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 14: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 15: Hoare triple {50949#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; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 16: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 17: Hoare triple {50949#true} __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; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 18: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 19: Hoare triple {50949#true} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 20: Hoare triple {50949#true} assume !(0 == __VERIFIER_assert_~cond); {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 21: Hoare triple {50949#true} assume !(main_~c~0 >= 2 * main_~v~0); {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 22: Hoare triple {50949#true} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 23: Hoare triple {50949#true} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 24: Hoare triple {50949#true} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 25: Hoare triple {50949#true} assume !(main_~c~0 >= main_~b~0); {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 26: Hoare triple {50949#true} 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; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 27: Hoare triple {50949#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {50949#true} is VALID [2021-09-13 14:26:53,238 INFO L281 TraceCheckUtils]: 28: Hoare triple {50949#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {50949#true} is VALID [2021-09-13 14:26:53,239 INFO L281 TraceCheckUtils]: 29: Hoare triple {50949#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,239 INFO L281 TraceCheckUtils]: 30: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,239 INFO L281 TraceCheckUtils]: 31: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,240 INFO L281 TraceCheckUtils]: 32: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,240 INFO L281 TraceCheckUtils]: 33: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,241 INFO L281 TraceCheckUtils]: 34: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,241 INFO L281 TraceCheckUtils]: 35: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,241 INFO L281 TraceCheckUtils]: 36: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~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; {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,242 INFO L281 TraceCheckUtils]: 37: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} assume !(0 == __VERIFIER_assert_~cond); {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} is VALID [2021-09-13 14:26:53,242 INFO L281 TraceCheckUtils]: 38: Hoare triple {51041#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (not (= ULTIMATE.start_main_~b~0 0)))} __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; {51069#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:26:53,242 INFO L281 TraceCheckUtils]: 39: Hoare triple {51069#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {50950#false} is VALID [2021-09-13 14:26:53,242 INFO L281 TraceCheckUtils]: 40: Hoare triple {50950#false} assume !false; {50950#false} is VALID [2021-09-13 14:26:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-09-13 14:26:53,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-09-13 14:26:53,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:26:53,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163232023] [2021-09-13 14:26:53,243 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:26:53,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378661625] [2021-09-13 14:26:53,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378661625] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-13 14:26:53,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:26:53,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-13 14:26:53,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7677815] [2021-09-13 14:26:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 41 [2021-09-13 14:26:53,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:26:53,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:53,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:26:53,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-13 14:26:53,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:26:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-13 14:26:53,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-13 14:26:53,268 INFO L87 Difference]: Start difference. First operand 1620 states and 2083 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:26:59,819 INFO L93 Difference]: Finished difference Result 1761 states and 2260 transitions. [2021-09-13 14:26:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-13 14:26:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 41 [2021-09-13 14:26:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:26:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2021-09-13 14:26:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2021-09-13 14:26:59,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2021-09-13 14:26:59,861 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:26:59,977 INFO L225 Difference]: With dead ends: 1761 [2021-09-13 14:26:59,977 INFO L226 Difference]: Without dead ends: 1759 [2021-09-13 14:26:59,978 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.91ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-13 14:26:59,978 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.37ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.26ms IncrementalHoareTripleChecker+Time [2021-09-13 14:26:59,979 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.37ms Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 67.26ms Time] [2021-09-13 14:26:59,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2021-09-13 14:27:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1720. [2021-09-13 14:27:06,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:06,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1759 states. Second operand has 1720 states, 1716 states have (on average 1.2756410256410255) internal successors, (2189), 1719 states have internal predecessors, (2189), 0 states have call successors, (0), 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:27:06,989 INFO L74 IsIncluded]: Start isIncluded. First operand 1759 states. Second operand has 1720 states, 1716 states have (on average 1.2756410256410255) internal successors, (2189), 1719 states have internal predecessors, (2189), 0 states have call successors, (0), 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:27:06,989 INFO L87 Difference]: Start difference. First operand 1759 states. Second operand has 1720 states, 1716 states have (on average 1.2756410256410255) internal successors, (2189), 1719 states have internal predecessors, (2189), 0 states have call successors, (0), 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:27:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:07,086 INFO L93 Difference]: Finished difference Result 1759 states and 2226 transitions. [2021-09-13 14:27:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2226 transitions. [2021-09-13 14:27:07,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:07,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:07,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1716 states have (on average 1.2756410256410255) internal successors, (2189), 1719 states have internal predecessors, (2189), 0 states have call successors, (0), 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 1759 states. [2021-09-13 14:27:07,090 INFO L87 Difference]: Start difference. First operand has 1720 states, 1716 states have (on average 1.2756410256410255) internal successors, (2189), 1719 states have internal predecessors, (2189), 0 states have call successors, (0), 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 1759 states. [2021-09-13 14:27:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:07,175 INFO L93 Difference]: Finished difference Result 1759 states and 2226 transitions. [2021-09-13 14:27:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2226 transitions. [2021-09-13 14:27:07,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:07,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:07,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:07,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1716 states have (on average 1.2756410256410255) internal successors, (2189), 1719 states have internal predecessors, (2189), 0 states have call successors, (0), 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:27:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2189 transitions. [2021-09-13 14:27:07,291 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2189 transitions. Word has length 41 [2021-09-13 14:27:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:07,291 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2189 transitions. [2021-09-13 14:27:07,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2189 transitions. [2021-09-13 14:27:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-09-13 14:27:07,292 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:07,292 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:07,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:07,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-09-13 14:27:07,492 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1891302024, now seen corresponding path program 1 times [2021-09-13 14:27:07,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-13 14:27:07,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782034120] [2021-09-13 14:27:07,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:07,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-13 14:27:07,498 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-09-13 14:27:07,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227093699] [2021-09-13 14:27:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:07,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-09-13 14:27:07,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:07,500 INFO L229 MonitoredProcess]: Starting monitored process 22 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:27:07,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-09-13 14:27:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:07,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjunts are in the unsatisfiable core [2021-09-13 14:27:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:07,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:12,355 INFO L281 TraceCheckUtils]: 0: Hoare triple {59470#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; {59470#true} is VALID [2021-09-13 14:27:12,355 INFO L281 TraceCheckUtils]: 1: Hoare triple {59470#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {59470#true} is VALID [2021-09-13 14:27:12,356 INFO L281 TraceCheckUtils]: 2: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:27:12,356 INFO L281 TraceCheckUtils]: 3: Hoare triple {59470#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; {59470#true} is VALID [2021-09-13 14:27:12,356 INFO L281 TraceCheckUtils]: 4: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:27:12,356 INFO L281 TraceCheckUtils]: 5: Hoare triple {59470#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; {59490#(and (= 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:27:12,356 INFO L281 TraceCheckUtils]: 6: Hoare triple {59490#(and (= 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; {59490#(and (= 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:27:12,357 INFO L281 TraceCheckUtils]: 7: Hoare triple {59490#(and (= 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; {59490#(and (= 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:27:12,357 INFO L281 TraceCheckUtils]: 8: Hoare triple {59490#(and (= 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);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {59500#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,358 INFO L281 TraceCheckUtils]: 9: Hoare triple {59500#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~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; {59500#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,358 INFO L281 TraceCheckUtils]: 10: Hoare triple {59500#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~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; {59500#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,358 INFO L281 TraceCheckUtils]: 11: Hoare triple {59500#(and (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,359 INFO L281 TraceCheckUtils]: 12: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,359 INFO L281 TraceCheckUtils]: 13: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,360 INFO L281 TraceCheckUtils]: 14: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,360 INFO L281 TraceCheckUtils]: 15: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~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; {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,361 INFO L281 TraceCheckUtils]: 16: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,361 INFO L281 TraceCheckUtils]: 17: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~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_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,362 INFO L281 TraceCheckUtils]: 18: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,362 INFO L281 TraceCheckUtils]: 19: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,362 INFO L281 TraceCheckUtils]: 20: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,363 INFO L281 TraceCheckUtils]: 21: Hoare triple {59510#(and (<= 1 ULTIMATE.start_main_~d~0) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,364 INFO L281 TraceCheckUtils]: 22: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,364 INFO L281 TraceCheckUtils]: 23: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,365 INFO L281 TraceCheckUtils]: 24: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,365 INFO L281 TraceCheckUtils]: 25: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~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; {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,366 INFO L281 TraceCheckUtils]: 26: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,366 INFO L281 TraceCheckUtils]: 27: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~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_~k~0 * main_~b~0 + main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,367 INFO L281 TraceCheckUtils]: 28: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,368 INFO L281 TraceCheckUtils]: 29: Hoare triple {59541#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {59566#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (or (and (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,369 INFO L281 TraceCheckUtils]: 30: Hoare triple {59566#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (or (and (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0))) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(0 == __VERIFIER_assert_~cond); {59570#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,369 INFO L281 TraceCheckUtils]: 31: Hoare triple {59570#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} assume !(main_~c~0 >= 2 * main_~v~0); {59574#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} is VALID [2021-09-13 14:27:12,372 INFO L281 TraceCheckUtils]: 32: Hoare triple {59574#(and (= 0 (mod ULTIMATE.start_main_~d~0 (- 2))) (<= 1 (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2))) (= ULTIMATE.start_main_~k~0 0) (= ULTIMATE.start_main_~v~0 (* 2 ULTIMATE.start_main_~b~0)) (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0) (< ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~v~0)) (= ULTIMATE.start_main_~q~0 0) (= ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~a~0) (= ULTIMATE.start_main_~s~0 1) (= ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~y~0))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {59578#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (<= 1 (div (* ULTIMATE.start_main_~k~0 (- 1)) (- 2))) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,373 INFO L281 TraceCheckUtils]: 33: Hoare triple {59578#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (<= 1 (div (* ULTIMATE.start_main_~k~0 (- 1)) (- 2))) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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; {59578#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (<= 1 (div (* ULTIMATE.start_main_~k~0 (- 1)) (- 2))) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,373 INFO L281 TraceCheckUtils]: 34: Hoare triple {59578#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (<= 1 (div (* ULTIMATE.start_main_~k~0 (- 1)) (- 2))) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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; {59578#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (<= 1 (div (* ULTIMATE.start_main_~k~0 (- 1)) (- 2))) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,374 INFO L281 TraceCheckUtils]: 35: Hoare triple {59578#(and (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (<= 1 (div (* ULTIMATE.start_main_~k~0 (- 1)) (- 2))) (= (mod ULTIMATE.start_main_~k~0 (- 2)) 0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,374 INFO L281 TraceCheckUtils]: 36: Hoare triple {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,375 INFO L281 TraceCheckUtils]: 37: Hoare triple {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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~post11 < 20);havoc main_#t~post11;__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; {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,375 INFO L281 TraceCheckUtils]: 38: Hoare triple {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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); {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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:27:12,376 INFO L281 TraceCheckUtils]: 39: Hoare triple {59588#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~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; {59601#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:27:12,376 INFO L281 TraceCheckUtils]: 40: Hoare triple {59601#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~0))} assume !(0 == __VERIFIER_assert_~cond); {59605#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:27:12,377 INFO L281 TraceCheckUtils]: 41: Hoare triple {59605#(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_~c~0) (= ULTIMATE.start_main_~a~0 (+ ULTIMATE.start_main_~c~0 (* 2 ULTIMATE.start_main_~b~0))) (< (* 2 ULTIMATE.start_main_~c~0) ULTIMATE.start_main_~a~0))} __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; {59609#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:12,377 INFO L281 TraceCheckUtils]: 42: Hoare triple {59609#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {59471#false} is VALID [2021-09-13 14:27:12,377 INFO L281 TraceCheckUtils]: 43: Hoare triple {59471#false} assume !false; {59471#false} is VALID [2021-09-13 14:27:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:12,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:25,279 INFO L281 TraceCheckUtils]: 43: Hoare triple {59471#false} assume !false; {59471#false} is VALID [2021-09-13 14:27:25,280 INFO L281 TraceCheckUtils]: 42: Hoare triple {59609#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {59471#false} is VALID [2021-09-13 14:27:25,280 INFO L281 TraceCheckUtils]: 41: Hoare triple {59622#(= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0)} __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; {59609#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2021-09-13 14:27:25,280 INFO L281 TraceCheckUtils]: 40: Hoare triple {59626#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume !(0 == __VERIFIER_assert_~cond); {59622#(= (+ 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:27:27,283 INFO L281 TraceCheckUtils]: 39: Hoare triple {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~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; {59626#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is UNKNOWN [2021-09-13 14:27:27,284 INFO L281 TraceCheckUtils]: 38: Hoare triple {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} assume !(0 == __VERIFIER_assert_~cond); {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,284 INFO L281 TraceCheckUtils]: 37: Hoare triple {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,284 INFO L281 TraceCheckUtils]: 36: Hoare triple {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,285 INFO L281 TraceCheckUtils]: 35: Hoare triple {59643#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {59630#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,285 INFO L281 TraceCheckUtils]: 34: Hoare triple {59643#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {59643#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,286 INFO L281 TraceCheckUtils]: 33: Hoare triple {59643#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {59643#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,294 INFO L281 TraceCheckUtils]: 32: Hoare triple {59653#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} main_~c~0 := main_~c~0 - main_~v~0;main_~k~0 := main_~k~0 + main_~d~0; {59643#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (< ULTIMATE.start_main_~c~0 ULTIMATE.start_main_~b~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))))} is VALID [2021-09-13 14:27:27,295 INFO L281 TraceCheckUtils]: 31: Hoare triple {59657#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} assume !(main_~c~0 >= 2 * main_~v~0); {59653#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,295 INFO L281 TraceCheckUtils]: 30: Hoare triple {59661#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {59657#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,296 INFO L281 TraceCheckUtils]: 29: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {59661#(or (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,296 INFO L281 TraceCheckUtils]: 28: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,296 INFO L281 TraceCheckUtils]: 27: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} __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; {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,296 INFO L281 TraceCheckUtils]: 26: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,297 INFO L281 TraceCheckUtils]: 25: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~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; {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,297 INFO L281 TraceCheckUtils]: 24: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} assume !(0 == __VERIFIER_assert_~cond); {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,297 INFO L281 TraceCheckUtils]: 23: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,298 INFO L281 TraceCheckUtils]: 22: Hoare triple {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,306 INFO L281 TraceCheckUtils]: 21: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} assume !!(main_~c~0 >= 2 * main_~v~0);main_~d~0 := 2 * main_~d~0;main_~v~0 := 2 * main_~v~0; {59665#(or (not (= (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~v~0)) (<= (* 2 ULTIMATE.start_main_~v~0) ULTIMATE.start_main_~c~0) (= (+ (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) (+ ULTIMATE.start_main_~a~0 ULTIMATE.start_main_~v~0)))} is VALID [2021-09-13 14:27:27,307 INFO L281 TraceCheckUtils]: 20: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,307 INFO L281 TraceCheckUtils]: 19: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~v~0 == main_~b~0 * main_~d~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,307 INFO L281 TraceCheckUtils]: 18: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,308 INFO L281 TraceCheckUtils]: 17: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} __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; {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,308 INFO L281 TraceCheckUtils]: 16: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,308 INFO L281 TraceCheckUtils]: 15: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 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; {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,309 INFO L281 TraceCheckUtils]: 14: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} assume !(0 == __VERIFIER_assert_~cond); {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,309 INFO L281 TraceCheckUtils]: 13: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} assume !!(main_#t~post11 < 20);havoc main_#t~post11;__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; {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,309 INFO L281 TraceCheckUtils]: 12: Hoare triple {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} main_#t~post11 := ~counter~0;~counter~0 := 1 + main_#t~post11; {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,312 INFO L281 TraceCheckUtils]: 11: Hoare triple {59721#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (and (or (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))))) (<= (* 4 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))) ULTIMATE.start_main_~c~0)) (not (= ULTIMATE.start_main_~b~0 0))))} assume !!(main_~c~0 >= main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := 1;main_~v~0 := main_~b~0; {59690#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (not (= (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) (* 2 ULTIMATE.start_main_~v~0))) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)))) (<= (* 4 (* ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:27:27,313 INFO L281 TraceCheckUtils]: 10: Hoare triple {59721#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (and (or (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))))) (<= (* 4 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))) ULTIMATE.start_main_~c~0)) (not (= ULTIMATE.start_main_~b~0 0))))} assume !!(main_#t~post10 < 20);havoc main_#t~post10; {59721#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (and (or (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))))) (<= (* 4 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))) ULTIMATE.start_main_~c~0)) (not (= ULTIMATE.start_main_~b~0 0))))} is VALID [2021-09-13 14:27:27,313 INFO L281 TraceCheckUtils]: 9: Hoare triple {59721#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (and (or (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))))) (<= (* 4 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))) ULTIMATE.start_main_~c~0)) (not (= ULTIMATE.start_main_~b~0 0))))} main_#t~post10 := ~counter~0;~counter~0 := 1 + main_#t~post10; {59721#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (and (or (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))))) (<= (* 4 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))) ULTIMATE.start_main_~c~0)) (not (= ULTIMATE.start_main_~b~0 0))))} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 8: Hoare triple {59470#true} assume !!(0 != main_~b~0);havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := 0; {59721#(or (= (+ ULTIMATE.start_main_~c~0 (* ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0)) ULTIMATE.start_main_~a~0) (and (or (= ULTIMATE.start_main_~q~0 0) (not (= (mod (+ ULTIMATE.start_main_~b~0 (* (- 1) ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)) ULTIMATE.start_main_~q~0) 0))) (not (= ULTIMATE.start_main_~b~0 (* ULTIMATE.start_main_~s~0 ULTIMATE.start_main_~y~0)))) (and (or (< ULTIMATE.start_main_~c~0 (+ ULTIMATE.start_main_~b~0 (* 2 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))))) (<= (* 4 (* ULTIMATE.start_main_~b~0 (div ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~b~0))) ULTIMATE.start_main_~c~0)) (not (= ULTIMATE.start_main_~b~0 0))))} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 7: Hoare triple {59470#true} assume !!(main_#t~post9 < 20);havoc main_#t~post9; {59470#true} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 6: Hoare triple {59470#true} main_#t~post9 := ~counter~0;~counter~0 := 1 + main_#t~post9; {59470#true} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 5: Hoare triple {59470#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; {59470#true} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 4: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 3: Hoare triple {59470#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; {59470#true} is VALID [2021-09-13 14:27:27,314 INFO L281 TraceCheckUtils]: 2: Hoare triple {59470#true} assume !(0 == assume_abort_if_not_~cond); {59470#true} is VALID [2021-09-13 14:27:27,315 INFO L281 TraceCheckUtils]: 1: Hoare triple {59470#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {59470#true} is VALID [2021-09-13 14:27:27,315 INFO L281 TraceCheckUtils]: 0: Hoare triple {59470#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; {59470#true} is VALID [2021-09-13 14:27:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:27:27,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-13 14:27:27,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782034120] [2021-09-13 14:27:27,316 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-09-13 14:27:27,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227093699] [2021-09-13 14:27:27,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227093699] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:27:27,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:27:27,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2021-09-13 14:27:27,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577584497] [2021-09-13 14:27:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 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 44 [2021-09-13 14:27:27,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:27,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 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:27:29,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:29,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-09-13 14:27:29,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-13 14:27:29,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-09-13 14:27:29,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2021-09-13 14:27:29,410 INFO L87 Difference]: Start difference. First operand 1720 states and 2189 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 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:27:43,275 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:27:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-09-13 14:27:43,278 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 4477.78ms TimeCoverageRelationStatistics Valid=1008, Invalid=2184, Unknown=0, NotChecked=0, Total=3192 [2021-09-13 14:27:43,279 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 482 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 145 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3665.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.17ms SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3676.13ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:43,279 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 0 Invalid, 811 Unknown, 0 Unchecked, 3.17ms Time], IncrementalHoareTripleChecker [145 Valid, 665 Invalid, 1 Unknown, 0 Unchecked, 3676.13ms Time] [2021-09-13 14:27:43,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-09-13 14:27:43,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-09-13 14:27:43,492 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@1d95a14e 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:27:43,495 INFO L158 Benchmark]: Toolchain (without parser) took 137679.74ms. Allocated memory was 56.6MB in the beginning and 220.2MB in the end (delta: 163.6MB). Free memory was 35.6MB in the beginning and 106.8MB in the end (delta: -71.2MB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2021-09-13 14:27:43,495 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:27:43,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.16ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 39.2MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:27:43,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.33ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 37.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:27:43,495 INFO L158 Benchmark]: Boogie Preprocessor took 30.84ms. Allocated memory is still 56.6MB. Free memory was 37.2MB in the beginning and 35.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:27:43,495 INFO L158 Benchmark]: RCFGBuilder took 298.87ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 50.0MB in the end (delta: -14.1MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2021-09-13 14:27:43,495 INFO L158 Benchmark]: TraceAbstraction took 137060.80ms. Allocated memory was 69.2MB in the beginning and 220.2MB in the end (delta: 151.0MB). Free memory was 49.5MB in the beginning and 106.8MB in the end (delta: -57.3MB). Peak memory consumption was 92.5MB. Max. memory is 16.1GB. [2021-09-13 14:27:43,496 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.15ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.16ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 39.2MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.33ms. Allocated memory is still 56.6MB. Free memory was 39.2MB in the beginning and 37.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.84ms. Allocated memory is still 56.6MB. Free memory was 37.2MB in the beginning and 35.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 298.87ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.9MB in the beginning and 50.0MB in the end (delta: -14.1MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 137060.80ms. Allocated memory was 69.2MB in the beginning and 220.2MB in the end (delta: 151.0MB). Free memory was 49.5MB in the beginning and 106.8MB in the end (delta: -57.3MB). Peak memory consumption was 92.5MB. 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@1d95a14e de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@1d95a14e: 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:27:43,543 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:27:45,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 14:27:45,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 14:27:45,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 14:27:45,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 14:27:45,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 14:27:45,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 14:27:45,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 14:27:45,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 14:27:45,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 14:27:45,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 14:27:45,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 14:27:45,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 14:27:45,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 14:27:45,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 14:27:45,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 14:27:45,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 14:27:45,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 14:27:45,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 14:27:45,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 14:27:45,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 14:27:45,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 14:27:45,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 14:27:45,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 14:27:45,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 14:27:45,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 14:27:45,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 14:27:45,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 14:27:45,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 14:27:45,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 14:27:45,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 14:27:45,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 14:27:45,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 14:27:45,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 14:27:45,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 14:27:45,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 14:27:45,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 14:27:45,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 14:27:45,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 14:27:45,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 14:27:45,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 14:27:45,151 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:27:45,180 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 14:27:45,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 14:27:45,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 14:27:45,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 14:27:45,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 14:27:45,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 14:27:45,183 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 14:27:45,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 14:27:45,183 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 14:27:45,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 14:27:45,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 14:27:45,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-13 14:27:45,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 14:27:45,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-13 14:27:45,185 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 14:27:45,185 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 14:27:45,185 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 14:27:45,193 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-13 14:27:45,194 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 14:27:45,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-13 14:27:45,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 14:27:45,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 14:27:45,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 14:27:45,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:27:45,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 14:27:45,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 14:27:45,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-13 14:27:45,195 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 14:27:45,195 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 14:27:45,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-13 14:27:45,195 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 14:27:45,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 14:27:45,196 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 -> b4e7938b4423950851166e0ea8765de2619e9f00 [2021-09-13 14:27:45,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 14:27:45,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 14:27:45,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 14:27:45,446 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 14:27:45,446 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 14:27:45,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound20.c [2021-09-13 14:27:45,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97228c4a2/d768ddada6674e2badb09af1d68f1cb1/FLAG6504ea4c2 [2021-09-13 14:27:45,871 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 14:27:45,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/egcd3-ll_unwindbound20.c [2021-09-13 14:27:45,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97228c4a2/d768ddada6674e2badb09af1d68f1cb1/FLAG6504ea4c2 [2021-09-13 14:27:45,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97228c4a2/d768ddada6674e2badb09af1d68f1cb1 [2021-09-13 14:27:45,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 14:27:45,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-13 14:27:45,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 14:27:45,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 14:27:45,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 14:27:45,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:27:45" (1/1) ... [2021-09-13 14:27:45,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f4cc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:45, skipping insertion in model container [2021-09-13 14:27:45,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 02:27:45" (1/1) ... [2021-09-13 14:27:45,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 14:27:45,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 14:27:46,009 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/egcd3-ll_unwindbound20.c[490,503] [2021-09-13 14:27:46,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:27:46,034 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 14:27:46,064 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/egcd3-ll_unwindbound20.c[490,503] [2021-09-13 14:27:46,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 14:27:46,085 INFO L208 MainTranslator]: Completed translation [2021-09-13 14:27:46,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46 WrapperNode [2021-09-13 14:27:46,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 14:27:46,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-13 14:27:46,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-13 14:27:46,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-13 14:27:46,091 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:27:46" (1/1) ... [2021-09-13 14:27:46,096 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:27:46" (1/1) ... [2021-09-13 14:27:46,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-13 14:27:46,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 14:27:46,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 14:27:46,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 14:27:46,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 14:27:46,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 14:27:46,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 14:27:46,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 14:27:46,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (1/1) ... [2021-09-13 14:27:46,169 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 14:27:46,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 14:27:46,195 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:27:46,198 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:27:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-09-13 14:27:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 14:27:46,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 14:27:46,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 14:27:50,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 14:27:50,480 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2021-09-13 14:27:50,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:27:50 BoogieIcfgContainer [2021-09-13 14:27:50,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 14:27:50,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 14:27:50,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 14:27:50,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 14:27:50,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 02:27:45" (1/3) ... [2021-09-13 14:27:50,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c3dba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:27:50, skipping insertion in model container [2021-09-13 14:27:50,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 02:27:46" (2/3) ... [2021-09-13 14:27:50,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c3dba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 02:27:50, skipping insertion in model container [2021-09-13 14:27:50,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 02:27:50" (3/3) ... [2021-09-13 14:27:50,487 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound20.c [2021-09-13 14:27:50,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 14:27:50,491 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-09-13 14:27:50,525 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 14:27:50,530 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:27:50,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-09-13 14:27:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 39 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:27:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-13 14:27:50,543 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:50,543 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:50,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1233339761, now seen corresponding path program 1 times [2021-09-13 14:27:50,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:27:50,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626017771] [2021-09-13 14:27:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:50,556 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:27:50,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:27:50,557 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:27:50,558 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:27:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:50,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2021-09-13 14:27:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:50,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:50,777 INFO L281 TraceCheckUtils]: 0: Hoare triple {43#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; {43#true} is VALID [2021-09-13 14:27:50,777 INFO L281 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {43#true} is VALID [2021-09-13 14:27:50,778 INFO L281 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {44#false} is VALID [2021-09-13 14:27:50,778 INFO L281 TraceCheckUtils]: 3: Hoare triple {44#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; {44#false} is VALID [2021-09-13 14:27:50,779 INFO L281 TraceCheckUtils]: 4: Hoare triple {44#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {44#false} is VALID [2021-09-13 14:27:50,780 INFO L281 TraceCheckUtils]: 5: Hoare triple {44#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); {44#false} is VALID [2021-09-13 14:27:50,780 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:27:50,780 INFO L281 TraceCheckUtils]: 7: Hoare triple {44#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {44#false} is VALID [2021-09-13 14:27:50,781 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:27:50,781 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:27:50,782 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:27:50,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:50,845 INFO L281 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2021-09-13 14:27:50,846 INFO L281 TraceCheckUtils]: 8: Hoare triple {44#false} assume 0bv32 == __VERIFIER_assert_~cond; {44#false} is VALID [2021-09-13 14:27:50,846 INFO L281 TraceCheckUtils]: 7: Hoare triple {44#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {44#false} is VALID [2021-09-13 14:27:50,846 INFO L281 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2021-09-13 14:27:50,847 INFO L281 TraceCheckUtils]: 5: Hoare triple {44#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); {44#false} is VALID [2021-09-13 14:27:50,847 INFO L281 TraceCheckUtils]: 4: Hoare triple {44#false} assume 0bv32 == assume_abort_if_not_~cond;assume false; {44#false} is VALID [2021-09-13 14:27:50,847 INFO L281 TraceCheckUtils]: 3: Hoare triple {44#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; {44#false} is VALID [2021-09-13 14:27:50,848 INFO L281 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {44#false} is VALID [2021-09-13 14:27:50,848 INFO L281 TraceCheckUtils]: 1: Hoare triple {43#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {43#true} is VALID [2021-09-13 14:27:50,848 INFO L281 TraceCheckUtils]: 0: Hoare triple {43#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; {43#true} is VALID [2021-09-13 14:27:50,849 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:27:50,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:27:50,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626017771] [2021-09-13 14:27:50,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626017771] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:50,850 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:50,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-09-13 14:27:50,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767571689] [2021-09-13 14:27:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:27:50,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:50,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:27:50,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:50,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-09-13 14:27:50,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:27:50,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-09-13 14:27:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:27:50,977 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 39 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:27:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:53,265 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2021-09-13 14:27:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-09-13 14:27:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-09-13 14:27:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:27:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:27:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:27:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:27:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2021-09-13 14:27:53,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2021-09-13 14:27:53,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:53,834 INFO L225 Difference]: With dead ends: 77 [2021-09-13 14:27:53,835 INFO L226 Difference]: Without dead ends: 36 [2021-09-13 14:27:53,843 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.12ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-09-13 14:27:53,847 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1007.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.00ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1009.75ms IncrementalHoareTripleChecker+Time [2021-09-13 14:27:53,849 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 1.00ms Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1009.75ms Time] [2021-09-13 14:27:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-13 14:27:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-13 14:27:53,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:27:53,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:53,870 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:53,871 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:53,873 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:27:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:27:53,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:53,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:53,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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 36 states. [2021-09-13 14:27:53,874 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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 36 states. [2021-09-13 14:27:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:27:53,876 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-09-13 14:27:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:27:53,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:27:53,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:27:53,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:27:53,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:27:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-09-13 14:27:53,879 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 10 [2021-09-13 14:27:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:27:53,879 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-09-13 14:27:53,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:27:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-09-13 14:27:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-13 14:27:53,880 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:27:53,880 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:27:53,893 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:27:54,091 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:27:54,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:27:54,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:27:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1507359540, now seen corresponding path program 1 times [2021-09-13 14:27:54,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:27:54,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575422282] [2021-09-13 14:27:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:27:54,094 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:27:54,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:27:54,096 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:27:54,097 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:27:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:54,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2021-09-13 14:27:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:27:54,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:27:54,382 INFO L281 TraceCheckUtils]: 0: Hoare triple {311#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; {316#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:27:54,383 INFO L281 TraceCheckUtils]: 1: Hoare triple {316#(= ~counter~0 (_ bv0 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {316#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:27:54,383 INFO L281 TraceCheckUtils]: 2: Hoare triple {316#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {316#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:27:54,384 INFO L281 TraceCheckUtils]: 3: Hoare triple {316#(= ~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; {316#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:27:54,384 INFO L281 TraceCheckUtils]: 4: Hoare triple {316#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {316#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:27:54,385 INFO L281 TraceCheckUtils]: 5: Hoare triple {316#(= ~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); {316#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:27:54,385 INFO L281 TraceCheckUtils]: 6: Hoare triple {316#(= ~counter~0 (_ bv0 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {335#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} is VALID [2021-09-13 14:27:54,386 INFO L281 TraceCheckUtils]: 7: Hoare triple {335#(= |ULTIMATE.start_main_#t~post9| (_ bv0 32))} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {312#false} is VALID [2021-09-13 14:27:54,386 INFO L281 TraceCheckUtils]: 8: Hoare triple {312#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {312#false} is VALID [2021-09-13 14:27:54,386 INFO L281 TraceCheckUtils]: 9: Hoare triple {312#false} assume 0bv32 == __VERIFIER_assert_~cond; {312#false} is VALID [2021-09-13 14:27:54,386 INFO L281 TraceCheckUtils]: 10: Hoare triple {312#false} assume !false; {312#false} is VALID [2021-09-13 14:27:54,387 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:27:54,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:27:54,528 INFO L281 TraceCheckUtils]: 10: Hoare triple {312#false} assume !false; {312#false} is VALID [2021-09-13 14:27:54,528 INFO L281 TraceCheckUtils]: 9: Hoare triple {312#false} assume 0bv32 == __VERIFIER_assert_~cond; {312#false} is VALID [2021-09-13 14:27:54,528 INFO L281 TraceCheckUtils]: 8: Hoare triple {312#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {312#false} is VALID [2021-09-13 14:27:54,529 INFO L281 TraceCheckUtils]: 7: Hoare triple {357#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv20 32))} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {312#false} is VALID [2021-09-13 14:27:54,529 INFO L281 TraceCheckUtils]: 6: Hoare triple {361#(bvslt ~counter~0 (_ bv20 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {357#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv20 32))} is VALID [2021-09-13 14:27:54,529 INFO L281 TraceCheckUtils]: 5: Hoare triple {361#(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); {361#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:27:54,530 INFO L281 TraceCheckUtils]: 4: Hoare triple {361#(bvslt ~counter~0 (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {361#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:27:54,530 INFO L281 TraceCheckUtils]: 3: Hoare triple {361#(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; {361#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:27:54,531 INFO L281 TraceCheckUtils]: 2: Hoare triple {361#(bvslt ~counter~0 (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {361#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:27:54,531 INFO L281 TraceCheckUtils]: 1: Hoare triple {361#(bvslt ~counter~0 (_ bv20 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {361#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:27:54,532 INFO L281 TraceCheckUtils]: 0: Hoare triple {311#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; {361#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:27:54,532 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:27:54,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:27:54,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575422282] [2021-09-13 14:27:54,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575422282] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:27:54,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:27:54,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-09-13 14:27:54,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577733220] [2021-09-13 14:27:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 11 [2021-09-13 14:27:54,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:27:54,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:27:54,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:27:54,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-13 14:27:54,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:27:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-13 14:27:54,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-09-13 14:27:54,629 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:28:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:06,492 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2021-09-13 14:28:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 14:28:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 11 [2021-09-13 14:28:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:28:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-09-13 14:28:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:28:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2021-09-13 14:28:06,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2021-09-13 14:28:06,935 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:28:06,936 INFO L225 Difference]: With dead ends: 48 [2021-09-13 14:28:06,936 INFO L226 Difference]: Without dead ends: 44 [2021-09-13 14:28:06,936 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 104.38ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-09-13 14:28:06,937 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5401.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.77ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5407.05ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:06,937 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 167 Unknown, 0 Unchecked, 3.77ms Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 5407.05ms Time] [2021-09-13 14:28:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-09-13 14:28:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2021-09-13 14:28:06,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:06,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:28:06,943 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:28:06,943 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:28:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:06,944 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-09-13 14:28:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-09-13 14:28:06,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:06,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:06,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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 44 states. [2021-09-13 14:28:06,945 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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 44 states. [2021-09-13 14:28:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:06,947 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-09-13 14:28:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2021-09-13 14:28:06,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:06,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:06,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:06,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 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:28:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-09-13 14:28:06,949 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2021-09-13 14:28:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:06,949 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-09-13 14:28:06,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:28:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-09-13 14:28:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-13 14:28:06,950 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:06,950 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:28:06,962 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:28:07,163 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:28:07,163 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:28:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash 515746917, now seen corresponding path program 1 times [2021-09-13 14:28:07,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:28:07,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471445150] [2021-09-13 14:28:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:07,165 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:28:07,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:28:07,166 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:28:07,167 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:28:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:07,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:28:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:07,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:07,548 INFO L281 TraceCheckUtils]: 0: Hoare triple {572#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; {572#true} is VALID [2021-09-13 14:28:07,548 INFO L281 TraceCheckUtils]: 1: Hoare triple {572#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {572#true} is VALID [2021-09-13 14:28:07,548 INFO L281 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(0bv32 == assume_abort_if_not_~cond); {572#true} is VALID [2021-09-13 14:28:07,549 INFO L281 TraceCheckUtils]: 3: Hoare triple {572#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; {586#(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:28:07,550 INFO L281 TraceCheckUtils]: 4: Hoare triple {586#(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); {590#(bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))} is VALID [2021-09-13 14:28:07,551 INFO L281 TraceCheckUtils]: 5: Hoare triple {590#(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); {594#(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))))} is VALID [2021-09-13 14:28:07,551 INFO L281 TraceCheckUtils]: 6: Hoare triple {594#(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))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {594#(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))))} is VALID [2021-09-13 14:28:07,552 INFO L281 TraceCheckUtils]: 7: Hoare triple {594#(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))))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {594#(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))))} is VALID [2021-09-13 14:28:07,553 INFO L281 TraceCheckUtils]: 8: Hoare triple {594#(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))))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {573#false} is VALID [2021-09-13 14:28:07,553 INFO L281 TraceCheckUtils]: 9: Hoare triple {573#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {573#false} is VALID [2021-09-13 14:28:07,553 INFO L281 TraceCheckUtils]: 10: Hoare triple {573#false} assume 0bv32 == __VERIFIER_assert_~cond; {573#false} is VALID [2021-09-13 14:28:07,553 INFO L281 TraceCheckUtils]: 11: Hoare triple {573#false} assume !false; {573#false} is VALID [2021-09-13 14:28:07,554 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:28:07,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:07,815 INFO L281 TraceCheckUtils]: 11: Hoare triple {573#false} assume !false; {573#false} is VALID [2021-09-13 14:28:07,815 INFO L281 TraceCheckUtils]: 10: Hoare triple {573#false} assume 0bv32 == __VERIFIER_assert_~cond; {573#false} is VALID [2021-09-13 14:28:07,816 INFO L281 TraceCheckUtils]: 9: Hoare triple {573#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {573#false} is VALID [2021-09-13 14:28:07,816 INFO L281 TraceCheckUtils]: 8: Hoare triple {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {573#false} is VALID [2021-09-13 14:28:07,816 INFO L281 TraceCheckUtils]: 7: Hoare triple {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:28:07,817 INFO L281 TraceCheckUtils]: 6: Hoare triple {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:28:07,817 INFO L281 TraceCheckUtils]: 5: Hoare triple {632#(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); {622#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:28:07,818 INFO L281 TraceCheckUtils]: 4: Hoare triple {636#(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); {632#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~y~0)))} is VALID [2021-09-13 14:28:07,818 INFO L281 TraceCheckUtils]: 3: Hoare triple {572#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; {636#(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:28:07,819 INFO L281 TraceCheckUtils]: 2: Hoare triple {572#true} assume !(0bv32 == assume_abort_if_not_~cond); {572#true} is VALID [2021-09-13 14:28:07,819 INFO L281 TraceCheckUtils]: 1: Hoare triple {572#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {572#true} is VALID [2021-09-13 14:28:07,819 INFO L281 TraceCheckUtils]: 0: Hoare triple {572#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; {572#true} is VALID [2021-09-13 14:28:07,819 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:28:07,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:28:07,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471445150] [2021-09-13 14:28:07,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471445150] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:07,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:07,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-09-13 14:28:07,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969902849] [2021-09-13 14:28:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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 12 [2021-09-13 14:28:07,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:07,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:28:07,921 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:28:07,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:28:07,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:28:07,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:28:07,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:28:07,922 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:28:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:18,041 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-09-13 14:28:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-13 14:28:18,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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 12 [2021-09-13 14:28:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:28:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:28:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2021-09-13 14:28:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:28:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2021-09-13 14:28:18,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2021-09-13 14:28:18,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:18,365 INFO L225 Difference]: With dead ends: 43 [2021-09-13 14:28:18,365 INFO L226 Difference]: Without dead ends: 39 [2021-09-13 14:28:18,366 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 335.90ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:28:18,366 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4260.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.30ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 4263.76ms IncrementalHoareTripleChecker+Time [2021-09-13 14:28:18,367 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 184 Unknown, 0 Unchecked, 3.30ms Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 3 Unchecked, 4263.76ms Time] [2021-09-13 14:28:18,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-09-13 14:28:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-09-13 14:28:18,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:28:18,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:28:18,377 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:28:18,378 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:28:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:18,379 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-09-13 14:28:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:28:18,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:18,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:18,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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 39 states. [2021-09-13 14:28:18,380 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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 39 states. [2021-09-13 14:28:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:28:18,381 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-09-13 14:28:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:28:18,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:28:18,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:28:18,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:28:18,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:28:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 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:28:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-09-13 14:28:18,382 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2021-09-13 14:28:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:28:18,383 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-09-13 14:28:18,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:28:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-09-13 14:28:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-13 14:28:18,383 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:28:18,383 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:28:18,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 14:28:18,594 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:28:18,594 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:28:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:28:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1270616931, now seen corresponding path program 1 times [2021-09-13 14:28:18,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:28:18,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031239541] [2021-09-13 14:28:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:28:18,595 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:28:18,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:28:18,596 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:28:18,596 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:28:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:18,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:28:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:28:18,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:28:19,571 INFO L281 TraceCheckUtils]: 0: Hoare triple {828#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; {828#true} is VALID [2021-09-13 14:28:19,572 INFO L281 TraceCheckUtils]: 1: Hoare triple {828#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {836#(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:28:19,572 INFO L281 TraceCheckUtils]: 2: Hoare triple {836#(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); {840#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:28:19,573 INFO L281 TraceCheckUtils]: 3: Hoare triple {840#(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; {844#(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:28:19,573 INFO L281 TraceCheckUtils]: 4: Hoare triple {844#(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); {848#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:28:19,574 INFO L281 TraceCheckUtils]: 5: Hoare triple {848#(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); {852#(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:28:19,574 INFO L281 TraceCheckUtils]: 6: Hoare triple {852#(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); {852#(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:28:19,575 INFO L281 TraceCheckUtils]: 7: Hoare triple {852#(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; {852#(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:28:19,575 INFO L281 TraceCheckUtils]: 8: Hoare triple {852#(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));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {852#(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:28:19,576 INFO L281 TraceCheckUtils]: 9: Hoare triple {852#(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); {852#(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:28:19,576 INFO L281 TraceCheckUtils]: 10: Hoare triple {852#(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; {852#(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:28:19,577 INFO L281 TraceCheckUtils]: 11: Hoare triple {852#(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 !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {852#(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:28:19,577 INFO L281 TraceCheckUtils]: 12: Hoare triple {852#(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~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {852#(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:28:19,578 INFO L281 TraceCheckUtils]: 13: Hoare triple {852#(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~post11, 20bv32);havoc main_#t~post11;__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; {877#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:28:19,578 INFO L281 TraceCheckUtils]: 14: Hoare triple {877#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {829#false} is VALID [2021-09-13 14:28:19,578 INFO L281 TraceCheckUtils]: 15: Hoare triple {829#false} assume !false; {829#false} is VALID [2021-09-13 14:28:19,579 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:28:19,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:28:25,085 INFO L281 TraceCheckUtils]: 15: Hoare triple {829#false} assume !false; {829#false} is VALID [2021-09-13 14:28:25,086 INFO L281 TraceCheckUtils]: 14: Hoare triple {887#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {829#false} is VALID [2021-09-13 14:28:25,087 INFO L281 TraceCheckUtils]: 13: Hoare triple {891#(= (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~post11, 20bv32);havoc main_#t~post11;__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; {887#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:28:25,087 INFO L281 TraceCheckUtils]: 12: Hoare triple {891#(= (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~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {891#(= (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:28:25,087 INFO L281 TraceCheckUtils]: 11: Hoare triple {891#(= (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 !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {891#(= (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:28:25,088 INFO L281 TraceCheckUtils]: 10: Hoare triple {891#(= (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; {891#(= (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:28:25,088 INFO L281 TraceCheckUtils]: 9: Hoare triple {891#(= (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); {891#(= (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:28:25,088 INFO L281 TraceCheckUtils]: 8: Hoare triple {891#(= (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));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {891#(= (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:28:25,089 INFO L281 TraceCheckUtils]: 7: Hoare triple {891#(= (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; {891#(= (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:28:25,089 INFO L281 TraceCheckUtils]: 6: Hoare triple {891#(= (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); {891#(= (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:28:25,090 INFO L281 TraceCheckUtils]: 5: Hoare triple {828#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); {891#(= (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:28:25,090 INFO L281 TraceCheckUtils]: 4: Hoare triple {828#true} assume !(0bv32 == assume_abort_if_not_~cond); {828#true} is VALID [2021-09-13 14:28:25,090 INFO L281 TraceCheckUtils]: 3: Hoare triple {828#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; {828#true} is VALID [2021-09-13 14:28:25,090 INFO L281 TraceCheckUtils]: 2: Hoare triple {828#true} assume !(0bv32 == assume_abort_if_not_~cond); {828#true} is VALID [2021-09-13 14:28:25,090 INFO L281 TraceCheckUtils]: 1: Hoare triple {828#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {828#true} is VALID [2021-09-13 14:28:25,090 INFO L281 TraceCheckUtils]: 0: Hoare triple {828#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; {828#true} is VALID [2021-09-13 14:28:25,091 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:28:25,091 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:28:25,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031239541] [2021-09-13 14:28:25,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031239541] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:28:25,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:28:25,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:28:25,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348169371] [2021-09-13 14:28:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:28:25,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:28:25,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:28:25,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:28:25,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:28:25,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:28:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:28:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:28:25,456 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:29:06,829 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:29:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:12,832 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2021-09-13 14:29:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:29:12,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:29:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:29:12,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:29:12,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2021-09-13 14:29:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:29:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2021-09-13 14:29:12,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2021-09-13 14:29:13,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:29:13,910 INFO L225 Difference]: With dead ends: 80 [2021-09-13 14:29:13,910 INFO L226 Difference]: Without dead ends: 78 [2021-09-13 14:29:13,910 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 3236.79ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:29:13,911 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 290 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20992.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.62ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20996.93ms IncrementalHoareTripleChecker+Time [2021-09-13 14:29:13,911 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 6.62ms Time], IncrementalHoareTripleChecker [27 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 20996.93ms Time] [2021-09-13 14:29:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-09-13 14:29:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2021-09-13 14:29:13,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:29:13,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:29:13,939 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:29:13,939 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:29:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:13,942 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-09-13 14:29:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-09-13 14:29:13,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:13,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:13,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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) Second operand 78 states. [2021-09-13 14:29:13,948 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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) Second operand 78 states. [2021-09-13 14:29:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:13,950 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2021-09-13 14:29:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-09-13 14:29:13,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:13,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:13,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:29:13,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:29:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 52 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:29:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2021-09-13 14:29:13,952 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2021-09-13 14:29:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:29:13,952 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2021-09-13 14:29:13,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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:29:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2021-09-13 14:29:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-13 14:29:13,953 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:29:13,953 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:29:13,968 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:29:14,161 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:29:14,162 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:29:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:29:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash -648504839, now seen corresponding path program 1 times [2021-09-13 14:29:14,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:29:14,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344516918] [2021-09-13 14:29:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:29:14,163 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:29:14,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:29:14,164 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:29:14,165 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:29:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:14,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2021-09-13 14:29:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:14,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:29:14,494 INFO L281 TraceCheckUtils]: 0: Hoare triple {1265#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; {1270#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:14,494 INFO L281 TraceCheckUtils]: 1: Hoare triple {1270#(= ~counter~0 (_ bv0 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1270#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:14,495 INFO L281 TraceCheckUtils]: 2: Hoare triple {1270#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1270#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:14,495 INFO L281 TraceCheckUtils]: 3: Hoare triple {1270#(= ~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; {1270#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:14,495 INFO L281 TraceCheckUtils]: 4: Hoare triple {1270#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1270#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:14,495 INFO L281 TraceCheckUtils]: 5: Hoare triple {1270#(= ~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); {1270#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:14,496 INFO L281 TraceCheckUtils]: 6: Hoare triple {1270#(= ~counter~0 (_ bv0 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1289#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:29:14,496 INFO L281 TraceCheckUtils]: 7: Hoare triple {1289#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1289#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:29:14,498 INFO L281 TraceCheckUtils]: 8: Hoare triple {1289#(= ~counter~0 (_ bv1 32))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1289#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:29:14,499 INFO L281 TraceCheckUtils]: 9: Hoare triple {1289#(= ~counter~0 (_ bv1 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1299#(= (_ bv1 32) |ULTIMATE.start_main_#t~post10|)} is VALID [2021-09-13 14:29:14,499 INFO L281 TraceCheckUtils]: 10: Hoare triple {1299#(= (_ bv1 32) |ULTIMATE.start_main_#t~post10|)} assume !~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {1266#false} is VALID [2021-09-13 14:29:14,499 INFO L281 TraceCheckUtils]: 11: Hoare triple {1266#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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {1266#false} is VALID [2021-09-13 14:29:14,499 INFO L281 TraceCheckUtils]: 12: Hoare triple {1266#false} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1266#false} is VALID [2021-09-13 14:29:14,499 INFO L281 TraceCheckUtils]: 13: Hoare triple {1266#false} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1266#false} is VALID [2021-09-13 14:29:14,499 INFO L281 TraceCheckUtils]: 14: Hoare triple {1266#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1266#false} is VALID [2021-09-13 14:29:14,500 INFO L281 TraceCheckUtils]: 15: Hoare triple {1266#false} assume 0bv32 == __VERIFIER_assert_~cond; {1266#false} is VALID [2021-09-13 14:29:14,500 INFO L281 TraceCheckUtils]: 16: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2021-09-13 14:29:14,500 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:29:14,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:29:14,705 INFO L281 TraceCheckUtils]: 16: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2021-09-13 14:29:14,705 INFO L281 TraceCheckUtils]: 15: Hoare triple {1266#false} assume 0bv32 == __VERIFIER_assert_~cond; {1266#false} is VALID [2021-09-13 14:29:14,706 INFO L281 TraceCheckUtils]: 14: Hoare triple {1266#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1266#false} is VALID [2021-09-13 14:29:14,706 INFO L281 TraceCheckUtils]: 13: Hoare triple {1266#false} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1266#false} is VALID [2021-09-13 14:29:14,706 INFO L281 TraceCheckUtils]: 12: Hoare triple {1266#false} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1266#false} is VALID [2021-09-13 14:29:14,706 INFO L281 TraceCheckUtils]: 11: Hoare triple {1266#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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {1266#false} is VALID [2021-09-13 14:29:14,713 INFO L281 TraceCheckUtils]: 10: Hoare triple {1339#(bvslt |ULTIMATE.start_main_#t~post10| (_ bv20 32))} assume !~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {1266#false} is VALID [2021-09-13 14:29:14,713 INFO L281 TraceCheckUtils]: 9: Hoare triple {1343#(bvslt ~counter~0 (_ bv20 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1339#(bvslt |ULTIMATE.start_main_#t~post10| (_ bv20 32))} is VALID [2021-09-13 14:29:14,714 INFO L281 TraceCheckUtils]: 8: Hoare triple {1343#(bvslt ~counter~0 (_ bv20 32))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1343#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:14,714 INFO L281 TraceCheckUtils]: 7: Hoare triple {1343#(bvslt ~counter~0 (_ bv20 32))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1343#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:14,714 INFO L281 TraceCheckUtils]: 6: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1343#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:14,715 INFO L281 TraceCheckUtils]: 5: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ 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); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:14,715 INFO L281 TraceCheckUtils]: 4: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:14,715 INFO L281 TraceCheckUtils]: 3: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ 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; {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:14,716 INFO L281 TraceCheckUtils]: 2: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:14,716 INFO L281 TraceCheckUtils]: 1: Hoare triple {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:14,717 INFO L281 TraceCheckUtils]: 0: Hoare triple {1265#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; {1353#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:14,717 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:29:14,717 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:29:14,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344516918] [2021-09-13 14:29:14,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344516918] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:29:14,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:29:14,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-09-13 14:29:14,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882039367] [2021-09-13 14:29:14,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 17 [2021-09-13 14:29:14,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:29:14,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:14,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:29:14,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-13 14:29:14,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:29:14,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-13 14:29:14,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-09-13 14:29:14,921 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:27,581 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:29:32,967 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:29:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:42,228 INFO L93 Difference]: Finished difference Result 116 states and 140 transitions. [2021-09-13 14:29:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:29:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 17 [2021-09-13 14:29:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:29:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2021-09-13 14:29:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2021-09-13 14:29:42,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 116 transitions. [2021-09-13 14:29:43,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:29:43,179 INFO L225 Difference]: With dead ends: 116 [2021-09-13 14:29:43,180 INFO L226 Difference]: Without dead ends: 86 [2021-09-13 14:29:43,180 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 151.09ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:29:43,181 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11585.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.92ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11590.23ms IncrementalHoareTripleChecker+Time [2021-09-13 14:29:43,181 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 3.92ms Time], IncrementalHoareTripleChecker [7 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 11590.23ms Time] [2021-09-13 14:29:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-09-13 14:29:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2021-09-13 14:29:43,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:29:43,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 75 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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:29:43,227 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 75 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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:29:43,227 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 75 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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:29:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:43,229 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-09-13 14:29:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2021-09-13 14:29:43,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:43,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:43,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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 86 states. [2021-09-13 14:29:43,230 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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 86 states. [2021-09-13 14:29:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:29:43,231 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2021-09-13 14:29:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2021-09-13 14:29:43,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:29:43,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:29:43,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:29:43,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:29:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 74 states have internal predecessors, (95), 0 states have call successors, (0), 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:29:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2021-09-13 14:29:43,234 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 17 [2021-09-13 14:29:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:29:43,234 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2021-09-13 14:29:43,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2021-09-13 14:29:43,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:29:43,235 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:29:43,235 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:29:43,249 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:29:43,436 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:29:43,437 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:29:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:29:43,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1354097033, now seen corresponding path program 1 times [2021-09-13 14:29:43,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:29:43,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476896687] [2021-09-13 14:29:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:29:43,438 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:29:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:29:43,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:29:43,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-09-13 14:29:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:43,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:29:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:29:43,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:29:43,840 INFO L281 TraceCheckUtils]: 0: Hoare triple {1792#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; {1797#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:43,840 INFO L281 TraceCheckUtils]: 1: Hoare triple {1797#(= ~counter~0 (_ bv0 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1797#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:43,840 INFO L281 TraceCheckUtils]: 2: Hoare triple {1797#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1797#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:43,841 INFO L281 TraceCheckUtils]: 3: Hoare triple {1797#(= ~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; {1797#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:43,841 INFO L281 TraceCheckUtils]: 4: Hoare triple {1797#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1797#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:43,841 INFO L281 TraceCheckUtils]: 5: Hoare triple {1797#(= ~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); {1797#(= ~counter~0 (_ bv0 32))} is VALID [2021-09-13 14:29:43,841 INFO L281 TraceCheckUtils]: 6: Hoare triple {1797#(= ~counter~0 (_ bv0 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1816#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:29:43,842 INFO L281 TraceCheckUtils]: 7: Hoare triple {1816#(= ~counter~0 (_ bv1 32))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1816#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:29:43,842 INFO L281 TraceCheckUtils]: 8: Hoare triple {1816#(= ~counter~0 (_ bv1 32))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1816#(= ~counter~0 (_ bv1 32))} is VALID [2021-09-13 14:29:43,842 INFO L281 TraceCheckUtils]: 9: Hoare triple {1816#(= ~counter~0 (_ bv1 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1826#(= (_ bv2 32) ~counter~0)} is VALID [2021-09-13 14:29:43,843 INFO L281 TraceCheckUtils]: 10: Hoare triple {1826#(= (_ bv2 32) ~counter~0)} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {1826#(= (_ bv2 32) ~counter~0)} is VALID [2021-09-13 14:29:43,843 INFO L281 TraceCheckUtils]: 11: Hoare triple {1826#(= (_ bv2 32) ~counter~0)} assume !~bvsge64(main_~c~0, main_~b~0); {1826#(= (_ bv2 32) ~counter~0)} is VALID [2021-09-13 14:29:43,844 INFO L281 TraceCheckUtils]: 12: Hoare triple {1826#(= (_ bv2 32) ~counter~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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {1826#(= (_ bv2 32) ~counter~0)} is VALID [2021-09-13 14:29:43,845 INFO L281 TraceCheckUtils]: 13: Hoare triple {1826#(= (_ bv2 32) ~counter~0)} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1839#(= (_ bv2 32) |ULTIMATE.start_main_#t~post9|)} is VALID [2021-09-13 14:29:43,845 INFO L281 TraceCheckUtils]: 14: Hoare triple {1839#(= (_ bv2 32) |ULTIMATE.start_main_#t~post9|)} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1793#false} is VALID [2021-09-13 14:29:43,845 INFO L281 TraceCheckUtils]: 15: Hoare triple {1793#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1793#false} is VALID [2021-09-13 14:29:43,845 INFO L281 TraceCheckUtils]: 16: Hoare triple {1793#false} assume 0bv32 == __VERIFIER_assert_~cond; {1793#false} is VALID [2021-09-13 14:29:43,846 INFO L281 TraceCheckUtils]: 17: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2021-09-13 14:29:43,846 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:29:43,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:29:44,061 INFO L281 TraceCheckUtils]: 17: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2021-09-13 14:29:44,061 INFO L281 TraceCheckUtils]: 16: Hoare triple {1793#false} assume 0bv32 == __VERIFIER_assert_~cond; {1793#false} is VALID [2021-09-13 14:29:44,061 INFO L281 TraceCheckUtils]: 15: Hoare triple {1793#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1793#false} is VALID [2021-09-13 14:29:44,061 INFO L281 TraceCheckUtils]: 14: Hoare triple {1861#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv20 32))} assume !~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1793#false} is VALID [2021-09-13 14:29:44,069 INFO L281 TraceCheckUtils]: 13: Hoare triple {1865#(bvslt ~counter~0 (_ bv20 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1861#(bvslt |ULTIMATE.start_main_#t~post9| (_ bv20 32))} is VALID [2021-09-13 14:29:44,069 INFO L281 TraceCheckUtils]: 12: Hoare triple {1865#(bvslt ~counter~0 (_ bv20 32))} 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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {1865#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:44,069 INFO L281 TraceCheckUtils]: 11: Hoare triple {1865#(bvslt ~counter~0 (_ bv20 32))} assume !~bvsge64(main_~c~0, main_~b~0); {1865#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:44,070 INFO L281 TraceCheckUtils]: 10: Hoare triple {1865#(bvslt ~counter~0 (_ bv20 32))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {1865#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:44,070 INFO L281 TraceCheckUtils]: 9: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {1865#(bvslt ~counter~0 (_ bv20 32))} is VALID [2021-09-13 14:29:44,070 INFO L281 TraceCheckUtils]: 8: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:44,070 INFO L281 TraceCheckUtils]: 7: Hoare triple {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:44,073 INFO L281 TraceCheckUtils]: 6: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {1878#(bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv20 32))} is VALID [2021-09-13 14:29:44,073 INFO L281 TraceCheckUtils]: 5: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~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); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} is VALID [2021-09-13 14:29:44,073 INFO L281 TraceCheckUtils]: 4: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} is VALID [2021-09-13 14:29:44,073 INFO L281 TraceCheckUtils]: 3: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~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; {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} is VALID [2021-09-13 14:29:44,074 INFO L281 TraceCheckUtils]: 2: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} assume !(0bv32 == assume_abort_if_not_~cond); {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} is VALID [2021-09-13 14:29:44,074 INFO L281 TraceCheckUtils]: 1: Hoare triple {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} is VALID [2021-09-13 14:29:44,075 INFO L281 TraceCheckUtils]: 0: Hoare triple {1792#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; {1888#(bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv20 32))} is VALID [2021-09-13 14:29:44,075 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:29:44,075 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:29:44,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476896687] [2021-09-13 14:29:44,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476896687] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:29:44,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:29:44,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-09-13 14:29:44,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197163784] [2021-09-13 14:29:44,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:29:44,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:29:44,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:29:44,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:29:44,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:29:44,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:29:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:29:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:29:44,327 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:29:57,061 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:29:59,428 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:30:01,208 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:30:03,153 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:30:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:21,044 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2021-09-13 14:30:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:30:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:30:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:30:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:30:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2021-09-13 14:30:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:30:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2021-09-13 14:30:21,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 143 transitions. [2021-09-13 14:30:22,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:30:22,496 INFO L225 Difference]: With dead ends: 156 [2021-09-13 14:30:22,497 INFO L226 Difference]: Without dead ends: 152 [2021-09-13 14:30:22,497 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 300.83ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-09-13 14:30:22,497 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16991.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.94ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16997.09ms IncrementalHoareTripleChecker+Time [2021-09-13 14:30:22,498 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 5.94ms Time], IncrementalHoareTripleChecker [20 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 16997.09ms Time] [2021-09-13 14:30:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-09-13 14:30:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 93. [2021-09-13 14:30:22,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:30:22,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 93 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 92 states have internal predecessors, (120), 0 states have call successors, (0), 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:30:22,560 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 93 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 92 states have internal predecessors, (120), 0 states have call successors, (0), 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:30:22,561 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 93 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 92 states have internal predecessors, (120), 0 states have call successors, (0), 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:30:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:22,563 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2021-09-13 14:30:22,563 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-09-13 14:30:22,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:22,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:22,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 92 states have internal predecessors, (120), 0 states have call successors, (0), 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 152 states. [2021-09-13 14:30:22,564 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 92 states have internal predecessors, (120), 0 states have call successors, (0), 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 152 states. [2021-09-13 14:30:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:30:22,567 INFO L93 Difference]: Finished difference Result 152 states and 180 transitions. [2021-09-13 14:30:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-09-13 14:30:22,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:30:22,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:30:22,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:30:22,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:30:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 92 states have internal predecessors, (120), 0 states have call successors, (0), 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:30:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2021-09-13 14:30:22,570 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 18 [2021-09-13 14:30:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:30:22,570 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2021-09-13 14:30:22,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:30:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2021-09-13 14:30:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 14:30:22,571 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:30:22,571 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:30:22,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-09-13 14:30:22,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:30:22,777 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:30:22,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:30:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1292001664, now seen corresponding path program 1 times [2021-09-13 14:30:22,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:30:22,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006422979] [2021-09-13 14:30:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:30:22,778 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:30:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:30:22,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:30:22,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-09-13 14:30:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:22,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2021-09-13 14:30:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:30:22,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:30:23,888 INFO L281 TraceCheckUtils]: 0: Hoare triple {2544#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; {2544#true} is VALID [2021-09-13 14:30:23,889 INFO L281 TraceCheckUtils]: 1: Hoare triple {2544#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {2552#(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:30:23,889 INFO L281 TraceCheckUtils]: 2: Hoare triple {2552#(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); {2556#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:30:23,890 INFO L281 TraceCheckUtils]: 3: Hoare triple {2556#(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; {2560#(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:30:23,890 INFO L281 TraceCheckUtils]: 4: Hoare triple {2560#(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); {2564#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:30:23,891 INFO L281 TraceCheckUtils]: 5: Hoare triple {2564#(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); {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,891 INFO L281 TraceCheckUtils]: 6: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,892 INFO L281 TraceCheckUtils]: 7: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,893 INFO L281 TraceCheckUtils]: 8: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,893 INFO L281 TraceCheckUtils]: 9: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,894 INFO L281 TraceCheckUtils]: 10: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,895 INFO L281 TraceCheckUtils]: 11: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,896 INFO L281 TraceCheckUtils]: 12: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,896 INFO L281 TraceCheckUtils]: 13: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!~bvslt32(main_#t~post11, 20bv32);havoc main_#t~post11;__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; {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,897 INFO L281 TraceCheckUtils]: 14: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:30:23,897 INFO L281 TraceCheckUtils]: 15: Hoare triple {2568#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2599#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:30:23,898 INFO L281 TraceCheckUtils]: 16: Hoare triple {2599#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {2545#false} is VALID [2021-09-13 14:30:23,898 INFO L281 TraceCheckUtils]: 17: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2021-09-13 14:30:23,898 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:30:23,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:30:34,104 INFO L281 TraceCheckUtils]: 17: Hoare triple {2545#false} assume !false; {2545#false} is VALID [2021-09-13 14:30:34,104 INFO L281 TraceCheckUtils]: 16: Hoare triple {2609#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {2545#false} is VALID [2021-09-13 14:30:34,105 INFO L281 TraceCheckUtils]: 15: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2609#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:30:34,105 INFO L281 TraceCheckUtils]: 14: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,105 INFO L281 TraceCheckUtils]: 13: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvslt32(main_#t~post11, 20bv32);havoc main_#t~post11;__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; {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,105 INFO L281 TraceCheckUtils]: 12: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,106 INFO L281 TraceCheckUtils]: 11: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,106 INFO L281 TraceCheckUtils]: 10: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,107 INFO L281 TraceCheckUtils]: 9: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,107 INFO L281 TraceCheckUtils]: 8: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,107 INFO L281 TraceCheckUtils]: 7: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,107 INFO L281 TraceCheckUtils]: 6: Hoare triple {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,108 INFO L281 TraceCheckUtils]: 5: Hoare triple {2544#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); {2613#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:30:34,108 INFO L281 TraceCheckUtils]: 4: Hoare triple {2544#true} assume !(0bv32 == assume_abort_if_not_~cond); {2544#true} is VALID [2021-09-13 14:30:34,108 INFO L281 TraceCheckUtils]: 3: Hoare triple {2544#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; {2544#true} is VALID [2021-09-13 14:30:34,108 INFO L281 TraceCheckUtils]: 2: Hoare triple {2544#true} assume !(0bv32 == assume_abort_if_not_~cond); {2544#true} is VALID [2021-09-13 14:30:34,108 INFO L281 TraceCheckUtils]: 1: Hoare triple {2544#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {2544#true} is VALID [2021-09-13 14:30:34,108 INFO L281 TraceCheckUtils]: 0: Hoare triple {2544#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; {2544#true} is VALID [2021-09-13 14:30:34,108 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:30:34,109 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:30:34,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006422979] [2021-09-13 14:30:34,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006422979] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:30:34,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:30:34,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [] total 10 [2021-09-13 14:30:34,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136003423] [2021-09-13 14:30:34,110 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:30:34,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:30:34,110 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:30:34,835 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:30:34,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-09-13 14:30:34,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:30:34,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-09-13 14:30:34,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-09-13 14:30:34,836 INFO L87 Difference]: Start difference. First operand 93 states and 120 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:31:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:28,986 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2021-09-13 14:31:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:31:28,986 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:31:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. 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:31:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2021-09-13 14:31:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. 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:31:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 95 transitions. [2021-09-13 14:31:28,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 95 transitions. [2021-09-13 14:31:29,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:29,948 INFO L225 Difference]: With dead ends: 126 [2021-09-13 14:31:29,948 INFO L226 Difference]: Without dead ends: 124 [2021-09-13 14:31:29,949 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5182.91ms TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:31:29,949 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24764.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.95ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24769.92ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:29,949 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 297 Unknown, 0 Unchecked, 4.95ms Time], IncrementalHoareTripleChecker [27 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 24769.92ms Time] [2021-09-13 14:31:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-09-13 14:31:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 93. [2021-09-13 14:31:30,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:30,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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:31:30,044 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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:31:30,044 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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:31:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:30,046 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2021-09-13 14:31:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-09-13 14:31:30,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:30,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:30,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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 124 states. [2021-09-13 14:31:30,047 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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 124 states. [2021-09-13 14:31:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:30,049 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2021-09-13 14:31:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2021-09-13 14:31:30,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:30,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:30,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:30,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 92 states have internal predecessors, (117), 0 states have call successors, (0), 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:31:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2021-09-13 14:31:30,050 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 18 [2021-09-13 14:31:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:30,051 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2021-09-13 14:31:30,051 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2021-09-13 14:31:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2021-09-13 14:31:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-13 14:31:30,051 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:30,051 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:31:30,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-09-13 14:31:30,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:31:30,252 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:31:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash 971917338, now seen corresponding path program 1 times [2021-09-13 14:31:30,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:31:30,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709561101] [2021-09-13 14:31:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:30,253 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:31:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:31:30,253 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:31:30,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-09-13 14:31:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:30,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 14:31:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:30,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:30,839 INFO L281 TraceCheckUtils]: 0: Hoare triple {3205#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; {3205#true} is VALID [2021-09-13 14:31:30,840 INFO L281 TraceCheckUtils]: 1: Hoare triple {3205#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {3213#(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:31:30,840 INFO L281 TraceCheckUtils]: 2: Hoare triple {3213#(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); {3217#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:31:30,840 INFO L281 TraceCheckUtils]: 3: Hoare triple {3217#(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; {3217#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:31:30,841 INFO L281 TraceCheckUtils]: 4: Hoare triple {3217#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} assume !(0bv32 == assume_abort_if_not_~cond); {3217#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:31:30,842 INFO L281 TraceCheckUtils]: 5: Hoare triple {3217#(bvsge ULTIMATE.start_main_~x~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); {3227#(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:31:30,842 INFO L281 TraceCheckUtils]: 6: Hoare triple {3227#(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); {3227#(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:31:30,843 INFO L281 TraceCheckUtils]: 7: Hoare triple {3227#(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; {3227#(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:31:30,843 INFO L281 TraceCheckUtils]: 8: Hoare triple {3227#(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));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {3237#(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_~c~0)))} is VALID [2021-09-13 14:31:30,843 INFO L281 TraceCheckUtils]: 9: Hoare triple {3237#(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_~c~0)))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {3237#(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_~c~0)))} is VALID [2021-09-13 14:31:30,844 INFO L281 TraceCheckUtils]: 10: Hoare triple {3237#(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_~c~0)))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {3237#(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_~c~0)))} is VALID [2021-09-13 14:31:30,844 INFO L281 TraceCheckUtils]: 11: Hoare triple {3237#(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_~c~0)))} assume !~bvsge64(main_~c~0, main_~b~0); {3237#(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_~c~0)))} is VALID [2021-09-13 14:31:30,844 INFO L281 TraceCheckUtils]: 12: Hoare triple {3237#(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_~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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {3250#(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_~b~0)))} is VALID [2021-09-13 14:31:30,845 INFO L281 TraceCheckUtils]: 13: Hoare triple {3250#(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_~b~0)))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {3250#(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_~b~0)))} is VALID [2021-09-13 14:31:30,845 INFO L281 TraceCheckUtils]: 14: Hoare triple {3250#(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_~b~0)))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {3250#(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_~b~0)))} is VALID [2021-09-13 14:31:30,846 INFO L281 TraceCheckUtils]: 15: Hoare triple {3250#(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_~b~0)))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {3206#false} is VALID [2021-09-13 14:31:30,846 INFO L281 TraceCheckUtils]: 16: Hoare triple {3206#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3206#false} is VALID [2021-09-13 14:31:30,846 INFO L281 TraceCheckUtils]: 17: Hoare triple {3206#false} assume 0bv32 == __VERIFIER_assert_~cond; {3206#false} is VALID [2021-09-13 14:31:30,846 INFO L281 TraceCheckUtils]: 18: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2021-09-13 14:31:30,846 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:31:30,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:31,344 INFO L281 TraceCheckUtils]: 18: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2021-09-13 14:31:31,344 INFO L281 TraceCheckUtils]: 17: Hoare triple {3206#false} assume 0bv32 == __VERIFIER_assert_~cond; {3206#false} is VALID [2021-09-13 14:31:31,344 INFO L281 TraceCheckUtils]: 16: Hoare triple {3206#false} __VERIFIER_assert_#in~cond := (if ~bvsub64(~bvadd64(~bvsub64(~bvmul64(main_~p~0, ~sign_extendFrom32To64(main_~x~0)), ~bvmul64(main_~q~0, ~sign_extendFrom32To64(main_~x~0))), ~bvmul64(main_~r~0, ~sign_extendFrom32To64(main_~y~0))), ~bvmul64(main_~s~0, ~sign_extendFrom32To64(main_~y~0))) == main_~a~0 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3206#false} is VALID [2021-09-13 14:31:31,345 INFO L281 TraceCheckUtils]: 15: Hoare triple {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !(main_~b~0 != ~sign_extendFrom32To64(0bv32)); {3206#false} is VALID [2021-09-13 14:31:31,345 INFO L281 TraceCheckUtils]: 14: Hoare triple {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:31,345 INFO L281 TraceCheckUtils]: 13: Hoare triple {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:31,346 INFO L281 TraceCheckUtils]: 12: Hoare triple {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) 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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {3278#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~b~0))} is VALID [2021-09-13 14:31:31,346 INFO L281 TraceCheckUtils]: 11: Hoare triple {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !~bvsge64(main_~c~0, main_~b~0); {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:31:31,346 INFO L281 TraceCheckUtils]: 10: Hoare triple {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:31:31,347 INFO L281 TraceCheckUtils]: 9: Hoare triple {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:31:31,347 INFO L281 TraceCheckUtils]: 8: Hoare triple {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {3288#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~c~0))} is VALID [2021-09-13 14:31:31,347 INFO L281 TraceCheckUtils]: 7: Hoare triple {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:31,347 INFO L281 TraceCheckUtils]: 6: Hoare triple {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:31,348 INFO L281 TraceCheckUtils]: 5: Hoare triple {3311#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~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); {3301#(not (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~a~0))} is VALID [2021-09-13 14:31:31,348 INFO L281 TraceCheckUtils]: 4: Hoare triple {3311#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} assume !(0bv32 == assume_abort_if_not_~cond); {3311#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:31:31,349 INFO L281 TraceCheckUtils]: 3: Hoare triple {3311#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} 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; {3311#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:31:31,349 INFO L281 TraceCheckUtils]: 2: Hoare triple {3321#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == assume_abort_if_not_~cond); {3311#(not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0)))} is VALID [2021-09-13 14:31:31,349 INFO L281 TraceCheckUtils]: 1: Hoare triple {3205#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {3321#(or (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ULTIMATE.start_main_~x~0))) (= ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2021-09-13 14:31:31,350 INFO L281 TraceCheckUtils]: 0: Hoare triple {3205#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; {3205#true} is VALID [2021-09-13 14:31:31,350 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:31:31,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:31:31,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709561101] [2021-09-13 14:31:31,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709561101] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:31:31,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:31:31,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-09-13 14:31:31,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016687343] [2021-09-13 14:31:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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 19 [2021-09-13 14:31:31,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:31,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:31:31,581 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:31:31,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:31:31,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:31:31,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:31:31,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:31:31,582 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:31:44,862 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:31:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:45,020 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2021-09-13 14:31:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 14:31:45,020 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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 19 [2021-09-13 14:31:45,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:31:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:31:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2021-09-13 14:31:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:31:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2021-09-13 14:31:45,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2021-09-13 14:31:45,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:45,657 INFO L225 Difference]: With dead ends: 97 [2021-09-13 14:31:45,657 INFO L226 Difference]: Without dead ends: 93 [2021-09-13 14:31:45,657 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 555.52ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:31:45,657 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6561.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.81ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 6563.60ms IncrementalHoareTripleChecker+Time [2021-09-13 14:31:45,657 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 1.81ms Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 44 Unchecked, 6563.60ms Time] [2021-09-13 14:31:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-09-13 14:31:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-09-13 14:31:45,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:31:45,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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:31:45,748 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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:31:45,749 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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:31:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:45,750 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2021-09-13 14:31:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:31:45,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:45,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:45,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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 93 states. [2021-09-13 14:31:45,753 INFO L87 Difference]: Start difference. First operand has 93 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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 93 states. [2021-09-13 14:31:45,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:31:45,769 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2021-09-13 14:31:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:31:45,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:31:45,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:31:45,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:31:45,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:31:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 92 states have internal predecessors, (116), 0 states have call successors, (0), 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:31:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2021-09-13 14:31:45,771 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 19 [2021-09-13 14:31:45,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:31:45,771 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2021-09-13 14:31:45,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:31:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2021-09-13 14:31:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-13 14:31:45,772 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:31:45,772 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:31:45,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-09-13 14:31:45,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:31:45,972 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:31:45,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:31:45,973 INFO L82 PathProgramCache]: Analyzing trace with hash -367893245, now seen corresponding path program 1 times [2021-09-13 14:31:45,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:31:45,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883158006] [2021-09-13 14:31:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:31:45,973 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:31:45,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:31:45,974 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:31:45,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-09-13 14:31:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:46,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 14:31:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:31:46,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:31:47,255 INFO L281 TraceCheckUtils]: 0: Hoare triple {3767#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; {3767#true} is VALID [2021-09-13 14:31:47,256 INFO L281 TraceCheckUtils]: 1: Hoare triple {3767#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {3775#(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:31:47,257 INFO L281 TraceCheckUtils]: 2: Hoare triple {3775#(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); {3779#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:31:47,257 INFO L281 TraceCheckUtils]: 3: Hoare triple {3779#(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; {3783#(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:31:47,258 INFO L281 TraceCheckUtils]: 4: Hoare triple {3783#(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); {3787#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:31:47,259 INFO L281 TraceCheckUtils]: 5: Hoare triple {3787#(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); {3791#(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)))))} is VALID [2021-09-13 14:31:47,260 INFO L281 TraceCheckUtils]: 6: Hoare triple {3791#(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)))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {3791#(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)))))} is VALID [2021-09-13 14:31:47,260 INFO L281 TraceCheckUtils]: 7: Hoare triple {3791#(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)))))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {3791#(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)))))} is VALID [2021-09-13 14:31:47,261 INFO L281 TraceCheckUtils]: 8: Hoare triple {3791#(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)))))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,261 INFO L281 TraceCheckUtils]: 9: Hoare triple {3801#(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_~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)))))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,262 INFO L281 TraceCheckUtils]: 10: Hoare triple {3801#(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_~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)))))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,262 INFO L281 TraceCheckUtils]: 11: Hoare triple {3801#(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_~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)))))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,263 INFO L281 TraceCheckUtils]: 12: Hoare triple {3801#(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_~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)))))} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,264 INFO L281 TraceCheckUtils]: 13: Hoare triple {3801#(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_~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)))))} assume !!~bvslt32(main_#t~post11, 20bv32);havoc main_#t~post11;__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; {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,264 INFO L281 TraceCheckUtils]: 14: Hoare triple {3801#(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_~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)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,265 INFO L281 TraceCheckUtils]: 15: Hoare triple {3801#(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_~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)))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,265 INFO L281 TraceCheckUtils]: 16: Hoare triple {3801#(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_~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)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {3801#(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_~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)))))} is VALID [2021-09-13 14:31:47,266 INFO L281 TraceCheckUtils]: 17: Hoare triple {3801#(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_~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)))))} __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; {3829#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:31:47,266 INFO L281 TraceCheckUtils]: 18: Hoare triple {3829#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {3768#false} is VALID [2021-09-13 14:31:47,266 INFO L281 TraceCheckUtils]: 19: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2021-09-13 14:31:47,267 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:31:47,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:31:50,574 INFO L281 TraceCheckUtils]: 19: Hoare triple {3768#false} assume !false; {3768#false} is VALID [2021-09-13 14:31:50,574 INFO L281 TraceCheckUtils]: 18: Hoare triple {3839#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {3768#false} is VALID [2021-09-13 14:31:50,575 INFO L281 TraceCheckUtils]: 17: Hoare triple {3843#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} __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; {3839#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:31:50,575 INFO L281 TraceCheckUtils]: 16: Hoare triple {3843#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {3843#(= 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:31:50,575 INFO L281 TraceCheckUtils]: 15: Hoare triple {3843#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3843#(= 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:31:50,576 INFO L281 TraceCheckUtils]: 14: Hoare triple {3843#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !(0bv32 == __VERIFIER_assert_~cond); {3843#(= 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:31:50,576 INFO L281 TraceCheckUtils]: 13: Hoare triple {3843#(= 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~post11, 20bv32);havoc main_#t~post11;__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; {3843#(= 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:31:50,576 INFO L281 TraceCheckUtils]: 12: Hoare triple {3843#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {3843#(= 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:31:50,577 INFO L281 TraceCheckUtils]: 11: Hoare triple {3843#(= ULTIMATE.start_main_~a~0 (bvadd (bvmul ULTIMATE.start_main_~b~0 ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~c~0))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {3843#(= 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:31:50,577 INFO L281 TraceCheckUtils]: 10: Hoare triple {3843#(= 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; {3843#(= 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:31:50,577 INFO L281 TraceCheckUtils]: 9: Hoare triple {3843#(= 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); {3843#(= 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:31:50,578 INFO L281 TraceCheckUtils]: 8: Hoare triple {3767#true} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {3843#(= 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:31:50,578 INFO L281 TraceCheckUtils]: 7: Hoare triple {3767#true} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {3767#true} is VALID [2021-09-13 14:31:50,578 INFO L281 TraceCheckUtils]: 6: Hoare triple {3767#true} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {3767#true} is VALID [2021-09-13 14:31:50,578 INFO L281 TraceCheckUtils]: 5: Hoare triple {3767#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); {3767#true} is VALID [2021-09-13 14:31:50,578 INFO L281 TraceCheckUtils]: 4: Hoare triple {3767#true} assume !(0bv32 == assume_abort_if_not_~cond); {3767#true} is VALID [2021-09-13 14:31:50,578 INFO L281 TraceCheckUtils]: 3: Hoare triple {3767#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; {3767#true} is VALID [2021-09-13 14:31:50,579 INFO L281 TraceCheckUtils]: 2: Hoare triple {3767#true} assume !(0bv32 == assume_abort_if_not_~cond); {3767#true} is VALID [2021-09-13 14:31:50,579 INFO L281 TraceCheckUtils]: 1: Hoare triple {3767#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {3767#true} is VALID [2021-09-13 14:31:50,579 INFO L281 TraceCheckUtils]: 0: Hoare triple {3767#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; {3767#true} is VALID [2021-09-13 14:31:50,579 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:31:50,579 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:31:50,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883158006] [2021-09-13 14:31:50,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883158006] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:31:50,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:31:50,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 4] imperfect sequences [] total 11 [2021-09-13 14:31:50,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533865988] [2021-09-13 14:31:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:31:50,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:31:50,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:31:51,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:31:51,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-09-13 14:31:51,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:31:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-09-13 14:31:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:31:51,143 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:32:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:22,557 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2021-09-13 14:32:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-09-13 14:32:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:32:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:32:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2021-09-13 14:32:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:32:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 81 transitions. [2021-09-13 14:32:22,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 81 transitions. [2021-09-13 14:32:23,608 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:32:23,609 INFO L225 Difference]: With dead ends: 120 [2021-09-13 14:32:23,609 INFO L226 Difference]: Without dead ends: 118 [2021-09-13 14:32:23,610 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2274.15ms TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-09-13 14:32:23,610 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13480.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 13483.99ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:23,610 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 45 Unchecked, 13483.99ms Time] [2021-09-13 14:32:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-09-13 14:32:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2021-09-13 14:32:23,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:23,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 103 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 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:32:23,699 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 103 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 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:32:23,699 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 103 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 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:32:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:23,701 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-09-13 14:32:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2021-09-13 14:32:23,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:23,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 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 118 states. [2021-09-13 14:32:23,702 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 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 118 states. [2021-09-13 14:32:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:23,703 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2021-09-13 14:32:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2021-09-13 14:32:23,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:23,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:23,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:23,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 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:32:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2021-09-13 14:32:23,705 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 20 [2021-09-13 14:32:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:23,705 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2021-09-13 14:32:23,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 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:32:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2021-09-13 14:32:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 14:32:23,706 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:23,706 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:32:23,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-09-13 14:32:23,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:32:23,918 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:23,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1357932506, now seen corresponding path program 1 times [2021-09-13 14:32:23,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:32:23,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769759222] [2021-09-13 14:32:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:23,919 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:32:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:32:23,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:32:23,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-09-13 14:32:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:24,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2021-09-13 14:32:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:24,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:24,799 INFO L281 TraceCheckUtils]: 0: Hoare triple {4433#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; {4433#true} is VALID [2021-09-13 14:32:24,799 INFO L281 TraceCheckUtils]: 1: Hoare triple {4433#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {4433#true} is VALID [2021-09-13 14:32:24,800 INFO L281 TraceCheckUtils]: 2: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:32:24,800 INFO L281 TraceCheckUtils]: 3: Hoare triple {4433#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; {4447#(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:32:24,801 INFO L281 TraceCheckUtils]: 4: Hoare triple {4447#(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); {4451#(bvsge ULTIMATE.start_main_~y~0 (_ bv1 32))} is VALID [2021-09-13 14:32:24,802 INFO L281 TraceCheckUtils]: 5: Hoare triple {4451#(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); {4455#(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))))} is VALID [2021-09-13 14:32:24,802 INFO L281 TraceCheckUtils]: 6: Hoare triple {4455#(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))))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {4455#(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))))} is VALID [2021-09-13 14:32:24,803 INFO L281 TraceCheckUtils]: 7: Hoare triple {4455#(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))))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {4455#(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))))} is VALID [2021-09-13 14:32:24,803 INFO L281 TraceCheckUtils]: 8: Hoare triple {4455#(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))))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {4455#(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))))} is VALID [2021-09-13 14:32:24,803 INFO L281 TraceCheckUtils]: 9: Hoare triple {4455#(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))))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {4455#(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))))} is VALID [2021-09-13 14:32:24,804 INFO L281 TraceCheckUtils]: 10: Hoare triple {4455#(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))))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {4455#(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))))} is VALID [2021-09-13 14:32:24,804 INFO L281 TraceCheckUtils]: 11: Hoare triple {4455#(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))))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,804 INFO L281 TraceCheckUtils]: 12: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,805 INFO L281 TraceCheckUtils]: 13: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} assume !!~bvslt32(main_#t~post11, 20bv32);havoc main_#t~post11;__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; {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,805 INFO L281 TraceCheckUtils]: 14: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,806 INFO L281 TraceCheckUtils]: 15: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,807 INFO L281 TraceCheckUtils]: 16: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,807 INFO L281 TraceCheckUtils]: 17: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} __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; {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,807 INFO L281 TraceCheckUtils]: 18: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} assume !(0bv32 == __VERIFIER_assert_~cond); {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} is VALID [2021-09-13 14:32:24,808 INFO L281 TraceCheckUtils]: 19: Hoare triple {4474#(and (= ULTIMATE.start_main_~v~0 ULTIMATE.start_main_~b~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~d~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)))))} __VERIFIER_assert_#in~cond := (if main_~v~0 == ~bvmul64(main_~b~0, main_~d~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4499#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:32:24,808 INFO L281 TraceCheckUtils]: 20: Hoare triple {4499#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {4434#false} is VALID [2021-09-13 14:32:24,808 INFO L281 TraceCheckUtils]: 21: Hoare triple {4434#false} assume !false; {4434#false} is VALID [2021-09-13 14:32:24,808 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:32:24,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:32:27,293 INFO L281 TraceCheckUtils]: 21: Hoare triple {4434#false} assume !false; {4434#false} is VALID [2021-09-13 14:32:27,293 INFO L281 TraceCheckUtils]: 20: Hoare triple {4509#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {4434#false} is VALID [2021-09-13 14:32:27,295 INFO L281 TraceCheckUtils]: 19: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~v~0 == ~bvmul64(main_~b~0, main_~d~0) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4509#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:32:27,295 INFO L281 TraceCheckUtils]: 18: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,295 INFO L281 TraceCheckUtils]: 17: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __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; {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,295 INFO L281 TraceCheckUtils]: 16: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,296 INFO L281 TraceCheckUtils]: 15: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} __VERIFIER_assert_#in~cond := (if main_~b~0 == ~bvadd64(~bvmul64(~sign_extendFrom32To64(main_~x~0), main_~q~0), ~bvmul64(~sign_extendFrom32To64(main_~y~0), main_~s~0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,296 INFO L281 TraceCheckUtils]: 14: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !(0bv32 == __VERIFIER_assert_~cond); {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,296 INFO L281 TraceCheckUtils]: 13: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} assume !!~bvslt32(main_#t~post11, 20bv32);havoc main_#t~post11;__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; {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,296 INFO L281 TraceCheckUtils]: 12: Hoare triple {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,297 INFO L281 TraceCheckUtils]: 11: Hoare triple {4433#true} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {4513#(= (bvmul ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~b~0) ULTIMATE.start_main_~v~0)} is VALID [2021-09-13 14:32:27,297 INFO L281 TraceCheckUtils]: 10: Hoare triple {4433#true} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 9: Hoare triple {4433#true} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 8: Hoare triple {4433#true} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 7: Hoare triple {4433#true} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 6: Hoare triple {4433#true} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 5: Hoare triple {4433#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); {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 4: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 3: Hoare triple {4433#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; {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 2: Hoare triple {4433#true} assume !(0bv32 == assume_abort_if_not_~cond); {4433#true} is VALID [2021-09-13 14:32:27,298 INFO L281 TraceCheckUtils]: 1: Hoare triple {4433#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {4433#true} is VALID [2021-09-13 14:32:27,299 INFO L281 TraceCheckUtils]: 0: Hoare triple {4433#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; {4433#true} is VALID [2021-09-13 14:32:27,299 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:32:27,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:32:27,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769759222] [2021-09-13 14:32:27,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769759222] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 14:32:27,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 14:32:27,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2021-09-13 14:32:27,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815256751] [2021-09-13 14:32:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:27,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:32:27,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:27,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:27,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-13 14:32:27,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:32:27,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-13 14:32:27,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-13 14:32:27,762 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:48,274 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2021-09-13 14:32:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-09-13 14:32:48,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 14:32:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2021-09-13 14:32:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2021-09-13 14:32:48,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 86 transitions. [2021-09-13 14:32:49,266 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:32:49,268 INFO L225 Difference]: With dead ends: 137 [2021-09-13 14:32:49,268 INFO L226 Difference]: Without dead ends: 135 [2021-09-13 14:32:49,268 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1224.57ms TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-09-13 14:32:49,269 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8326.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.90ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 8329.42ms IncrementalHoareTripleChecker+Time [2021-09-13 14:32:49,269 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 1.90ms Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 63 Unchecked, 8329.42ms Time] [2021-09-13 14:32:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-09-13 14:32:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2021-09-13 14:32:49,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 14:32:49,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 121 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 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:32:49,388 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 121 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 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:32:49,388 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 121 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 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:32:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:49,389 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2021-09-13 14:32:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2021-09-13 14:32:49,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:49,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:49,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 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 135 states. [2021-09-13 14:32:49,390 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 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 135 states. [2021-09-13 14:32:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 14:32:49,392 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2021-09-13 14:32:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2021-09-13 14:32:49,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 14:32:49,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 14:32:49,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 14:32:49,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 14:32:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 120 states have internal predecessors, (153), 0 states have call successors, (0), 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:32:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2021-09-13 14:32:49,394 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 22 [2021-09-13 14:32:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 14:32:49,394 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2021-09-13 14:32:49,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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:32:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2021-09-13 14:32:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-13 14:32:49,395 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 14:32:49,395 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 14:32:49,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-09-13 14:32:49,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:32:49,602 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-09-13 14:32:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 14:32:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1235592658, now seen corresponding path program 1 times [2021-09-13 14:32:49,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 14:32:49,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657059163] [2021-09-13 14:32:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 14:32:49,602 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 14:32:49,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 14:32:49,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 14:32:49,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-09-13 14:32:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:49,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2021-09-13 14:32:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 14:32:49,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 14:32:50,968 INFO L281 TraceCheckUtils]: 0: Hoare triple {5190#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; {5190#true} is VALID [2021-09-13 14:32:50,969 INFO L281 TraceCheckUtils]: 1: Hoare triple {5190#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {5198#(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:32:50,970 INFO L281 TraceCheckUtils]: 2: Hoare triple {5198#(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); {5202#(bvsge ULTIMATE.start_main_~x~0 (_ bv1 32))} is VALID [2021-09-13 14:32:50,970 INFO L281 TraceCheckUtils]: 3: Hoare triple {5202#(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; {5206#(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:32:50,971 INFO L281 TraceCheckUtils]: 4: Hoare triple {5206#(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); {5210#(and (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,971 INFO L281 TraceCheckUtils]: 5: Hoare triple {5210#(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); {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,972 INFO L281 TraceCheckUtils]: 6: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,972 INFO L281 TraceCheckUtils]: 7: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,972 INFO L281 TraceCheckUtils]: 8: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,973 INFO L281 TraceCheckUtils]: 9: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,973 INFO L281 TraceCheckUtils]: 10: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,974 INFO L281 TraceCheckUtils]: 11: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} assume !~bvsge64(main_~c~0, main_~b~0); {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~0))} is VALID [2021-09-13 14:32:50,974 INFO L281 TraceCheckUtils]: 12: Hoare triple {5214#(and (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~b~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~q~0) (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~s~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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,975 INFO L281 TraceCheckUtils]: 13: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,975 INFO L281 TraceCheckUtils]: 14: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,976 INFO L281 TraceCheckUtils]: 15: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,976 INFO L281 TraceCheckUtils]: 16: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,976 INFO L281 TraceCheckUtils]: 17: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,977 INFO L281 TraceCheckUtils]: 18: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} assume !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,977 INFO L281 TraceCheckUtils]: 19: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} main_#t~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} is VALID [2021-09-13 14:32:50,978 INFO L281 TraceCheckUtils]: 20: Hoare triple {5236#(and (= ((_ sign_extend 32) (_ bv1 32)) ULTIMATE.start_main_~r~0) (= ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~a~0) (bvsge ULTIMATE.start_main_~x~0 (_ bv1 32)) (= ((_ sign_extend 32) (_ bv0 32)) ULTIMATE.start_main_~p~0) (bvsge ULTIMATE.start_main_~y~0 (_ bv1 32)))} assume !!~bvslt32(main_#t~post11, 20bv32);havoc main_#t~post11;__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; {5261#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} is VALID [2021-09-13 14:32:50,978 INFO L281 TraceCheckUtils]: 21: Hoare triple {5261#(= ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond; {5191#false} is VALID [2021-09-13 14:32:50,978 INFO L281 TraceCheckUtils]: 22: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2021-09-13 14:32:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:32:50,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 14:33:07,035 INFO L281 TraceCheckUtils]: 22: Hoare triple {5191#false} assume !false; {5191#false} is VALID [2021-09-13 14:33:07,035 INFO L281 TraceCheckUtils]: 21: Hoare triple {5271#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {5191#false} is VALID [2021-09-13 14:33:07,036 INFO L281 TraceCheckUtils]: 20: Hoare triple {5275#(= (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~post11, 20bv32);havoc main_#t~post11;__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; {5271#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2021-09-13 14:33:07,036 INFO L281 TraceCheckUtils]: 19: Hoare triple {5275#(= (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~post11 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post11); {5275#(= (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:33:07,036 INFO L281 TraceCheckUtils]: 18: Hoare triple {5275#(= (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 !!~bvsge64(main_~c~0, main_~b~0);havoc main_~d~0;havoc main_~v~0;main_~d~0 := ~sign_extendFrom32To64(1bv32);main_~v~0 := main_~b~0; {5275#(= (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:33:07,036 INFO L281 TraceCheckUtils]: 17: Hoare triple {5275#(= (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; {5275#(= (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:33:07,037 INFO L281 TraceCheckUtils]: 16: Hoare triple {5275#(= (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); {5275#(= (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:33:07,037 INFO L281 TraceCheckUtils]: 15: Hoare triple {5275#(= (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));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {5275#(= (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:33:07,037 INFO L281 TraceCheckUtils]: 14: Hoare triple {5275#(= (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; {5275#(= (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:33:07,037 INFO L281 TraceCheckUtils]: 13: Hoare triple {5275#(= (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); {5275#(= (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:33:07,038 INFO L281 TraceCheckUtils]: 12: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~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 := ~bvsub64(main_~temp~0, ~bvmul64(main_~q~0, main_~k~0));main_~temp~0 := main_~r~0;main_~r~0 := main_~s~0;main_~s~0 := ~bvsub64(main_~temp~0, ~bvmul64(main_~s~0, main_~k~0)); {5275#(= (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:33:07,038 INFO L281 TraceCheckUtils]: 11: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !~bvsge64(main_~c~0, main_~b~0); {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,038 INFO L281 TraceCheckUtils]: 10: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvslt32(main_#t~post10, 20bv32);havoc main_#t~post10; {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,039 INFO L281 TraceCheckUtils]: 9: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} main_#t~post10 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post10); {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,039 INFO L281 TraceCheckUtils]: 8: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!(main_~b~0 != ~sign_extendFrom32To64(0bv32));havoc main_~c~0;havoc main_~k~0;main_~c~0 := main_~a~0;main_~k~0 := ~sign_extendFrom32To64(0bv32); {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,039 INFO L281 TraceCheckUtils]: 7: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} assume !!~bvslt32(main_#t~post9, 20bv32);havoc main_#t~post9; {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,039 INFO L281 TraceCheckUtils]: 6: Hoare triple {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} main_#t~post9 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post9); {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,040 INFO L281 TraceCheckUtils]: 5: Hoare triple {5190#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); {5300#(= (bvadd (bvmul ULTIMATE.start_main_~q~0 ((_ sign_extend 32) ULTIMATE.start_main_~x~0)) (bvmul ((_ sign_extend 32) ULTIMATE.start_main_~y~0) ULTIMATE.start_main_~s~0)) ULTIMATE.start_main_~b~0)} is VALID [2021-09-13 14:33:07,040 INFO L281 TraceCheckUtils]: 4: Hoare triple {5190#true} assume !(0bv32 == assume_abort_if_not_~cond); {5190#true} is VALID [2021-09-13 14:33:07,040 INFO L281 TraceCheckUtils]: 3: Hoare triple {5190#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; {5190#true} is VALID [2021-09-13 14:33:07,040 INFO L281 TraceCheckUtils]: 2: Hoare triple {5190#true} assume !(0bv32 == assume_abort_if_not_~cond); {5190#true} is VALID [2021-09-13 14:33:07,040 INFO L281 TraceCheckUtils]: 1: Hoare triple {5190#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~post11, main_~d~0, main_~v~0, main_#t~post10, main_~c~0, main_~k~0, 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;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;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; {5190#true} is VALID [2021-09-13 14:33:07,040 INFO L281 TraceCheckUtils]: 0: Hoare triple {5190#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; {5190#true} is VALID [2021-09-13 14:33:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 14:33:07,041 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 14:33:07,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657059163] [2021-09-13 14:33:07,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657059163] provided 0 perfect and 2 imperfect interpolant sequences [2021-09-13 14:33:07,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-09-13 14:33:07,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2021-09-13 14:33:07,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703398378] [2021-09-13 14:33:07,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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) Word has length 23 [2021-09-13 14:33:07,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 14:33:07,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:33:08,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 14:33:08,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-09-13 14:33:08,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 14:33:08,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-09-13 14:33:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-09-13 14:33:08,152 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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:33:46,396 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:33:48,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-09-13 14:33:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 14:33:48,498 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 14290.74ms TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-09-13 14:33:48,498 INFO L928 BasicCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17298.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.37ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17300.18ms IncrementalHoareTripleChecker+Time [2021-09-13 14:33:48,498 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 1.37ms Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 17300.18ms Time] [2021-09-13 14:33:48,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-09-13 14:33:48,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 14:33:48,699 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@63547c9a 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:33:48,702 INFO L158 Benchmark]: Toolchain (without parser) took 362808.30ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 43.8MB in the beginning and 42.2MB in the end (delta: 1.5MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2021-09-13 14:33:48,703 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 45.1MB in the beginning and 45.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:33:48,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.88ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 45.2MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 14:33:48,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.17ms. Allocated memory is still 62.9MB. Free memory was 45.2MB in the beginning and 43.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-09-13 14:33:48,703 INFO L158 Benchmark]: Boogie Preprocessor took 47.63ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 41.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 14:33:48,703 INFO L158 Benchmark]: RCFGBuilder took 4318.61ms. Allocated memory is still 62.9MB. Free memory was 41.7MB in the beginning and 30.0MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 14:33:48,703 INFO L158 Benchmark]: TraceAbstraction took 358218.99ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 29.6MB in the beginning and 42.2MB in the end (delta: -12.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2021-09-13 14:33:48,704 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.16ms. Allocated memory is still 62.9MB. Free memory was 45.1MB in the beginning and 45.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.88ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 45.2MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.17ms. Allocated memory is still 62.9MB. Free memory was 45.2MB in the beginning and 43.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.63ms. Allocated memory is still 62.9MB. Free memory was 43.1MB in the beginning and 41.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4318.61ms. Allocated memory is still 62.9MB. Free memory was 41.7MB in the beginning and 30.0MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 358218.99ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 29.6MB in the beginning and 42.2MB in the end (delta: -12.7MB). Peak memory consumption was 5.3MB. 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@63547c9a de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@63547c9a: 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:33:48,760 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...